Abstract
Mosheiov [4] and Fiszman and Mosheiov [2] studied flowshop scheduling problems with position dependent job processing times and proposed algorithms which employ solving an assignment problem as a subroutine. This subroutine needs a correction. We describe such a correction. The running times of the corrected algorithms match the best known running times for the studied problems.
| Original language | English |
|---|---|
| Pages (from-to) | 1-2 |
| Number of pages | 2 |
| Journal | Information Processing Letters |
| Volume | 147 |
| DOIs |
|
| State | Published - Jul 2019 |
Bibliographical note
Publisher Copyright:© 2019 Elsevier B.V.
Keywords
- Bi-criteria assignment problem
- Flowshop
- Position-dependent processing times
- Scheduling
Fingerprint
Dive into the research topics of 'Comments on “Proportionate flowshops with general position dependent processing times” [Inf. Process. Lett. 111 (2011) 174–177] and “Minimizing total load on a proportionate flowshop with position-dependent processing times and job-rejection” [Inf. Process. Lett. 132 (2018) 39–43]'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver