An \(O(n^{2})\) algorithm for the variable common due date, minimal tardy jobs bicriteria two-machine flow shop problem with ordered machines (Q1926814): Difference between revisions
From MaRDI portal
Latest revision as of 00:30, 6 July 2024
scientific article
| 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 |
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
