Optimal results and numerical simulations for flow shop scheduling problems (Q410955): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Created claim: Wikidata QID (P12): Q58906832, #quickstatements; #temporary_batch_1706897434465 |
||
Property / Wikidata QID | |||
Property / Wikidata QID: Q58906832 / rank | |||
Normal rank |
Revision as of 20:31, 2 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Optimal results and numerical simulations for flow shop scheduling problems |
scientific article |
Statements
Optimal results and numerical simulations for flow shop scheduling problems (English)
0 references
4 April 2012
0 references
Summary: This paper considers the m-machine flow shop problem with two objectives: makespan with release dates and total quadratic completion time, respectively. For \({\text F}m|r_j|C_{\max}\), we prove the asymptotic optimality for any dense scheduling when the problem scale is large enough. For \({\text F}m||\Sigma C^2_j\), improvement strategy with local search is presented to promote the performance of the classical SPT heuristic. At the end of the paper, simulations show the effectiveness of the improvement strategy.
0 references