Journal of the Operations Research Society of China >

2025 , Vol. 13 >Issue 2: 452 - 462

DOI: https://doi.org/10.1007/s40305-023-00487-z

A Note on "Flowshop Scheduling with Learning Effectand Job Rejection"

Expand
  • School of Mathematics, East China University of Science and Technology, Shanghai 200237, China

Received date: 2022-05-02

  Revised date: 2023-04-16

  Online published: 2025-07-07

Supported by

This work was supported by the National Nature Science Foundation of China (No. 11871213).

Fold

Abstract

In this note, we point out that the dynamic programming algorithms for the proportionate flowshop scheduling problems presented by Mor et al. (J Sched 23:61–641, 2020) are incorrect by counterexamples. Moreover, we propose new dynamic programming algorithms to solve the corresponding problems.

Key words： Scheduling; Proportionate flowshop; Learning effect; Job rejection; Dynamic programming

Cite this article

Jin Yu, Pei-Hai Liu, Xi-Wen Lu . A Note on "Flowshop Scheduling with Learning Effectand Job Rejection"[J]. Journal of the Operations Research Society of China, 2025 , 13(2) : 452 -462 . DOI: 10.1007/s40305-023-00487-z

References

[1] Mor, B., Mosheiov, G., Shapira, D.: Flowshop scheduling with learning effect and job rejection. J. Sched. 23, 631-641 (2020)
[2] Zhang, L., Lu, L.: Single-machine scheduling under the job rejection constraint. Yuan. J. Theoret. Comput. Sci. 411, 1877-1882 (2010)
[3] Pinedo, M.L.: Scheduling: Theory, Algorithm and Systems. Springer, New York (2016)
Options
Outlines

/

〈 〉

Copyright © Operations Research Society of China, The Periodicals Agency of Shanghai University , and Springer-Verlag Berlin Heidelberg 2016