Minimizing makespan in a two-machine flow shop with delays and unit-time operations is NP-hard (Q2464428): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q161973 |
Changed an Item |
||
| Property / author | |||
| Property / author: Hoogeveen, J. A. / rank | |||
Normal rank | |||
Revision as of 20:00, 9 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimizing makespan in a two-machine flow shop with delays and unit-time operations is NP-hard |
scientific article |
Statements
Minimizing makespan in a two-machine flow shop with delays and unit-time operations is NP-hard (English)
0 references
20 December 2007
0 references
