Branch-and-bound algorithms for minimizing total earliness and tardiness in a two-machine permutation flow shop with unforced idle allowed (Q2003555): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q128002723, #quickstatements; #temporary_batch_1722463431396 |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.cor.2019.04.017 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.COR.2019.04.017 / rank | |||
Normal rank | |||
Latest revision as of 17:59, 16 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Branch-and-bound algorithms for minimizing total earliness and tardiness in a two-machine permutation flow shop with unforced idle allowed |
scientific article |
Statements
Branch-and-bound algorithms for minimizing total earliness and tardiness in a two-machine permutation flow shop with unforced idle allowed (English)
0 references
9 July 2019
0 references
scheduling
0 references
branch-and-bound
0 references
flow shop
0 references
earliness and tardiness
0 references
0 references
0 references
