Batching machine scheduling with bicriteria: maximum cost and makespan (Q2931723)
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: Batching machine scheduling with bicriteria: maximum cost and makespan |
scientific article; zbMATH DE number 6374342
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Batching machine scheduling with bicriteria: maximum cost and makespan |
scientific article; zbMATH DE number 6374342 |
Statements
BATCHING MACHINE SCHEDULING WITH BICRITERIA: MAXIMUM COST AND MAKESPAN (English)
0 references
26 November 2014
0 references
multicriteria scheduling
0 references
batching machine
0 references
maximum cost
0 references
Pareto optimal solutions
0 references
computational complexity
0 references
0 references
0.92221200466156
0 references
0.9220691919326782
0 references
0.9112173318862916
0 references
0.9015616178512572
0 references
