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
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.cor.2009.12.007 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1978018515 / rank | |||
Normal rank | |||
Revision as of 00:21, 20 March 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
