An effective shuffled frog-leaping algorithm for solving the hybrid flow-shop scheduling problem with identical parallel machines

2013 ◽  
Vol 45 (12) ◽  
pp. 1409-1430 ◽  
Author(s):  
Ye Xu ◽  
Ling Wang ◽  
Shengyao Wang ◽  
Min Liu
Keyword(s):  
Parallel Machines ◽  
Flow Shop ◽  
Flow Shop Scheduling ◽  
Hybrid Flow Shop ◽  
Scheduling Problem ◽  
Identical Parallel Machines ◽  
Shuffled Frog Leaping Algorithm ◽  
Shop Scheduling ◽  
Hybrid Flow Shop Scheduling ◽  
Shuffled Frog Leaping

scholarly journals A cooperated shuffled frog-leaping algorithm for distributed energy-efficient hybrid flow shop scheduling with fuzzy processing time

2021 ◽  
Author(s):  
Jingcao Cai ◽  
Deming Lei
Keyword(s):  
Energy Efficient ◽  
Flow Shop ◽  
Flow Shop Scheduling ◽  
Hybrid Flow Shop ◽  
Distributed Energy ◽  
Shuffled Frog Leaping Algorithm ◽  
Shop Scheduling ◽  
Fuzzy Processing Time ◽  
Hybrid Flow Shop Scheduling ◽  
Shuffled Frog Leaping

AbstractDistributed hybrid flow shop scheduling problem (DHFSP) has attracted some attention; however, DHFSP with uncertainty and energy-related element is seldom studied. In this paper, distributed energy-efficient hybrid flow shop scheduling problem (DEHFSP) with fuzzy processing time is considered and a cooperated shuffled frog-leaping algorithm (CSFLA) is presented to optimize fuzzy makespan, total agreement index and fuzzy total energy consumption simultaneously. Iterated greedy, variable neighborhood search and global search are designed using problem-related features; memeplex evaluation based on three quality indices is presented, an effective cooperation process between the best memeplex and the worst memeplex is developed according to evaluation results and performed by exchanging search times and search ability, and an adaptive population shuffling is adopted to improve search efficiency. Extensive experiments are conducted and the computational results validate that CSFLA has promising advantages on solving the considered DEHFSP.

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