A local search algorithm for the flow shop scheduling problem with release dates (Q1723292)
From MaRDI portal
![]() | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A local search algorithm for the flow shop scheduling problem with release dates |
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A local search algorithm for the flow shop scheduling problem with release dates |
scientific article |
Statements
A local search algorithm for the flow shop scheduling problem with release dates (English)
0 references
19 February 2019
0 references
Summary: 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.
0 references
0 references
0 references