Minimising makespan for two batch-processing machines with non-identical job sizes in job shop (Q2935125): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 20:15, 3 February 2024
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
