Two-machine flow shop scheduling with a common due date to maximize total early work (Q2116855)
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 7493194
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Two-machine flow shop scheduling with a common due date to maximize total early work |
scientific article; zbMATH DE number 7493194 |
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
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8672020435333252
0 references
0.8564859628677368
0 references
0.8526444435119629
0 references
0.8455803990364075
0 references
0.8366143703460693
0 references
