Single machine family scheduling with two competing agents to minimize makespan (Q3114615)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6007188
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Single machine family scheduling with two competing agents to minimize makespan |
scientific article; zbMATH DE number 6007188 |
Statements
SINGLE MACHINE FAMILY SCHEDULING WITH TWO COMPETING AGENTS TO MINIMIZE MAKESPAN (English)
0 references
19 February 2012
0 references
family scheduling
0 references
multi-agent deterministic sequencing
0 references
setup
0 references
0 references
0 references
0 references
0.8833274841308594
0 references
0.8593571782112122
0 references
0.8268275260925293
0 references
0.8218873739242554
0 references
0.81878262758255
0 references
