Abstract
In a recent paper (Lv and Wang, Study on proportionate flowshop scheduling with due-date assignment and position-dependent weights. Optim. Lett., 2021. https://doi.org/10.1007/s11590-020-01670-4), Lv and Wang studied due date proportionate flowshop scheduling problems with position-dependent weights. For common due date and slack due date assignments, they proved that these two problems can be solved in \(O(n\log n)\) time respectively, where n is the number of jobs. For slack due date assignment, there is an error. We will show the error by a counter example and explain why it is incorrect.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Lv, D.Y., Wang, J.B.: Study on proportionate flowshop scheduling with due-date assignment and position-dependent weights. Optim. Lett. (2021). https://doi.org/10.1007/s11590-020-01670-4
Panwalkar, S.S., Koulamas, C.: On equivalence between the proportionate flow shop and single-machine scheduling problems. Naval Res. Logist. 62(7), 595–603 (2015)
Acknowledgements
This work was supported by the Fundamental Research Funds for the Central Universities, China (Grant No. N2105020).
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Qian, J., Chang, G. A note on study on proportionate flowshop scheduling with due-date assignment and position-dependent weights. Optim Lett 16, 2645–2648 (2022). https://doi.org/10.1007/s11590-021-01843-9
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11590-021-01843-9