Lot scheduling on a single machine to minimize total weighted completion time

Open Access

Issue		RAIRO-Oper. Res. Volume 59, Number 5, September-October 2025


Page(s)		3153 - 3167
DOI		https://doi.org/10.1051/ro/2025049
Published online		24 October 2025

A. Allahverdi, A survey of scheduling problems with no-wait in process. Eur. J. Oper. Res. 255 (2016) 665–686. [Google Scholar]
M. Allahverdi, Minimizing total tardiness in a two-machine flowshop with uncertain and bounded processing times. RAIRO-Oper. Res. 57 (2023) 1353–1375. [Google Scholar]
Y. Chen, Y.X. Cheng and G.Q. Zhang, Single machine lot scheduling with non-uniform lot capacities and processing times. J. Comb. Optim. 43 (2022) 1359–1367. [Google Scholar]
M. Geurtsen, J.B. Didden, J. Adan, Z. Atan and I.J.B.F. Adan, Production, maintenance and resource scheduling: a review. Eur. J. Oper. Res. 305 (2023) 501–529. [Google Scholar]
R.L. Graham, E.L. Lawler, J.K. Lenstra and A.R. Kan, Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann. Discrete. Math. 5 (1979) 287–326. [Google Scholar]
Y.-T. Hou, D.-L. Yang and W.-H. Kuo, Lot scheduling on a single machine. Inf. Process. Lett. 114 (2014) 718–722. [Google Scholar]
A.R. Karlin, M.S. Manasse, L. Rudolph and D.D. Sleato, Competitive snoopy caching. Algorithmica 3 (1988) 79–119. [Google Scholar]
H. Kellerer, U. Pferschy, D. Pisinger, H. Kellerer, U. Pferschy and D. Pisinger, Introduction to NP-Completeness of Knapsack problems, in Knapsack Problems. Springer Berlin Heidelberg, Berlin, Heidelberg (2004) 483–493. [Google Scholar]
M.Y. Kovalyov, A batching machine model for lot scheduling on a single machine. Found. Comput. Decis. 43 (2018) 37–40. [Google Scholar]
M. Li and G.G. Wang, A review of green shop scheduling problem. Inf. Sci. 589 (2022) 478–496. [Google Scholar]
M. Liu, T. Lin, F. Chu, F.F. Zheng and C.B. Chu, A new and general stochastic parallel machine ScheLoc problem with limited location capacity and customer credit risk. RAIRO-Oper. Res. 57 (2023) 1179–1193. [CrossRef] [EDP Sciences] [MathSciNet] [Google Scholar]
M. Liu, Z. Liu, F. Zheng and C. Chu, Mathematical models and optimal algorithms for Lot scheduling considering job splitting and due dates in green logistics. Asia-Pac. J. Oper. Res. 41 (2024) 2350040. [Google Scholar]
B. Mor, Single-machine lot scheduling with variable lot processing times. Optim. Lett. 53 (2021) 321–334. [Google Scholar]
B. Mor and G. Mosheiov, A note on the single machine CON and CONW problems with lot scheduling. Comb. Optim. 42 (2021) 327–338. [Google Scholar]
B. Mor, G. Mosheiov and D. Shapira, Lot scheduling on a single machine to minimize the (weighted) number of tardy orders. Inf. Process. Lett. 164 (2020) 106009. [Google Scholar]
B. Mor, G. Mosheiov and D. Shapira, Single machine lot scheduling with optional job-rejection. J. Comb. Optim. 41 (2021) 1–11. [Google Scholar]
G. Mosheiov and A. Sarig, A note on lot scheduling on a single machine to minimize maximum weighted tardiness. J. Comb. Optim. 45 (2023) 128. [Google Scholar]
B. Nurit, B. Mor, Y. Schlissel and D. Shapira, Lot scheduling involving completion time problems on identical parallel machines. Oper. Res-Ger. 23 (2023) 12. [Google Scholar]
H.J. Shen and Z.C. Geng, A Note on single-machine lot scheduling with splittable jobs to minimize the number of tardy jobs. Chin. Q. J. Math. 37 (2022) 412. [Google Scholar]
D.-L. Yang, Y.-T. Hou and W.-H. Kuo, A note on a single-machine lot scheduling problem with indivisible orders. Comput. Oper. Res. 79 (2017) 34–38. [Google Scholar]
E. Zhang, M. Liu, F.F. Zheng and Y.F. Xu, Single machine lot scheduling to minimize the total weighted (discounted) completion time. Inf. Process. Lett. 142 (2019) 46–51. [Google Scholar]
F.F. Zheng and K.Y. Jin, An improved heuristic for single machine lot scheduling problem. IFAC-PapersOnLine. 52 (2019) 217–222. [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.