Scheduling with a common due-window: polynomially solvable cases (Q2269806): Difference between revisions
From MaRDI portal
Latest revision as of 13:43, 2 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Scheduling with a common due-window: polynomially solvable cases |
scientific article |
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