Minimizing makespan in a two-machine flow shop with delays and unit-time operations is NP-hard (Q2464428): Difference between revisions
From MaRDI portal
Created a new Item |
Set profile property. |
||
(3 intermediate revisions by 2 users not shown) | |||
Property / author | |||
Property / author: Hoogeveen, J. A. / rank | |||
Property / author | |||
Property / author: Hoogeveen, J. A. / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 08:13, 5 March 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