On VNS-GRASP and Iterated Greedy Metaheuristics for Solving Hybrid Flow Shop Scheduling Problem with Uniform Parallel Machines and Sequence Independent Setup Time

2020 ◽  
pp. 17-32
Author(s):  
Said Aqil ◽  
Karam Allali
Keyword(s):  
Parallel Machines ◽  
Flow Shop ◽  
Setup Time ◽  
Flow Shop Scheduling ◽  
Hybrid Flow Shop ◽  
Scheduling Problem ◽  
Shop Scheduling ◽  
Hybrid Flow Shop Scheduling ◽  
Iterated Greedy

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.

scholarly journals Efficient Bounding Schemes for the Two-Center Hybrid Flow Shop Scheduling Problem with Removal Times

2014 ◽  
Vol 2014 ◽  
pp. 1-7 ◽  
Author(s):  
Lotfi Hidri ◽  
Anis Gharbi ◽  
Mohamed Aly Louly
Keyword(s):  
Parallel Machines ◽  
Flow Shop ◽  
Parallel Machine Scheduling ◽  
Flow Shop Scheduling ◽  
Hybrid Flow Shop ◽  
Second Phase ◽  
Scheduling Problem ◽  
Shop Scheduling ◽  
Delivery Times ◽  
Hybrid Flow Shop Scheduling

We focus on the two-center hybrid flow shop scheduling problem with identical parallel machines and removal times. The job removal time is the required duration to remove it from a machine after its processing. The objective is to minimize the maximum completion time (makespan). A heuristic and a lower bound are proposed for this NP-Hard problem. These procedures are based on the optimal solution of the parallel machine scheduling problem with release dates and delivery times. The heuristic is composed of two phases. The first one is a constructive phase in which an initial feasible solution is provided, while the second phase is an improvement one. Intensive computational experiments have been conducted to confirm the good performance of the proposed procedures.

Sign in / Sign up

Export Citation Format

Share Document