Modelling and solving a practical flexible job-shop scheduling problem with blocking constraints

International Journal of Production Research

Volumn 49, Issue 8, 2011, Pages 2169-2182

  Mati, Yazid ^a   Lahlou, Chams ^b   Dauzère Pérès, Stéphane ^c  

^a QASSIM UNIVERSITY   (Saudi Arabia)

^b ECOLE DES MINES DE NANTES   (France)

^c Center Microelectronics De Provence Georges Charpak   (France)

Author keywords

blocking; design; flexible; genetic algorithm; job shop scheduling

Indexed keywords

BLOCKING; FLEXIBLE; FLEXIBLE JOB-SHOP SCHEDULING PROBLEM; JOB SHOP SCHEDULING PROBLEMS; JOB-SHOP SCHEDULING; MAIN CHARACTERISTICS; NEW PRODUCTION; NUMERICAL EXPERIMENTS;

GENETIC ALGORITHMS;

DESIGN;

EID: 79551635070     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/00207541003733775     Document Type: Article

References (27)

1. Akers, S.B., 1956. A graphical approach to production scheduling problems. Operations Research, 4 (2), 244-245.
2. Brucker, P. and Schlie, R., 1990. Job-shop scheduling with multi-purpose machines. Computing, 45 (4), 369-375.
3. Caraffa, V., et al., 2001. Minimizing makespan in a blocking flowshop using genetic algorithms. International Journal of Production Economics, 70 (2), 101-115.
4. Chan, F.T.S., Wong, T.C., and Chan, L.Y., 2006. Flexible job-shop scheduling problem under resource constraints. International Journal of Production Research, 44 (11), 2071-2089.
5. Chen, M., 1999. A heuristic for solving manufacturing process and equipment selection problems. International Journal of Production Research, 37 (2), 359-374.
6. Chu, F. and Xie, X.L., 1997. Deadlock analysis of Petri nets using siphons and mathematical programming. IEEE Transactions on Robotics and Automation, 13 (6), 793-804.
7. Dauzère-Pérès, S. and Paulli, J., 1997. An integrated approach for modelling and solving the multiprocessor job-shop scheduling problem using tabu search. Annals of Operations Research, 70, 281-306.
8. Dauzère-Pérès, S., Roux, W., and Lasserre, J.B., 1998. Multi-resource shop scheduling with resource flexibility. European Journal of Operational Research, 107 (2), 289-305.
9. ElMaraghy, A.H.A. and ElMekkawy, T.Y., 2002. Deadlock-free scheduling in flexible manufacturing systems using Petri nets. International Journal of Production Research, 40 (12), 2733-2756.
10. Fahmy, S.A., Balakrishnan, S., and ElMekkawy, T.Y., 2009. A generic deadlock-free reactive scheduling approach. International Journal of Production Research, 47 (20), 5657-5676.
11. Goldberg, D. and Lingle, R., 1985. Alleles, loci, and the traveling salesman problem. In: Proceedings of the 1st international conference on genetic algorithms and their applications. Lawrence Erlbaum Associates, 154-159.
12. Gomes, M.C., Barbosa-Povoa, A.P., and Novais, A.Q., 2005. Optimal scheduling for flexible job shop operation. International Journal of Production Research, 43 (11), 2323-2353.
13. Grabowski, J. and Pempera, J., 2007. The permutation flow shop problem with blocking: a tabu search approach. Omega, 35 (3), 302-311.
14. Hall, N. and Sriskandarajah, S., 1996. A survey of machine scheduling problems with blocking and no-wait in process. Operations Research, 44 (3), 510-525.
15. Lee, D.Y. and DiCesare, F., 1994. Scheduling flexible manufacturing systems using Petri nets and heuristic search. IEEE Transactions on Robotics and Automation, 10 (2), 123-132.
16. Martinez, S., et al., 2006. Complexity of flow-shop with a new blocking constraint. European Journal of Operational Research, 169 (3), 855-864.
17. Mati, Y., Rezg, N., and Xie, X.L., 2001a. Geometric approach and taboo search for scheduling flexible manufacturing systems. IEEE Transactions on Robotics and Automation, 17 (6), 805-818. (Pubitemid 34125079)
18. Mati, Y., Rezg, N., and Xie, X.L., 2001b. A taboo search approach for deadlock-free scheduling of automated manufacturing systems. Journal of Intelligent Manufacturing, 12 (5/6), 535-552. (Pubitemid 33074845)
19. Mati, Y. and Xie, X.L., 2004. The complexity of the two-job shop scheduling problems with multipurpose unrelated machines. European Journal of Operational Research, 152 (1), 159-169.
20. Mati, Y. and Xie, X.L., 2008a. A genetic search guided greedy algorithm for multi-resource shop scheduling with resource flexibility. IIE Transactions, 40 (12), 1228-1240.
21. Mati, Y. and Xie, X.L., 2008b. Multi-resource shop scheduling with blocking and resource flexibility. Submitted.
22. Paulli, J., 1995. A hierarchical approach for the FMS scheduling problem. European Journal of Operational Research, 86 (1), 32-42.
23. Ronconi, D.P., 2008. A branch-and-bound algorithm to minimize the makespan in a flowshop problem with blocking. Annals of Operations Research, 138 (1), 53-65.
24. Sawik, T.J., 1995. Scheduling flexible flow lines with no in-process buffers. International Journal of Production Research, 33 (5), 1357-1367.
25. Sawik, T.J., 2000. Mixed integer programming for scheduling flexible flow lines with limited intermediate buffers. Mathematical and Computer Modelling, 31 (13), 39-52.
26. Wang, X. and Tang, L., 2008. A tabu search heuristic for the hybrid flowshop scheduling with finite intermediate buffers. Computers and Operations Research, 36 (3), 907-918.
27. Wardono, B. and Fathi, Y., 2004. A tabu search algorithm for the multi-stage parallel machine problem with limited buffer capacities. European Journal of Operational Research, 155 (2), 380-401.