scholarly journals Study on the Surgical Scheduling Problem Considering the Uncertainty of Operation Time

Author(s):  
Tang Rui ◽  
Lv Jie
Complexity ◽  
2021 ◽  
Vol 2021 ◽  
pp. 1-12
Author(s):  
Qing An ◽  
Jun Zhang ◽  
Xin Li ◽  
Xiaobing Mao ◽  
Yulong Feng ◽  
...  

The economical/environmental scheduling problem (EESP) of the ship integrated energy system (SIES) has high computational complexity, which includes more than one optimization objective, various types of constraints, and frequently fluctuated load demand. Therefore, the intelligent scheduling strategies cannot be applied to the ship energy management system (SEMS) online, which has limited computing power and storage space. Aiming at realizing green computing on SEMS, in this paper a typical SIES-EESP optimization model is built, considering the form of decision vectors, the economical/environmental optimization objectives, and various types of real-world constraints of the SIES. Based on the complexity of SIES-EESPs, a two-stage offline-to-online multiobjective optimization strategy for SIES-EESP is proposed, which transfers part of the energy dispatch online computing task to the offline high-performance computer systems. The specific constraints handling methods are designed to reduce both continuous and discrete constraints violations of SIES-EESPs. Then, an establishment method of energy scheduling scheme-base is proposed. By using the big data offline, the economical/environmental scheduling solutions of a typical year can be obtained and stored with more computing resources and operation time on land. Thereafter, a short-term multiobjective offline-to-online optimization approach by SEMS is considered, with the application of multiobjective evolutionary algorithm (MOEA) and typical schemes corresponding to the actual SIES-EESPs. Simulation results show that the proposed strategy can obtain enough feasible Pareto solutions in a shorter time and get well-distributed Pareto sets with better convergence performance, which can well adapt to the features of real-world SIES-EESPs and save plenty of operation time and storage space for the SEMS.


2011 ◽  
Vol 20 (3) ◽  
pp. 392-405 ◽  
Author(s):  
Jerrold H. May ◽  
William E. Spangler ◽  
David P. Strum ◽  
Luis G. Vargas

2012 ◽  
Vol 201-202 ◽  
pp. 1004-1007 ◽  
Author(s):  
Guo Xun Huang ◽  
Wei Xiang ◽  
Chong Li ◽  
Qian Zheng ◽  
Shan Zhou ◽  
...  

The efficient surgical scheduling of the operating theatre plays a significant role in hospital’s income and cost. Currently surgical scheduling only considered the surgery process in operating room and ignored other stages which should not be left out in real situations. The surgical scheduling problem is regarded as the hybrid flow-shop scheduling problem in this study. Each elective surgery which need local anesthesia has to go through a two-stage surgery procedure. Beds and operating rooms are represented as parallel machines. A mathematical model for such surgical scheduling problem is proposed and solved by LINGO. A case study with its optimal solution is also presented to verify the model.


2016 ◽  
Vol 25 (7) ◽  
pp. 1194-1202 ◽  
Author(s):  
Harish Guda ◽  
Milind Dawande ◽  
Ganesh Janakiraman ◽  
Kyung Sung Jung

2019 ◽  
Vol 11 (22) ◽  
pp. 6256 ◽  
Author(s):  
Fan ◽  
Ren ◽  
Guo ◽  
Li

Aiming at the truck scheduling problem between the outer yard and multi-terminals, the appointment optimization model of truck is established. In this model, the queue time and the operation time of truck during the appointment period of different terminals are different. Under the restriction of given appointment quotas of each appointment period, determine the arrival amount of trucks in each appointment period. The goal is to reduce carbon emissions and total costs, improve the efficiency of truck scheduling. To solve this model, hybrid genetic algorithm with variable neighborhood search was designed. Firstly, generate chromosomes, and the front part of the chromosome represents the demand for 40 ft containers and the back part represents the demand for 20 ft containers. Then, the route is generated according to the time constraint and appointment quotas of each appointment period. Finally, the neighborhood search strategy is adopted to improve the solution quality. The validity of the model and algorithm were verified by an example. A low-carbon scheduling scheme was obtained under truck appointment system. The results show that the scheduling scheme under truck appointment system uses fewer trucks, improves the efficiency of delivery, reduces the total costs, and it takes into account the requirements of low carbon.


2012 ◽  
Vol 605-607 ◽  
pp. 487-492 ◽  
Author(s):  
Feng Shan Pan ◽  
Chun Ming Ye ◽  
Jiao Yang

Flexible Job-shop Scheduling Problem is the extending of the classical Job-shop Scheduling Problem, which has more practical significance than JSP. This paper firstly presents a solution for FJSP under uncertainty based on QPSO algorithm, mainly on uncertain operation time and uncertain delivery time, and then describes the mathematical model and solving process. Subsequent sections concentrate on the designed and conducted experiment simulation using instances, and analyze the experimental results on the QPSO performance compared with some results of other traditional algorithms from literature review. Finally, this paper illustrates QPSO has better performance and shows the promising for dealing with FJSP.


2015 ◽  
Vol 32 (03) ◽  
pp. 1550016 ◽  
Author(s):  
Byung Soo Kim ◽  
Cheol Min Joo

One of the most important operational management problems of a cross docking system is the truck scheduling problem. Cross docking is a logistics management concept in which products delivered to a distribution center by inbound trucks are immediately sorted out, routed and loaded into outbound trucks for delivery to customers. The truck scheduling problem in a multi-door cross docking system considered in this paper comprises the assignment of trucks to dock doors and the determination of docking sequences for all inbound and outbound trucks in order to minimize the total operation time. A mathematical model for optimal solution is derived, and the genetic algorithms (GAs) and the adaptive genetic algorithms (AGAs) as solution approaches with different types of chromosomes are proposed. The performance of the meta-heuristic algorithms are evaluated using randomly generated several examples.


Sign in / Sign up

Export Citation Format

Share Document