The one-machine just-in-time scheduling problem with preemption (Q1013290)
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: The one-machine just-in-time scheduling problem with preemption |
scientific article; zbMATH DE number 5544684
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The one-machine just-in-time scheduling problem with preemption |
scientific article; zbMATH DE number 5544684 |
Statements
The one-machine just-in-time scheduling problem with preemption (English)
0 references
17 April 2009
0 references
single-machine scheduling
0 references
just-in-time
0 references
preemption
0 references
0 references
0 references
0 references
0 references
0.8507989645004272
0 references
0.830394446849823
0 references
0.8179615139961243
0 references
0.8179615139961243
0 references
0.8167883157730103
0 references
