Optimal results and numerical simulations for flow shop scheduling problems (Q410955): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / review text | |||
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. | |||
| Property / review text: 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. / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90B35 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90C59 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 65K05 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6021680 / rank | |||
Normal rank | |||
Revision as of 19:32, 29 June 2023
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
