Abstract
In a recent study, Sun et al. (AOR 292:113–131, 2020) studied due-window proportionate flow shop scheduling problems with position-dependent weights. For common due-window (denoted by CONW) and slack due-window (denoted by SLKW) assignment methods, they proved that these two problems can be solved in \(O(n^2\log n)\) time respectively, where n is the number of jobs. In this paper, we consider the same problems, and our contribution is that the CONW problem can be optimally solved by a lower-order algorithm, which runs in \(O(n\log n)\) time, implying an improvement of a factor of n.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Estévez-Fernández, A., Mosquera, M. A., Borm, P., & Hamers, H. (2008). Proportionate flow shop games. Journal of Scheduling, 11, 433–447.
Graham, R. L., Lawler, E. L., Lenstra, J. K., & Rinnooy Kan, A. H. G. (1979). Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics, 5, 287–326.
Hardy, G. H., Littlewood, J. E., & Polya, G. (1967). Inequalities. Cambridge University Press.
Jiang, C., Zou, D., Bai, D., & Wang, J.-B. (2020). Proportional flowshop scheduling with position-dependent weights. Engineering Optimization, 52(1), 37–52.
Koulamas, C. (2020). The proportionate flow shop total tardiness problem. European Journal of Operational, 284, 439–444.
Lv, D.-Y., & Wang, J.-B. (2020). Study on proportionate flowshop scheduling with due-date assignment and position-dependent weights. Optimization Letters. https://doi.org/10.1007/s11590-020-01670-4.
Mor, B., & Mosheiov, G. (2014). Polynomial time solutions for scheduling problems on a proportionate flow shop with two competing agents. Journal of the Operational Research Society, 65, 151–157.
Mosheiov, G., Sarig, A., Strusevich, V. A., & Mosheiff, J. (2018). Two-machine flow shop and open shop scheduling problems with a single maintenance window. European Journal of Operational Research, 271, 388–400.
Neufeld, J. S., Gupta, J. N. D., & Buscher, U. (2016). A comprehensive review of flowshop group scheduling literature. Computers & Operations Research, 70, 56–74.
Panwalkar, S. S., & Koulamas, C. (2015). On equivalence between the proportionate flow shop and single-machine scheduling problems. Naval Research Logistics, 62(7), 595–603.
Panwalkar, S. S., Smith, M. L., & Koulamas, C. (2013). Review of the ordered and proportionate flow shop scheduling research. Naval Research Logistics, 60, 46–55.
Rossit, D. A., Tohmé, F., & Frutos, M. (2018). The non-permutation flow-shop scheduling problem: A literature review. Omega, 77, 143–153.
Sun, X., Geng, X.-N., & Liu, T. (2020). Due-window assignment scheduling in the proportionate flow shop setting. Annals of Operations Research, 292(1), 113–131.
Wang, J.-B., Cui, B., Ji, P., & Liu, W.-W. (2021a). Research on scheduling with position-dependent weights and past-sequence-dependent delivery times. Journal of Combinatorial Optimization, 41, 290–303.
Wang, J.-B., Hu, Y., & Zhang, B. (2021b). Common due-window assignment for single-machine scheduling with generalized earliness/tardiness penalties and a rate-modifying activity. Engineering Optimization, 53(3), 496–512.
Wang, J.-B., Liu, F., & Wang, J.-J. (2019). Research on m-machine flow shop scheduling with truncated learning effects. International Transactions in Operational Research, 26(3), 1135–1151.
Wang, J.-B., & Wang, M.-Z. (2011). Worst-case behavior of simple sequencing rules in flow shop scheduling with general position-dependent learning effects. Annals of Operations Research, 191, 155–169.
Wang, J.-B., & Wang, M.-Z. (2013). Minimizing makespan in three-machine flow shops with deteriorating jobs. Computers & Operations Research, 40(2), 547–557.
Wang, J.-B., Xu, J., & Yang, J. (2018). Bi-criterion optimization for flow shop with a learning effect subject to release dates. Complexity, 2018, 12.
Wang, J.-B., Zhang, B., Li, L., Bai, D., & Feng, Y.-B. (2020). Due window assignment scheduling problems with position-dependent weights on a single machine. Engineering Optimization, 52(2), 185–193.
Acknowledgements
This research was supported by the Fundamental Research Funds for the Central Universities (Grant No. N2105020) and the National Natural Science Foundation of China (Grant No. 12171074).
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., Han, H. Improved algorithms for proportionate flow shop scheduling with due-window assignment. Ann Oper Res 309, 249–258 (2022). https://doi.org/10.1007/s10479-021-04414-4
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10479-021-04414-4