A Note on

doi:10.1007/s40305-023-00487-z

Journal of the Operations Research Society of China ›› 2025, Vol. 13 ›› Issue (2): 452-462.doi: 10.1007/s40305-023-00487-z

Previous Articles Next Articles

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

Jin Yu, Pei-Hai Liu, Xi-Wen Lu

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

Received:2022-05-02 Revised:2023-04-16 Online:2025-06-30 Published:2025-07-07
Contact: Pei-Hai Liu E-mail:pliu@ecust.edu.cn
Supported by:
This work was supported by the National Nature Science Foundation of China (No. 11871213).

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

CLC Number:

90B06
68M20

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.

TrendMD

share this article

0
/ / Recommend

Add to citation manager EndNote|Reference Manager|ProCite|BibTeX|RefWorks

URL: https://www.jorsc.shu.edu.cn/EN/10.1007/s40305-023-00487-z

https://www.jorsc.shu.edu.cn/EN/Y2025/V13/I2/452

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)

Related Articles 15

[1]	Cheng-Jun Hou. Double-Factored Decision Theory for Markov Decision Processes with Multiple Scenarios of the Parameters [J]. Journal of the Operations Research Society of China, 2025, 13(2): 484-514.
[2]	Ru-Yan He, Jin-Jiang Yuan, Yuan Zhang. The Single-Machine Preemptive or Resumable Scheduling with Maintenance Intervals [J]. Journal of the Operations Research Society of China, 2025, 13(2): 590-602.
[3]	Li-Yun Miao, Ji Tian, Ru-Yan Fu. A Best Possible Online Algorithm For Parallel-Batch Scheduling with Kind Release Times and Job Compatibilities [J]. Journal of the Operations Research Society of China, 2025, 13(2): 603-615.
[4]	Fan-Yu Kong, Cui-Xia Miao, Yu-Jia Huo, Jia-Xin Song, Yu-Zhong Zhang. Single-Machine Scheduling with Step-Deteriorating Jobs and Rejection [J]. Journal of the Operations Research Society of China, 2024, 12(4): 1088-1102.
[5]	Dan-Yang Lv, Jing Xue, Ji-Bo Wang. Minmax Common Due-Window Assignment Scheduling with Deteriorating Jobs [J]. Journal of the Operations Research Society of China, 2024, 12(3): 681-693.
[6]	Wei-Dong Li. Improved Approximation Schemes for Early Work Scheduling on Identical Parallel Machines with a Common Due Date [J]. Journal of the Operations Research Society of China, 2024, 12(2): 341-350.
[7]	Hong-Ye Zheng, Suo-Gang Gao, Wen Liu, Bo Hou. An Approximation Algorithm for the Parallel-Machine Customer Order Scheduling with Delivery Time and Submodular Rejection Penalties [J]. Journal of the Operations Research Society of China, 2024, 12(2): 495-504.
[8]	Yurii Averboukh. Zero-Sum Continuous-Time Markov Games with One-Side Stopping [J]. Journal of the Operations Research Society of China, 2024, 12(1): 169-187.
[9]	Zhi-Chao Geng, Yuan Zhang. Single-Machine Preemptive Scheduling with Release Dates Involving the Total Weighted Late Work Criterion [J]. Journal of the Operations Research Society of China, 2023, 11(3): 693-706.
[10]	Yan-Ying Zhao, Pei-Wen Yu, Jian-Qiang Hu. Strategic Admission Behavior and Its Implications: Evidence from a Cardiac Surgery Department [J]. Journal of the Operations Research Society of China, 2023, 11(1): 29-50.
[11]	Shuang Cai, Ke Liu. Online Scheduling on Two Parallel Identical Machines Under a Grade of Service Provision [J]. Journal of the Operations Research Society of China, 2022, 10(4): 689-702.
[12]	Mitra Movassaghi, Soroush Avakh Darestani. Multiple Cross-docks Scheduling with Multiple Doors using Fuzzy Approach and Metaheuristic Algorithms [J]. Journal of the Operations Research Society of China, 2022, 10(4): 861-911.
[13]	Hai-Ling Liu, Xi-Wen Lu. Online Scheduling on a Parallel Batch Machine with Delivery Times and Limited Restarts [J]. Journal of the Operations Research Society of China, 2022, 10(1): 113-131.
[14]	Cheng He, Hao Lin, Li Li. Unbounded Serial-Batching Scheduling on Hierarchical Optimization [J]. Journal of the Operations Research Society of China, 2021, 9(4): 909-914.
[15]	Yu-Zhong Zhang, Shu-Guang Li. Scheduling Jobs with Release and Delivery Times Subject to Nested Eligibility Constraints [J]. Journal of the Operations Research Society of China, 2021, 9(1): 63-77.

Metrics

Viewed

Full text

Abstract

Comments

Abstract
References
Related Articles
Recommended Articles
Metrics
Comments

TOP

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

Knowledge

Abstract