Minimizing makespan and total completion time for parallel batch processing machines with non-identical job sizes (Q693407): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 10:27, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimizing makespan and total completion time for parallel batch processing machines with non-identical job sizes |
scientific article |
Statements
Minimizing makespan and total completion time for parallel batch processing machines with non-identical job sizes (English)
0 references
7 December 2012
0 references
batch scheduling
0 references
non-identical job sizes
0 references
parallel machines
0 references
approximation algorithm
0 references
