• Title/Summary/Keyword: Optimal Scheduling

Search Result 772, Processing Time 0.025 seconds

A Study on Dong Scheduling Using HIV Dynamics and Optimal Control (HIV 동역학과 최적 제어를 이용한 약물 치료에 관한 고찰)

  • 허영희;고지현;김진영;남상원;심형보;정정주
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.10 no.6
    • /
    • pp.475-486
    • /
    • 2004
  • The interaction of HIV and human immune system was studied in the perspective of dynamics. We summarized the recent researches on drug scheduling using optimal control theory for HIV treatment. The drug treatment to make immune system to work properly is investigated based on mathematical models including memory CTLp. In the simulation results, it was verified that stopping medication after a certain period of treatment can lead a patient to be cured naturally by one s immune system. Also, we summarized and categorized the advantages and disadvantages of each HIV drug scheduling method. In conclusion, model-based predictive control is more efficient for making decision of drug dose than other methods, when there exist uncertainties on model parameters or state variables.

Customer Order Scheduling Problems on Parallel Machines with Job Capacity Restriction

  • Yang, Jaehwan
    • Management Science and Financial Engineering
    • /
    • v.9 no.2
    • /
    • pp.47-68
    • /
    • 2003
  • We consider the customer order scheduling problem with job capacity restriction where the number of jobs in the shop at the same time is fixed. In the customer order scheduling problem, each job is part of some batch (customer order) and the composition of the jobs (product) in the batch is pre-specified. The objective function is associated with the completion time of the batches instead of the completion time of the jobs. We first summarize the known results for the general customer order scheduling problems. Then, we establish some new properties for the problems with job capacity restriction. For the case of unit processing time with the objective of minimizing makespan, we develop a polynomial-time optimal procedure for the two machine case. For the same problem with a variation of no batch alternation, we also develop a polynomial-time optimal procedure. Then, we show that the problems with the objectives of minimizing makespan and minimizing average batch completion time become NP-hard when there exist arbitrary number of machines. Finally, We propose optimal solution procedures for some special cases.

Efficient Elitist Genetic Algorithm for Resource-Constrained Project Scheduling

  • Kim, Jin-Lee
    • Korean Journal of Construction Engineering and Management
    • /
    • v.8 no.6
    • /
    • pp.235-245
    • /
    • 2007
  • This research study presents the development and application of an Elitist Genetic Algorithm (Elitist GA) for solving the resource-constrained project scheduling problem, which is one of the most challenging problems in construction engineering. Main features of the developed algorithm are that the elitist roulette selection operator is developed to preserve the best individual solution for the next generation so as to obtain the improved solution, and that parallel schedule generation scheme is used to generate a feasible solution to the problem. The experimental results on standard problem sets indicate that the proposed algorithm not only produces reasonably good solutions to the problems over the heuristic method and other GA, but also can find the optimal and/or near optimal solutions for the large-sized problems with multiple resources within a reasonable amount of time that will be applicable to the construction industry. This paper will help researchers and/or practitioners in the construction project scheduling software area with alternative means to find the optimal schedules by utilizing the advantages of the Elitist GA.

Non-Identical Parallel Machine Scheduling with Sequence and Machine Dependent Setup Times Using Meta-Heuristic Algorithms

  • Joo, Cheol-Min;Kim, Byung-Soo
    • Industrial Engineering and Management Systems
    • /
    • v.11 no.1
    • /
    • pp.114-122
    • /
    • 2012
  • This paper considers a non-identical parallel machine scheduling problem with sequence and machine dependent setup times. The objective of this problem is to determine the allocation of jobs and the scheduling of each machine to minimize makespan. A mathematical model for optimal solution is derived. An in-depth analysis of the model shows that it is very complicated and difficult to obtain optimal solutions as the problem size becomes large. Therefore, two meta-heuristics, genetic algorithm (GA) and a new population-based evolutionary meta-heuristic called self-evolution algorithm (SEA), are proposed. The performances of the meta-heuristic algorithms are evaluated through compare with optimal solutions using randomly generated several examples.

Optimal Scheduling of Level 5 Electric Vehicle Chargers Based on Voltage Level

  • Sung-Kook Jeon;Dongho Lee
    • Journal of the Korean Society of Industry Convergence
    • /
    • v.26 no.6_1
    • /
    • pp.985-991
    • /
    • 2023
  • This study proposes a solution to the voltage drop in electric vehicle chargers, due to the parasitic resistance and inductance of power cables when the chargers are separated by large distances. A method using multi-level electric vehicle chargers that can output power in stages, without installing an additional energy supply source such as a reactive power compensator or an energy storage system, is proposed. The voltage drop over the power cables, to optimize the charging scheduling, is derived. The obtained voltage drop equation is used to formulate the constraints of the optimization process. To validate the effectiveness of the obtained results, an optimal charging scheduling is performed for each period in a case study based on the assumed charging demands of three connected chargers. From the calculations, the proposed method was found to generate an annual profit of $20,800 for a $12,500 increase in installation costs.

