Abstract
In a recent paper, Jiang et al. (Eng Optim 52(1):37–52, 2020) considered proportionate flowshop scheduling with position-dependent weights. For common and slack due-date assignment problems, they proved that both of these two problems can be solved in \(O(n^{2} \log n)\) time, where \(n\) is the number of jobs. The contribution of this paper is that we show that these two problems can be optimally solved by a lower-order algorithm, i.e., in \(O(n\log n)\) time.
This is a preview of subscription content, log in via an institution to check access.
References
Jiang, C., Zou, D., Bai, D., Wang, J.-B.: Proportionate flowshop scheduling with position dependent weights. Eng. Optim. 52(1), 37–52 (2020)
Panwalkar, S.S., Koulamas, C.: On equivalence between the proportionate flow shop and single machine scheduling problems. Naval Res. Logist. 62, 595–603 (2015)
Estévez-Fernández, A., Mosquera, M.A., Borm, P., Hamers, H.: Proportionate flow shop games. J. Sched. 11(6), 433–447 (2008)
Graham, R.L., Lawler, E.L., Lenstra, J.K., RinnooyKan, A.H.G.: Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann Discrete Math 5, 287–326 (1979)
Panwalkar, S.S., Smith, M.L., Koulamas, C.: Review of the ordered and proportionate flow shop scheduling research. Naval Res Logist 60, 46–55 (2013)
Pinedo, M.: Scheduling: theory, algorithms, and systems. Prentice Hall, New Jersey (2002)
Lu, Y.-Y., Li, G., Wu, Y.-B., Ji, P.: Optimal due-date assignment problem with learning effect and resource-dependent processing times. OptimLett 8, 113–127 (2014)
Yin, Y., Wang, Y.D.J., Wu, C.-C., Cheng, T.C.E.: CON/SLK due date assignment and scheduling on a single machine with two agents. Naval Res Logist 63, 416–429 (2016)
Yin, Y., Wang, Y.W.Y., Wang, D.J., Cheng, T.C.E.: Multi-agent single-machine scheduling and unrestricted due date assignment with a fixed machine unavailability interval. Comput. Ind. Eng. 111, 202–215 (2017)
Liu, W., Hu, X., Wang, X.: Single machine scheduling with slack due dates assignment. EngOptim 49(4), 709–717 (2017)
Wang, J.-B., Geng, X.-N., Liu, L., Wang, J.-J., Lu, Y.-Y.: Single machine CON/SLK due date assignment scheduling with controllable processing time and job-dependent learning effects. Comput. J 61(9), 1329–1337 (2018)
Yin, Y., Yang, Y., Wang, D.-J., Cheng, T.C.E.: Integrated production, inventory, and batch delivery scheduling with due date assignment and two competing agents. Naval Res. Logist. 65, 393–409 (2018)
Xiong, X., Wang, D.-J., Cheng, T.C.E., Wu, C.-C.: Single-machine scheduling and common due date assignment with potential machine disruption. Int. J. Prod. Res. 56, 1345–1360 (2018)
Geng, X.-N., Wang, J.-B., Bai, D.: Common due date assignment scheduling for a no-wait flowshop with convex resource allocation and learning effect. Eng. Optim. 51(8), 1301–1323 (2019)
Liu, W.-W., Jiang, C.: Due date assignment scheduling involving job-dependent learning effects and convex resource allocation. Eng. Optim. 52(1), 74–89 (2020)
Brucker, P.: Scheduling algorithms 3. Springer, Berlin (2001)
Hardy, G.H., Littlewood, J.E., Polya, G.: Inequalities. Cambridge University Press, Cambridge (1967)
Acknowledgments
This work was supported by the Natural Science Foundation of Liaoning Province, China (2020-MS-233).
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
Lv, DY., Wang, JB. Study on proportionate flowshop scheduling with due-date assignment and position-dependent weights. Optim Lett 15, 2311–2319 (2021). https://doi.org/10.1007/s11590-020-01670-4
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11590-020-01670-4