Open Access
| Issue |
RAIRO-Oper. Res.
Volume 60, Number 2, March-April 2026
|
|
|---|---|---|
| Page(s) | 831 - 844 | |
| DOI | https://doi.org/10.1051/ro/2026027 | |
| Published online | 10 April 2026 | |
- A.V. Aho, J.E. Hopcroft and J.D. Ullman, The Design and Analysis of Computer Algorithms. Addison-Wesley, Boston (1974). [Google Scholar]
- P. Brucker, Scheduling Algorithms, 5th edition. Springer, Berlin (2007). [Google Scholar]
- Y. Chen, Y. Cheng and G. Zhang, Single machine lot scheduling with non-uniform lot capacities and processing times. J. Comb. Optim. 43 (2022) 1359–1367. [Google Scholar]
- E. Coffman, M.R. Garey and D.B. Johnson, Approximation algorithms for bin packing: a survey. Approximation Algorithms for NP-Hard Problems. PWS, Boston (1996). [Google Scholar]
- E.G. Coffman Jr, M.R. Garey and D.S. Johnson, Bin packing with divisible item sizes. J. Complex. 3 (1987) 406–428. [Google Scholar]
- G. Dosa, Z. Tan, Z. Tuza, Y. Yan and C. Sik Lányi, Improved bounds for batch scheduling with nonidentical job sizes. Nav. Res. Logist. 61 (2014) 351–358. [Google Scholar]
- J.W. Fowler and L. Mönch, A survey of scheduling with parallel batch (p-batch) processing. Eur. J. Oper. Res. 298 (2022) 1–24. [CrossRef] [Google Scholar]
- M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman & Co. (1979). [Google Scholar]
- Z. Geng and J. Liu, Single machine batch scheduling with two non-disjoint agents and splitable jobs. J. Comb. Optim. 40 (2020) 774–795. [Google Scholar]
- R.L. Graham, E.L. Lawler, J.K. Lenstra and A.H.G. Rinnooy Kan, Optimization and approximation in deterministic sequencing and scheduling: a survey, in Vol. 5 of Annals of Discrete Mathematics. Elsevier, B.C. Canada (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]
- D.S. Johnson, Near-optimal bin packing algorithms. Ph.D. thesis, Massachusetts Institute of Technology (1973). [Google Scholar]
- K. Lee, J.Y.-T. Leung and M.L. Pinedo, Scheduling jobs with equal processing times subject to machine eligibility constraints. J. Sched. 14 (2011) 27–38. [Google Scholar]
- C.-L. Li and Q. Li, Scheduling jobs with release dates, equal processing times, and inclusive processing set restrictions. J. Oper. Res. Soc. 66 (2015) 516–523. [Google Scholar]
- B. Mor, Single-machine lot scheduling with variable lot processing times. Eng. Optim. 53 (2021) 321–334. [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. Nurit, M. Baruch, S. Yitzhak and S. Dana, Lot scheduling involving completion time problems on identical parallel machines. Oper. Res. 23 (2023) 12. [Google Scholar]
- O. Ozturk, M.-L. Espinouse, M.D. Mascolo and A. Gouin, Makespan minimisation on parallel batch processing machines with non-identical job sizes and release dates. Int. J. Prod. Res. 50 (2012) 6022–6035. [Google Scholar]
- J.-Q. Wang and J.Y.-T. Leung, Scheduling jobs with equal-processing-time on parallel machines with non-identical capacities to minimize makespan. Int. J. Prod. Econ. 156 (2014) 325–331. [Google Scholar]
- X. Xin, M.I. Khan and S. Li, Scheduling equal-length jobs with arbitrary sizes on uniform parallel batch machines. Open Math. 21 (2023) 20220562. [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. Zheng and Y. Xu, Single machine lot scheduling to minimize the total weighted (discounted) completion time. Inf. Process. Lett. 142 (2019) 46–51. [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.