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

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.