A Local Search Algorithm for the Flow Shop Scheduling Problem with Release Dates. (19th March 2015)

• Record Type: Journal Article
• Authors: Ren, Tao; Guo, Meiting; Lin, Lin; Miao, Yunhui
• Other Names: Fan Baoqiang Academic Editor.
• Is Part Of: Discrete dynamics in nature and society. Volume 2015(2015)
• Publication Date: 2015-03-19
• Subjects: System analysis -- Periodicals; Dynamics -- Periodicals; Chaotic behavior in systems -- Periodicals; Differentiable dynamical systems -- Periodicals; 003.05
• DOI: 10.1155/2015/320140
• Languages: English
• ISSNs: 1026-0226

Abstract

Abstract : 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.