Solvable Cases of the No-wait Flow-shop Scheduling Problem (Q3984309): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 23:55, 29 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solvable Cases of the No-wait Flow-shop Scheduling Problem |
scientific article |
Statements
Solvable Cases of the No-wait Flow-shop Scheduling Problem (English)
0 references
27 June 1992
0 references
no-wait flow-shop scheduling
0 references
makespan objective function
0 references
travelling salesman
0 references
polynomial solvable cases
0 references
semi-ordered processing times
0 references
mean objective function
0 references
