Local Search Methods for a Distributed Assembly No-Idle Flow Shop Scheduling Problem

2019 ◽  
Vol 13 (2) ◽  
pp. 1945-1956 ◽  
Author(s):  
Weishi Shao ◽  
Dechang Pi ◽  
Zhongshi Shao
Keyword(s):  
Local Search ◽  
Flow Shop ◽  
Flow Shop Scheduling ◽  
Scheduling Problem ◽  
Search Methods ◽  
Shop Scheduling ◽  
Local Search Methods ◽  
Distributed Assembly

scholarly journals A Local Search Algorithm for the Flow Shop Scheduling Problem with Release Dates

2015 ◽  
Vol 2015 ◽  
pp. 1-8 ◽  
Author(s):  
Tao Ren ◽  
Meiting Guo ◽  
Lin Lin ◽  
Yunhui Miao
Keyword(s):  
Local Search ◽  
Flow Shop ◽  
Search Algorithm ◽  
Flow Shop Scheduling ◽  
Release Dates ◽  
Scheduling Problem ◽  
Local Search Algorithm ◽  
High Quality ◽  
Shop Scheduling ◽  
Simulation Results

This paper discusses the flow shop scheduling problem to minimize the makespan with release dates. By resequencing the jobs, a modified heuristic algorithm is obtained for handling large-sized problems. Moreover, based on some properties, a local search scheme is provided to improve the heuristic to gain high-quality solution for moderate-sized problems. A sequence-independent lower bound is presented to evaluate the performance of the algorithms. A series of simulation results demonstrate the effectiveness of the proposed algorithms.

Sign in / Sign up

Export Citation Format

Share Document