Fast algorithms to minimize the makespan or maximum lateness in the two-machine flow shop with release times. (Q1347602)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Fast algorithms to minimize the makespan or maximum lateness in the two-machine flow shop with release times. |
scientific article; zbMATH DE number 1735617
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fast algorithms to minimize the makespan or maximum lateness in the two-machine flow shop with release times. |
scientific article; zbMATH DE number 1735617 |
Statements
Fast algorithms to minimize the makespan or maximum lateness in the two-machine flow shop with release times. (English)
0 references
27 July 2003
0 references
permutation flow shop
0 references
makespan
0 references
lateness
0 references
release times
0 references
0 references
0 references
0 references
