Scheduling with a common due-window: polynomially solvable cases (Q2269806)
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 5680351
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Scheduling with a common due-window: polynomially solvable cases |
scientific article; zbMATH DE number 5680351 |
Statements
Scheduling with a common due-window: polynomially solvable cases (English)
0 references
11 March 2010
0 references
scheduling
0 references
linear programming
0 references
earliness-tardiness cost
0 references
common due-window
0 references
0 references
0 references
0 references
0.9011999368667604
0 references
0.8987531661987305
0 references
0.8843897581100464
0 references
