Branch-and-bound algorithms for minimizing total earliness and tardiness in a two-machine permutation flow shop with unforced idle allowed (Q2003555)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7077660
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Branch-and-bound algorithms for minimizing total earliness and tardiness in a two-machine permutation flow shop with unforced idle allowed |
scientific article; zbMATH DE number 7077660 |
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
0.8637937903404236
0 references
0.844118595123291
0 references
0.843717634677887
0 references
0.8421915769577026
0 references
0.8327118158340454
0 references
