A meta-heuristic based on the Imperialist Competitive Algorithm (ICA) for solving Hybrid Flow Shop (HFS) scheduling problem with unrelated parallel machines

2019 ◽  
Vol 36 (6) ◽  
pp. 362-370
Author(s):  
Edwin A. Garavito-Hernández ◽  
Eliana Peña-Tibaduiza ◽  
Luis E. Perez-Figueredo ◽  
Eslendis Moratto-Chimenty
Keyword(s):  
Parallel Machines ◽  
Flow Shop ◽  
Imperialist Competitive Algorithm ◽  
Hybrid Flow Shop ◽  
Scheduling Problem ◽  
Unrelated Parallel Machines ◽  
Competitive Algorithm

Surgical Scheduling Based on Hybrid Flow-Shop Scheduling

2012 ◽  
Vol 201-202 ◽  
pp. 1004-1007 ◽  
Author(s):  
Guo Xun Huang ◽  
Wei Xiang ◽  
Chong Li ◽  
Qian Zheng ◽  
Shan Zhou ◽  
...  
Keyword(s):  
Parallel Machines ◽  
Flow Shop ◽  
Elective Surgery ◽  
Optimal Solution ◽  
Flow Shop Scheduling ◽  
Hybrid Flow Shop ◽  
Scheduling Problem ◽  
Shop Scheduling ◽  
Surgical Scheduling ◽  
Hybrid Flow Shop Scheduling

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.

Sign in / Sign up

Export Citation Format

Share Document