A quadratic time algorithm to maximize the number of just-in-time jobs on identical parallel machines (Q2387307)
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: A quadratic time algorithm to maximize the number of just-in-time jobs on identical parallel machines |
scientific article; zbMATH DE number 2201663
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A quadratic time algorithm to maximize the number of just-in-time jobs on identical parallel machines |
scientific article; zbMATH DE number 2201663 |
Statements
A quadratic time algorithm to maximize the number of just-in-time jobs on identical parallel machines (English)
0 references
2 September 2005
0 references
Scheduling
0 references
Identical parallel machines
0 references
Just-in-time jobs
0 references
0 references
0.865526020526886
0 references
0.8468596339225769
0 references
0.8459898233413696
0 references
0.8399928212165833
0 references
0.8278563618659973
0 references
