A branch and price algorithm to minimize makespan on a single batch processing machine with non-identical job sizes (Q976033)
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: A branch and price algorithm to minimize makespan on a single batch processing machine with non-identical job sizes |
scientific article; zbMATH DE number 5720306
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A branch and price algorithm to minimize makespan on a single batch processing machine with non-identical job sizes |
scientific article; zbMATH DE number 5720306 |
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
0 references
0 references
0 references
0 references
0 references
0 references
0.8601351380348206
0 references
0.8471929430961609
0 references
0.8427891135215759
0 references
0.8348755836486816
0 references
