Open Access
| Issue |
RAIRO-Oper. Res.
Volume 59, Number 5, September-October 2025
|
|
|---|---|---|
| Page(s) | 2545 - 2558 | |
| DOI | https://doi.org/10.1051/ro/2025109 | |
| Published online | 05 September 2025 | |
- M.L. Pinedo, Scheduling: Theory, Algorithms, and Systems, 4th edition. Springer, New York, USA (2012). [Google Scholar]
- A.S. Jain and S. Meeran, Deterministic job-shop scheduling: past present and future. Eur. J. Oper. Res. 113 (1999) 390–434. [CrossRef] [Google Scholar]
- A. Mascis and D. Pacciarelli, Job-shop scheduling with blocking and no-wait constraints. Eur. J. Oper. Res. 143 (2002) 498–517. [Google Scholar]
- J. Lange and F. Werner, Railway approaches to modeling train scheduling problems as job shops with blocking constraints. J. Sched. 21 (2018) 191–207. [Google Scholar]
- N.G. Hall and C. Sriskandarajah, A survey of machine scheduling problems with blocking and no-wait in process. Oper. Res. 44 (1996) 510–525. [Google Scholar]
- O. Candar, Machine scheduling problems with blocking and no-wait in process. Working Paper, Department of Industrial Engineering, Bilkent University, Ankara, Turkey (1999). [Google Scholar]
- B. Roy and B. Sussman, Les Problè‘mes d’ordonnancement AVEC contraintes disjonctives. Technical report, SEMA, Paris, France (1964). [Google Scholar]
- C.A. Brizuela, Y. Zhao and N. Sannomiya, No-wait and blocking job-shops: challenging problems for GAs, in IEEE International Conference on Systems, Man and Cybernetics. Vol. 5. Tucson (2001) 2349–2354. [Google Scholar]
- C. Meloni, D. Pacciarelli and M. Pranzo, A rollout metaheuristic for job shop scheduling problems. Ann. Oper. Res. 131 (2004) 215–235. [Google Scholar]
- J.J.J. Van den Broek and C.A.J. Hurkens, A new heuristic for job shops with no-wait and blocking constraints. Algorithms for Robust and Online Railway Optimization: Improving the Validity and Reliability of Large Scale Systems. ARRIVAL-TR. Vol. 0112 (2007). [Google Scholar]
- S.Q. Liu and E. Kozan, Scheduling trains with priorities: a no-wait blocking parallel-machine job-shop scheduling model. Transp. Sci. 45 (2010) 175–198. [Google Scholar]
- A. Oddi, R. Rasconi, A. Cesta and S.F. Smith, Iterative improvement algorithms for the blocking job shop, in Proceedings of the 22nd International Conference on Automated Planning and Scheduling (2012) 199–206. [Google Scholar]
- M. Pranzo and D. Pacciarelli, An iterated greedy metaheuristic for the blocking job shop scheduling problem. J. Heuristics 22 (2015) 587–611. [Google Scholar]
- A. Dabah, A. Bendjoudi and A. AitZai, An efficient tabu search neighborhood based on reconstruction strategy to solve the blocking job shop scheduling problem. J. Ind. Manag. Optim. 13 (2016) 2015–2031. [Google Scholar]
- A. Dabah, A. Bendjoudi, A. AitZai and N.N. Taboudjemat, Efficient parallel tabu search for the blocking job shop scheduling problem. Soft Comput. 23 (2019) 13283–13295. [Google Scholar]
- P.S. Dauzère, C. Pavageau and N. Sauer, Modélisation et résolution par PLNE d’un problème réel d’ordonnancement avec contraintes de blocage, in 3ème congrès ROADEF Nantes (2000) 216–217. [Google Scholar]
- S. Martinez, Ordonnancement de systèmes de production avec contraintes de blocage. Thèse, Université de Nantes (2005). [Google Scholar]
- W. Trabelsi, C. Sauvey and N. Sauer, Heuristic methods for problems with blocking constraints solving job shop scheduling, in 8th International Conference of Modeling and Simulation, Evaluation and Optimization of Innovative Production Systems of Goods and Services. Hammamet, Tunisia (2010). [Google Scholar]
- S. Lawrence, Resource Constrained Project Scheduling: An Experimental Investigation of Heuristic Scheduling Techniques. Graduate School of Industrial Administration, Carnegie Mellon University (1984). [Google Scholar]
- J.E. Beasley, OR-library: distributing test problems by electronic mail. J. Oper. Res. Soc. 41 (1990) 1069–1072. [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.