A branch-and-bound algorithm for a two-machine flowshop scheduling problem with limited waiting time constraints (Q3636717): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 06:35, 5 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch-and-bound algorithm for a two-machine flowshop scheduling problem with limited waiting time constraints |
scientific article |
Statements
A branch-and-bound algorithm for a two-machine flowshop scheduling problem with limited waiting time constraints (English)
0 references
29 June 2009
0 references
scheduling
0 references
two-machine flowshop
0 references
limited waiting time
0 references
makespan
0 references
