Minimising makespan for two batch-processing machines with non-identical job sizes in job shop (Q2935125)
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: Minimising makespan for two batch-processing machines with non-identical job sizes in job shop |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimising makespan for two batch-processing machines with non-identical job sizes in job shop |
scientific article |
Statements
Minimising makespan for two batch-processing machines with non-identical job sizes in job shop (English)
0 references
22 December 2014
0 references
batch processing machines
0 references
non-identical job sizes
0 references
job shop
0 references
approximation algorithm
0 references
0 references
0 references
0 references
0 references
0 references
