Two-machine flowshop scheduling to minimize total tardiness (Q4352599): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: Wikidata QID (P12): Q126250364, #quickstatements; #temporary_batch_1718109305272 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q126250364 / rank | |||
Normal rank | |||
Latest revision as of 13:40, 11 June 2024
scientific article; zbMATH DE number 1057550
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Two-machine flowshop scheduling to minimize total tardiness |
scientific article; zbMATH DE number 1057550 |
Statements
Two-machine flowshop scheduling to minimize total tardiness (English)
0 references
4 September 1997
0 references
sequencing
0 references
two-machine flowshop
0 references
total tardiness
0 references
branch-and-bound
0 references
precedence relations
0 references
0 references
0 references
