Journal of Industrial and Management Optimization (JIMO)

An efficient Tabu Search neighborhood based on reconstruction strategy to solve the blocking job shop scheduling problem
Pages: 2015 - 2031, Issue 4, October 2017

doi:10.3934/jimo.2017029      Abstract        References        Full text (484.7K)           Related Articles

Adel Dabah - CERIST Research Center 3 rue des freres Aissou, 16030 Ben-Aknoun, Algiers, Algeria (email)
Ahcene Bendjoudi - CERIST Research Center 3 rue des freres Aissou, 16030 Ben-Aknoun, Algiers, Algeria (email)
Abdelhakim AitZai - University of Sciences and Technology Houari Boumedienne (USTHB), Bab Ezzouar 16111, Algiers, Algeria (email)

1 J. Adams, E. Balas and D. Zawack, The shifting bottleneck procedure for job shop scheduling, Management Science, 34 (1988), 391-401.       
2 A. AitZai, B. Benmedjdoub and M. Boudhar, A branch and bound and parallel genetic algorithm for the job shop scheduling problem with blocking, International Journal of Operational Research, 14 (2012), 343-365.       
3 D. Applegate and W. Cook, A computational study of the job-shop scheduling problem, ORSA Journal on Computing, 3 (1991), 149-156.
4 A. Dabah, A. Bendjoudi and A. AitZai, Efficient Multi Start Parallel Tabu Search for the Blocking Job Shop Scheduling Problem, forthcoming.
5 F. Glover, Future paths for integer programming and links to artificial intelligence, Computers & Operations Research, 13 (1986), 533-549.       
6 F. Glover, Tabu search-part I, ORSA Journal on Computing, 1 (1989), 190-206.
7 F. Glover, Tabu search-part II, ORSA Journal on Computing, 2 (1990), 4-32.
8 H. Groflin and A. Klinkert, A new neighborhood and tabu search for the blocking job shop, Discrete Applied Mathematics, 157 (2009), 3643-3655.       
9 H. Gröflin, D. N. Pham and R. Bürgy, The flexible blocking job shop with transfer and set-up times, Journal of Combinatorial Optimization, 22 (2011), 121-144.       
10 N. G. Hall and C. Sriskandarajah, A survey of machine scheduling problems with blocking and no-wait in process, Operations Research, 44 (1996), 510-525.       
11 V. Laarhoven, J. M. Peter, E. H. L. Aarts and J. K. Lenstra, Job shop scheduling by simulated annealing, Operations Research, 40 (1992), 113-125.       
12 S. Lawrence, Resource constrained project scheduling: An experimental investigation of heuristic scheduling techniques (supplement), Graduate School of Industrial Administration, 1984.
13 A. Mascis and D. Pacciarelli, Job-shop scheduling with blocking and no-wait constraints, European Journal of Operational Research, 143 (2002), 498-517.       
14 Y. Mati, N. Rezg and X. Xie, A taboo search approach for deadlock-free scheduling of automated manufacturing systems, Journal of Intelligent Manufacturing, 12 (2001), 535-552.
15 Y. Mati and X. Xie, Multiresource shop scheduling with resource flexibility and blocking, Automation Science and Engineering, IEEE Transactions on, 8 (2011), 175-189.
16 C. Meloni, D. Pacciarelli and M. Pranzo, A rollout metaheuristic for job shop scheduling problems, Annals of Operations Research, 131 (2004), 215-235.       
17 J. F. Muth and G. L. Thompson, eds. Industrial Scheduling, Prentice-Hall, 1963.
18 A. Oddi, R. Rasconi, A. Cesta and S. F. Smith, Iterative Improvement Algorithms for the Blocking Job Shop, In ICAPS. 2012.
19 D.-N. Pham and A. Klinkert, Surgical case scheduling as a generalized job shop scheduling problem, European Journal of Operational Research, 185 (2008), 1011-1025.       
20 M. Pranzo and D. Pacciarelli, An iterated greedy metaheuristic for the blocking job shop scheduling problem, Journal of Heuristics, (2013), 1-25.
21 B. Roy and B. Sussmann, Les problemes d'ordonnancement avec contraintes disjonctives, Note ds, 9 (1964).

Go to top