Mosheiov  and Fiszman and Mosheiov  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.
Bibliographical notePublisher Copyright:
© 2019 Elsevier B.V.
- Bi-criteria assignment problem
- Position-dependent processing times