A Study on the Optimal Operation of the Private Cogeneration System (민생용 열병합발전시스템의 최적운전에 관한 연구)

  • Lyu, Seung-Heon;Lee, Jong-Bum;Kim, Chang-Soo
    • Proceedings of the KIEE Conference
    • /
    • 1996.07b
    • /
    • pp.896-898
    • /
    • 1996
  • This paper presents the optimal operation scheduling of the private cogeneration system connected with auxiliary equipments. And the optimal size of auxiliary equipments is determined through evaluations of the minimum operation cost. The optimal operation scheduling is established by using the linear programming method. Simulation results show that the auxiliary boiler is operated as an economical facility but the thermal storage tank is used as a back up facility for emergency.

  • PDF

Operation Scheduling of Multi-Cogeneration System with Various Thermal Load (다양한 종류의 열부하를 가진 다기열병합발전시스템의 최적운용계획 수립)

  • Jung, Ji-Hoon;Lee, Jong-Beom
    • Proceedings of the KIEE Conference
    • /
    • 1999.07c
    • /
    • pp.1273-1275
    • /
    • 1999
  • This paper describes the optimal operation scheduling on cogeneration systems which have thermal loads of different pressure each other. The cogeneration systems has two units and operate connecting with various auxiliary devices as heat storage tanks, independent generators and auxiliary boilers. The optimal modeling and scheduling technique proposed in this paper will be applied to industrial cogeneration systems.

  • PDF

Optimal Operation Scheduling Using Possibility Fuzzy Theory on Cogeneration Systems Connected with Auxiliary Equipment (각종 보조설비가 연계된 열병합발전시스템에서 가능성 퍼지이론을 적용한 최적운전계획수립)

  • Kim, Sung-Il;Jung, Chang-Ho;Lee, Jong-Beon
    • Proceedings of the KIEE Conference
    • /
    • 1995.11a
    • /
    • pp.128-130
    • /
    • 1995
  • This paper presents the optimal operation scheduling on cogeneration systems connected with auxiliary equipment by using the possibility fuzzy theory. The probability fuzzy theory is a method to obtain the possibility of the solution from the fuzzification of coefficients. Simulation is carried out to obtain the boundary of heat production in each time interval. Simulation results shows effectively the flexible operation boundary to establish operation scheduling.

  • PDF

Uniform Parallel Machine Scheduling (병렬기계에서의 스케쥴링에 관한 연구)

  • Kim, Dae-Cheol
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.29 no.2
    • /
    • pp.7-12
    • /
    • 2006
  • This study considers the problem of scheduling jobs on uniform parallel machines with a common due date. The objective is to minimize the total absolute deviation of job completion times about the common due date. This problem is motivated by the fact that a certain phase of printed circuit board manufacturing is bottleneck and the processing speeds of parallel machines in this phase are uniformly different for all jobs. Optimal properties are proved and a simple polynomial time optimal algorithm is developed.

Optimal Block Lifting Scheduling Considering the Minimization of Travel Distance at an Idle State and Wire Replacement of a Goliath Crane (골리앗 크레인의 공주행 거리와 와이어 교체 최소를 고려한 최적 블록 리프팅 계획)

  • Roh, Myung-Il;Lee, Kyu-Yeul
    • Korean Journal of Computational Design and Engineering
    • /
    • v.15 no.1
    • /
    • pp.1-10
    • /
    • 2010
  • Recently, a shipyard is making every effort to efficiently manage equipments of resources such as a gantry crane, transporter, and so on. So far block lifting scheduling of a gantry crane has been manually performed by a manager of the shipyard, and thus it took much time to get scheduling results and moreover the quality of them was not optimal. To improve this, a block lifting scheduling system of the gantry crane using optimization techniques was developed in this study. First, a block lifting scheduling problem was mathematically formulated as a multi-objective optimization problem, considering the minimization of travel distance at an idle state and wire replacement during block lifting. Then, to solve the problem, a meta-heuristic optimization algorithm based on the genetic algorithm was proposed. To evaluate the efficiency and applicability of the developed system, it was applied to an actual block lifting scheduling problem of the shipyard. The result shows that blocks can be efficiently lifted by the gantry crane using the developed system, compared to manual scheduling by a manager.