On-line scheduling on a batch processing machine with unbounded batch size to minimize the makespan (Q2482805): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 01:47, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On-line scheduling on a batch processing machine with unbounded batch size to minimize the makespan |
scientific article |
Statements
On-line scheduling on a batch processing machine with unbounded batch size to minimize the makespan (English)
0 references
24 April 2008
0 references
batch processing machine
0 references
competitive analysis
0 references
