An \(O(n^{2})\) algorithm for the variable common due date, minimal tardy jobs bicriteria two-machine flow shop problem with ordered machines (Q1926814)
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: An \(O(n^{2})\) algorithm for the variable common due date, minimal tardy jobs bicriteria two-machine flow shop problem with ordered machines |
scientific article; zbMATH DE number 6119419
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An \(O(n^{2})\) algorithm for the variable common due date, minimal tardy jobs bicriteria two-machine flow shop problem with ordered machines |
scientific article; zbMATH DE number 6119419 |
Statements
An \(O(n^{2})\) algorithm for the variable common due date, minimal tardy jobs bicriteria two-machine flow shop problem with ordered machines (English)
0 references
29 December 2012
0 references
scheduling
0 references
flow shop
0 references
multi-criteria problems
0 references
0 references
