The nonpermutation flowshop scheduling problem: adjustment and bounding procedures (Q2336283)
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 7131469
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The nonpermutation flowshop scheduling problem: adjustment and bounding procedures |
scientific article; zbMATH DE number 7131469 |
Statements
The nonpermutation flowshop scheduling problem: adjustment and bounding procedures (English)
0 references
19 November 2019
0 references
Summary: We consider the makespan minimization in a flowshop environment where the job sequence does not have to be the same for all the machines. Contrarily to the classical permutation flowshop scheduling problem, this strongly NP-hard problem received very scant attention in the literature. In this paper, some improved single-machine-based adjustment procedures are proposed, and a new two-machine-based one is introduced. Based on these adjustments, new lower and upper bounding schemes are derived. Our experimental analysis shows that the proposed procedures provide promising results.
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8351398706436157
0 references
0.827433705329895
0 references
0.8271251916885376
0 references
0.8183572888374329
0 references
0.8093830943107605
0 references
