A branch-and-bound algorithm for a two-machine flowshop scheduling problem with limited waiting time constraints (Q3636717): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1057/palgrave.jors.2602598 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2047622520 / rank | |||
Normal rank | |||
Latest revision as of 00:34, 20 March 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
