Abstract
We study extensions of the classical single machine common due-date (CON) and common due-window (CONW) assignment problems to the setting of lot scheduling. In the CON problem, all the jobs share a common due-date, and jobs completed prior to or after the due-date are penalized according to their earliness/tardiness. In CONW, there exists a time interval, such that jobs completed within this interval are not penalized. In both cases the due-date/due-window are decision variables. In lot scheduling, a number of customer orders of different sizes may be processed in the same lot. We allow order splitting between consecutive lots. The objective is to find the order allocation to lots, such that the total cost of earliness, tardiness and due-date/due-window is minimized. Given \(n\) orders, and under the very realistic assumption that the lot capacity is of the order of \(n\), we introduce polynomial time dynamic programming algorithms for both extensions. Our numerical tests indicate that both algorithms can easily solve medium-size problems.
Similar content being viewed by others
References
Bulbul K, Kedad Sidhoum S, Sen H (2019) Single machine common due date total earliness/tardiness scheduling with machine availability. J Sched 22:543–565
Gordon V, Proth J-P, Chu C (2002) A survey of the state-of-the-art of common due date assignment and scheduling research. Eur J Oper Res 139:1–25
Hou Y-T, Yang D-L, Kuo W-H (2014) Lot scheduling on a single machine. Inf Process Lett 114:718–722
Janiak A, Janiak WA, Krysiak T, Kwiatkowski T (2015) A survey on scheduling problems with due windows. Eur J Oper Res 242:347–357
Koulamas C (2017) Common due date assignment with generalized earliness/tardiness penalties. Comput Ind Eng 109:79–83
Liman SD, Panwalkar SS, Thongmee S (1996) Determination of common due window location in a single machine scheduling problem. Eur J Oper Res 93:68–74
Liman SD, Panwalkar SS, Thongmee S (1998) Common due window size and location determination in a single machine scheduling problem. J Oper Res Soc 49:1007–1010
Mor B (2017) Minmax common due-window assignment and scheduling on a single machine with two competing agents. J Oper Res Soc 69:589–602
Mor B (2019) Minmax scheduling problems with common due-date and completion time penalty. J Comb Optim 38:50–71
Mor B, Mosheiov G (2017) A two-agent single machine scheduling problem with due-window assignment and a common flow-allowance. J Comb Optim 33:1454–1468
Mor B (2021) Single-machine lot scheduling with variable lot processing times. Eng Optim 53(2):321–334
Mor B, Mosheiov G, Shapira D (2020) Lot scheduling on a single machine to minimize the (weighted) number of tardy orders. Inf Process Lett 164:106009
Mor B, Mosheiov G, Shapira D (2021) Single machine lot scheduling with optional job-rejection. J Comb Optim 41(1):1–11
Panwalkar SS, Smith ML, Seidmann A (1982) Common due date assignment to minimize total penalty for the one machine scheduling problem. Oper Res 30:391–399
Shi H-B, Wang J-B (2019) Research on common due window assignment flowshop scheduling with learning effect and resource allocation. Eng Optim. https://doi.org/10.1080/0305215X.2019.1604698
Xiong X, Wang D, Cheng TCE, Wu C-C, Yin Y (2018) Single-machine scheduling and common due date assignment with potential machine disruption. Int J Prod Res 56:1345–1360
Zhang E, Liu M, Zheng F, Xu Y (2019a) Single machine lot scheduling to minimize the total weighted (discounted) completion time. Inf Process Lett 142:46–51
Zhang L, Zhang Y, Bai Q (2019b) Two-stage medical supply chain scheduling with an assignable common due-window and shelf life. J Comb Optim 37:319–329
Acknowledgements
The second author was supported by the Israel Science Foundation (grant No.2505/19), by the Recanati Fund of The School of Business Administration, and by Charles I. Rosen Chair of Management, The Hebrew University of Jerusalem, Israel.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Mor, B., Mosheiov, G. A note on the single machine CON and CONW problems with lot scheduling. J Comb Optim 42, 327–338 (2021). https://doi.org/10.1007/s10878-021-00709-1
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-021-00709-1