A branch and price algorithm to minimize makespan on a single batch processing machine with non-identical job sizes (Q976033): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 20:43, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch and price algorithm to minimize makespan on a single batch processing machine with non-identical job sizes |
scientific article |
Statements
A branch and price algorithm to minimize makespan on a single batch processing machine with non-identical job sizes (English)
0 references
11 June 2010
0 references
scheduling
0 references
batch processing machine
0 references
makespan
0 references
column generation
0 references
branch and price
0 references
