Two-agent single-machine scheduling problem with just-in-time jobs (Q2250441)
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: Two-agent single-machine scheduling problem with just-in-time jobs |
scientific article; zbMATH DE number 6313774
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Two-agent single-machine scheduling problem with just-in-time jobs |
scientific article; zbMATH DE number 6313774 |
Statements
Two-agent single-machine scheduling problem with just-in-time jobs (English)
0 references
7 July 2014
0 references
scheduling
0 references
competing agents
0 references
just-in-time job
0 references
complexity
0 references
0 references
0 references
0 references
0 references
0.901109516620636
0 references
0.8681852221488953
0 references
0.8625452518463135
0 references
0.8514478802680969
0 references
