Two-machine flow shop scheduling with a common due date to maximize total early work (Q2116855): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 22:32, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Two-machine flow shop scheduling with a common due date to maximize total early work |
scientific article |
Statements
Two-machine flow shop scheduling with a common due date to maximize total early work (English)
0 references
18 March 2022
0 references
combinatorial optimization
0 references
flow shop scheduling
0 references
early and late work
0 references
dynamic programming
0 references
FPTAS
0 references
