×

Comments on “Proportionate flowshops with general position dependent processing times” and “Minimizing total load on a proportionate flowshop with position-dependent processing times and job-rejection”. (English) Zbl 1411.90149

Summary: G. Mosheiov [ibid. 111, No. 4, 174–177 (2011; Zbl 1260.90094)] and S. Fiszman and G. Mosheiov [ibid. 132, 39–43 (2018; Zbl 1410.90086)] 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.

MSC:

90B35 Deterministic scheduling theory in operations research
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Agnetis, A.; Mosheiov, G., Scheduling with job-dependent and position-dependent processing times on proportionate flowshops, Opt. Lett., 11, 885-892 (2017) · Zbl 1369.90067
[2] Fiszman, S.; Mosheiov, G., Minimizing total load on a proportionate flowshop with position-dependent processing times and job-rejection, Inf. Process. Lett., 132, 39-43 (2018) · Zbl 1410.90086
[3] Mills-Tettey, G. A.; Stentz, A. T.; Dias, M. B., The Dynamic Hungarian Algorithm for the Assignment Problem with Changing Costs (July 2007), Robotics Institute: Robotics Institute Pittsburgh, PA, Tech. Rep. CMU-RI-TR-07-27
[4] Mosheiov, G., Proportionate flowshops with general position dependent processing times, Inf. Process. Lett., 111, 174-177 (2011) · Zbl 1260.90094
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.