Open Access
| Issue |
RAIRO-Oper. Res.
Volume 59, Number 4, July-August 2025
|
|
|---|---|---|
| Page(s) | 2219 - 2240 | |
| DOI | https://doi.org/10.1051/ro/2025092 | |
| Published online | 05 September 2025 | |
- A. Agnetis, P.B. Mirchandani, D. Pacciarelli and A. Pacifici, Scheduling problems with two competing agents. Oper. Res. 52 (2004) 229–242. [CrossRef] [MathSciNet] [Google Scholar]
- A. Agnetis, J.-C. Billaut, S. Gawiejnowicz, D. Pacciarelli and A. Soukhal, Multiagent Scheduling: Models and Algorithms. Springer, Berlin Heidelberg (2014). [Google Scholar]
- A.V. Aho and J.E. Hopcroft, The Design and Analysis of Computer Algorithms. Pearson Education, India (1974). [Google Scholar]
- K.R. Baker and J. Cole Smith, A multiple-criterion model for machine scheduling. J. Sched. 6 (2003) 7–16. [CrossRef] [MathSciNet] [Google Scholar]
- P. Brucker, Scheduling Algorithms, 5th edition. Springer, Berlin Heidelberg (2007). [Google Scholar]
- P. Brucker and S. Knust, Complexity Results for Scheduling Problems (2009). [Google Scholar]
- P. Brucker, A. Gladky, H. Hoogeveen, M.Y. Kovalyov, C.N. Potts, T. Tautenhahn and S.L. Van De Velde, Scheduling a batching machine. J. Sched. 1 (1998) 31–54. [CrossRef] [MathSciNet] [Google Scholar]
- P.O. Dusadeerungsikul, X. He, M. Sreeram and S.Y. Nof, Multi-agent system optimisation in factories of the future: cyber collaborative warehouse study. Int. J. Prod. Res. 60 (2022) 6072–6086. [Google Scholar]
- Q. Feng, J. Yuan, H. Liu and C. He, A note on two-agent scheduling on an unbounded parallel-batching machine with makespan and maximum lateness objectives. Appl. Math. Model. 37 (2013) 7071–7076. [CrossRef] [MathSciNet] [Google Scholar]
- Q. Feng, W.-P. Shang, C.-W. Jiao and W.-J. Li, Two-agent scheduling on a bounded parallel-batching machine with makespan and maximum lateness objectives. J. Oper. Res. Soc. China 8 (2020) 189–196. [CrossRef] [MathSciNet] [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. [Google Scholar]
- Y. Gao, J. Yuan, C.T. Ng and T.C.E. Cheng, A further study on two-agent parallel-batch scheduling with release dates and deteriorating jobs to minimize the makespan. Eur. J. Oper. Res. 273 (2019) 74–81. [CrossRef] [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 Annals of Discrete Mathematics. Vol. 5. Elsevier, B.C. Canada (1979) 287–326. [Google Scholar]
- C. He and X. Han, Two-agent scheduling on an unbounded parallel-batching machine to minimize maximum cost and makespan. Oper. Res. Trans. China 22 (2018) 109–116. [Google Scholar]
- C. He, Y. Lin and J. Yuan, Bicriteria scheduling on a batching machine to minimize maximum lateness and makespan. Theor. Comput. Sci. 381 (2007) 234–240. [CrossRef] [Google Scholar]
- C. He, J. Wu and H. Lin, Two-agent bounded parallel-batching scheduling for minimizing maximum cost and makespan. Discrete Optim. 45 (2022) 100698. [CrossRef] [Google Scholar]
- N. He, D.Z. Zhang and B. Yuce, Integrated multi-project planning and scheduling-a multiagent approach. Eur. J. Oper. Res. 302 (2022) 688–699. [Google Scholar]
- H. Hoogeveen, Multicriteria scheduling. Eur. J. Oper. Res. 167 (2005) 592–623. [CrossRef] [Google Scholar]
- A. Kacem and A. Dammak, Multi-objective scheduling on two dedicated processors. Top 29 (2021) 694–721. [CrossRef] [MathSciNet] [Google Scholar]
- E.L. Lawler, Optimal sequencing of a single machine subject to precedence constraints. Manag. Sci. 19 (1973) 544–546. [Google Scholar]
- C.-Y. Lee, R. Uzsoy and L.A. Martin-Vega, Efficient algorithms for scheduling semiconductor burn-in operations. Oper. Res. 40 (1992) 764–775. [Google Scholar]
- S. Li and J. Yuan, Unbounded parallel-batching scheduling with two competitive agents. J. Sched. 15 (2012) 629–640. [Google Scholar]
- S. Li and Z. Geng, Bicriteria scheduling on an unbounded parallel-batch machine for minimizing makespan and maximum cost. Inf. Process. Lett. 180 (2023) 106343. [Google Scholar]
- P. Perez-Gonzalez and J.M. Framinan, A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems. Eur. J. Oper. Res. 235 (2014) 1–16. [CrossRef] [Google Scholar]
- M.T.Y. Sabouni and F. Jolai, Optimal methods for batch processing problem with makespan and maximum lateness objectives. Appl. Math. Model. 34 (2010) 314–324. [Google Scholar]
- L. Shi, G. Guo and X. Song, Multi-agent based dynamic scheduling optimisation of the sustainable hybrid flow shop in a ubiquitous environment. Int. J. Prod. Res. 59 (2021) 576–597. [Google Scholar]
- V. T’kindt and J.-C. Billaut, Multicriteria Scheduling: Theory, Models and Algorithms. Springer, Berlin Heidelberg (2006). [Google Scholar]
- X. Wang, L. Zhang, Y. Liu, F. Li, Z. Chen, C. Zhao and T. Bai, Dynamic scheduling of tasks in cloud manufacturing with multi-agent reinforcement learning. J. Manuf. Syst. 65 (2022) 130–145. [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.