Two-machine flow shop scheduling with common due window to minimize weighted number of early and tardy jobs (Q5305562)
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: Two-machine flow shop scheduling with common due window to minimize weighted number of early and tardy jobs |
scientific article; zbMATH DE number 5685839
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Two-machine flow shop scheduling with common due window to minimize weighted number of early and tardy jobs |
scientific article; zbMATH DE number 5685839 |
Statements
Two-machine flow shop scheduling with common due window to minimize weighted number of early and tardy jobs (English)
0 references
22 March 2010
0 references
flow shop scheduling
0 references
early and tardy jobs
0 references
due window
0 references
NP-hardness
0 references
dynamic programming
0 references
0 references
0 references
0 references
0 references
0 references
