Openshop and flowshop scheduling to minimize sum of completion times (Q1086145)
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 3984953
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Openshop and flowshop scheduling to minimize sum of completion times |
scientific article; zbMATH DE number 3984953 |
Statements
Openshop and flowshop scheduling to minimize sum of completion times (English)
0 references
1984
0 references
This paper deals with efficiently solvable special cases of open shop and permutation-flowshop scheduling where the objective function is minimum sum of completion times. Two O(mn) algorithms for open shop scheduling where all operations have equal processing times, are presented. The first constructs a no-wait schedule and the second a schedule where both criteria (sum of completion times and schedule length) take on their minimal values. For permutation-flowshop scheduling where processing times satisfy dominancy and/or ordered relations, SPT rules are proved to be optimal.
0 references
open shop
0 references
permutation-flowshop scheduling
0 references
minimum sum of completion times
0 references
0.8699133396148682
0 references
0.8403605818748474
0 references
0.833527684211731
0 references
0.8334485292434692
0 references
