A Local Search Algorithm for the Flow Shop Scheduling Problem with Release Dates
Joint Authors
Guo, Meiting
Lin, Lin
Miao, Yunhui
Ren, Tao
Source
Discrete Dynamics in Nature and Society
Issue
Vol. 2015, Issue 2015 (31 Dec. 2015), pp.1-8, 8 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2015-03-19
Country of Publication
Egypt
No. of Pages
8
Main Subjects
Abstract EN
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.
American Psychological Association (APA)
Ren, Tao& Guo, Meiting& Lin, Lin& Miao, Yunhui. 2015. A Local Search Algorithm for the Flow Shop Scheduling Problem with Release Dates. Discrete Dynamics in Nature and Society،Vol. 2015, no. 2015, pp.1-8.
https://search.emarefa.net/detail/BIM-1060468
Modern Language Association (MLA)
Ren, Tao…[et al.]. A Local Search Algorithm for the Flow Shop Scheduling Problem with Release Dates. Discrete Dynamics in Nature and Society No. 2015 (2015), pp.1-8.
https://search.emarefa.net/detail/BIM-1060468
American Medical Association (AMA)
Ren, Tao& Guo, Meiting& Lin, Lin& Miao, Yunhui. A Local Search Algorithm for the Flow Shop Scheduling Problem with Release Dates. Discrete Dynamics in Nature and Society. 2015. Vol. 2015, no. 2015, pp.1-8.
https://search.emarefa.net/detail/BIM-1060468
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-1060468