Minimizing the makespan in the non-preemptive job-shop scheduling with limited machine availability

Computers and Industrial Engineering

Volumn 59, Issue 4, 2010, Pages 537-543

  Mati, Yazid ^a  

^a QASSIM UNIVERSITY   (Saudi Arabia)

Author keywords

Availability constraints; Disjunctive graph; Job shop scheduling; Makespan; Taboo thresholding

Indexed keywords

AVAILABILITY CONSTRAINTS; DISJUNCTIVE GRAPH; JOB-SHOP SCHEDULING; MAKESPAN; THRESHOLDING;

OPTIMIZATION; SCHEDULING;

SCHEDULING ALGORITHMS;

EID: 78049360678     PISSN: 03608352     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cie.2010.06.010     Document Type: Article

References (25)

1. Aggoune, R. (2002). Ordonnancement d'ateliers sous contraintes de disponibilité des machines. PhD thesis, Université de Metz, France.
2. R. Aggoune Minimizing the makespan for the flow shop scheduling problem with availability constraints European Journal of Operational Research 153 2004 534 543
3. R. Aggoune, and M. Portmann Flow shop scheduling problem with limited machine availability: A heuristic approach International Journal of Production Economics 99 2006 4 15
4. A. Allaoui, and A. Artiba Integrating simulation and optimization to schedule a hybrid flow shop with maintenance constraints Computers and Industrial Engineering 47 2004 431 450
5. A. Allaoui, and A. Artiba Scheduling two-stage hybrid flow shop with availability constraints Computers and Operations Research 33 2006 1399 1419
6. A. Allaoui, A. Artiba, S. Elmaghraby, and R. Riane Scheduling of a two-machine flowshop with availability constraints on the first machine International Journal of Production Economics 99 2006 16 27
7. Azem, S., Aggoune, R., Dauzre-Pérs, S., 2007. A mathematical model for job shop scheduling with resource availability constraints. In Proceedings of the 2nd international conference on industrial engineering and systems management, Beijing, China.
8. J. Breit An improved approximation algorithm for two-machine flow shop scheduling with an availability constraint Information Processing Letters 90 2004 273 278
9. T. Cheng, and Z. Liu Approximability of two-machine no-wait flowshop scheduling with availability constraints Operations Research Letters 31 2003 319 322
10. M. Espinouse, P. Formanowlcz, and B. Penz Complexity results and approximation algorithms for the two-machine no-wait flow-shop with limited machine availability Journal of the Operational Research Society 52 2001 116 121
11. J. Gao, M. Gen, and L. Sun Scheduling jobs and maintenances in flexible job shop with a hybrid genetic algorithm Journal of Intelligent Manufacturing 17 2006 493 507 (Pubitemid 44273772)
12. F. Glover Tabu thresholding: Improved search by nonmonotonic trajectories ORSA Journal on Computing 7 4 1995 426 442
13. F. Glover, and M. Laguna Tabu search 1997 Kluwer Academic Publishers Norwell, MA
14. J. Grabowski, E. Nowicki, and S. Zdrzalka A block approach for single machine scheduling with release dates and due dates European Journal of Operational Research 26 2 1986 278 285
15. Lawrence, S. (1984). Supplement to resource constrained project scheduling: An experimental investigation of heuristic scheduling techniques. Technical report, GSIA, Carnegie-Mellon University, Pittsburgh.
16. C. Lee Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint Operations Research Letters 20 1997 129 139
17. C. Lee Two-machine flowshop scheduling with availability constraints European Journal of Operational Research 114 1999 420 429
18. Y. Ma, C. Chu, and C. Zuo A survey of scheduling with deterministic machine availability constraints Computers and Industrial Engineering 52 2 2010 199 211
19. P. Mauguire, J. Billaut, and J. Bouquard New single machine and job-shop scheduling problems with availability constraints Journal of Scheduling 8 2005 211 231
20. E. Nowicki, and C. Smutnicki A fast taboo search algorithm for the job shop problem Management Science 42 6 1996 797 813 (Pubitemid 126577322)
21. Roy, M., Sussmann, M. (1969). Les problmes d'ordonnancement avec contraintes disjonctives. SEMA notes DS, Paris.
22. Ten Eikelder, H., Aarts, B., Verhoeven, M., Aarts, E. (1997). Sequential and parallel local search algorithms for job shop scheduling. In Proceedings of the 2nd international conference on meta-heuristics, Sophia-Antipolis, France (pp. 75-80).
23. P. Van Laarhoven, E. Aarts, and J. Lenstra Job shop scheduling by simulated annealing Operations Research 40 1 1992 113 125
24. J. Xie, and X. Wang Complexity and algorithms for two-stage flexible flowshop scheduling with availability constraints Computers and Mathematics with Applications 50 2005 1629 1638
25. N. Zribi, A. El Kamel, and P. Borne Minimizing the makespan for the MPM job-shop with availability constraints International Journal of Production Economics 112 1 2008 151 160