Two-machine flowshop minimum-length scheduling problem with random and bounded processing times (Q4806914): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 01:57, 8 February 2024
scientific article; zbMATH DE number 1911100
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Two-machine flowshop minimum-length scheduling problem with random and bounded processing times |
scientific article; zbMATH DE number 1911100 |
Statements
Two-machine flowshop minimum-length scheduling problem with random and bounded processing times (English)
0 references
23 June 2003
0 references
scheduling
0 references
flowshop
0 references
makespan
0 references
dominance relations
0 references
