Table of Contents
ISRN Applied Mathematics
Volume 2011 (2011), Article ID 165620, 19 pages
http://dx.doi.org/10.5402/2011/165620
Research Article

Ant Colony Algorithm for Just-in-Time Job Shop Scheduling with Transportation Times and Multirobots

1CERENE, ISEL, Quai Frissard, BP 1137, 76063 Le Havre Cedex, France
2Modelling Laboratory and Scientific Computing, Faculty of Science and Technology, BP 2202, Route D'Imouzzer Fez, Morocco

Received 27 March 2011; Accepted 27 April 2011

Academic Editor: S. G. Garcia

Copyright © 2011 Fatima El Khoukhi et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. A. S. Jain and S. Meeran, “Deterministic job-shop scheduling: past, present and future,” European Journal of Operational Research, vol. 113, no. 2, pp. 390–434, 1999. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  2. W. Xia and Z. Wu, “An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problem,” Computers & Industrial Engineering, vol. 48, pp. 409–425, 2005. View at Publisher · View at Google Scholar
  3. G. Cavory, R. Dupas, and G. Goncalves, “A genetic approach to solving the problem of cyclic job shop scheduling with linear constraints,” European Journal of Operational Research, vol. 161, no. 1, pp. 73–85, 2005. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  4. M. A. Adibi, M. Zandieh, and M. Amiri, “Multi-objective scheduling of dynamic job shop using variable neighborhood search,” Expert Systems with Applications, vol. 37, no. 1, pp. 282–287, 2010. View at Publisher · View at Google Scholar
  5. J. Gu, M. Gu, C. Cao, and X. Gu, “A novel competitive co-evolutionary quantum genetic algorithm for stochastic job shop scheduling problem,” Computers & Operations Research, vol. 37, no. 5, pp. 927–937, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  6. J. Chao-Hsien Pan and J.-S. Chen, “Mixed binary integer programming formulations for the reentrant job shop scheduling problem,” Computers & Operations Research, vol. 32, no. 5, pp. 1197–1212, 2005. View at Google Scholar · View at Zentralblatt MATH
  7. A. Rossi and G. Dini, “Flexible job-shop scheduling with routing flexibility and separable setup times using ant colony optimization method,” Robotics and Computer-Integrated Manufacturing, vol. 23, no. 5, pp. 503–516, 2007. View at Publisher · View at Google Scholar
  8. H. Gröflin and A. Klinkert, “A new neighborhood and tabu search for the blocking job shop,” Discrete Applied Mathematic, vol. 157, no. 17, pp. 3643–3655, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  9. J. Boukachour and A. Benabdelhafid, “Résolution d'un probléme d'ordonnancement de type job-shop par les algorithmes génétiques,” in Proceedings of the Troisiéme Conférence Internationale de Mathématiques Appliquées et des Sciences de l'Ingénieur, CIMASI, Casablanca, Maroc, Octobre 2000.
  10. K.-L. Huang and C.-J. Liao, “Ant colony optimization combined with taboo search for the job shop scheduling problem,” Computers & Operations Research, vol. 35, no. 4, pp. 1030–1046, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  11. A. Soukhal, A. Oulamara, and P. Martineau, “Complexity of flow shop scheduling problems with transportation constraints,” European Journal of Operational Research, vol. 161, no. 1, pp. 32–41, 2005. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  12. C.-Y. Lee and Z.-L. Chen, “Machine scheduling with transportation considerations,” Journal of Scheduling, vol. 4, no. 1, pp. 3–24, 2001. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  13. J. Hurink and S. Knust, “A tabu search algorithm for scheduling a single robot in a job-shop environment,” Discrete Applied Mathematics, vol. 119, no. 1-2, pp. 181–203, 2002. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  14. J. Hurink and S. Knust, “Tabu search algorithms for job shop problems with a single transport robot,” European Journal of Operational Research, vol. 162, pp. 99–111, 2005. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  15. P. Lacomme, A. Moukrim, and N. Tchernev, “Simultaneously job input sequencing and vehicle dispatching in a single vehicle AGVS: a heuristic branch and bound approach coupled with a discrete events simulation model,” International Journal of Production Research, vol. 43, no. 9, pp. 1911–1942, 2005. View at Publisher · View at Google Scholar
  16. G. El Khayat, A. Langevin, and D. Riopel, “Integrated production and material handling scheduling using mathematical programming and constraint programming,” European Journal of Operational Research, vol. 175, no. 3, pp. 1818–1832, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  17. S. E. Kesen and Ö. F. Baykoç, “Simulation of automated guided vehicle (AGV) systems based on just-in-time (JIT) philosophy in a job shop environment,” Simulation Modelling Practice and Theory, vol. 15, no. 3, pp. 272–284, 2007. View at Publisher · View at Google Scholar
  18. J. Yuan, A. Soukhal, Y. Chen, and L. Lu, “A note on the complexity of flow shop scheduling with transportation constraints,” European Journal of Operational Research, vol. 178, no. 3, pp. 918–925, 2007. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  19. P. Brucker, S. Heitmann, J. Hurink, and T. Nieberg, “Job-shop scheduling with limited capacity buffers,” OR Spectrum, vol. 25, no. 2, pp. 151–176, 2006. View at Google Scholar · View at Zentralblatt MATH
  20. A. Caumond, P. Lacomme, A. Moukrim, and N. Tchernev, “A MILP for scheduling problems in an FMS with one vehicle,” European Journal of Operational Research, vol. 199, pp. 706–722, 2009. View at Publisher · View at Google Scholar
  21. P. Baptiste, M. Flamini, and F. Sourd, “Lagrangian bounds for just-in-time job-shop scheduling,” Computers & Operations Research, vol. 35, no. 3, pp. 906–915, 2008. View at Publisher · View at Google Scholar
  22. R. Cheng, M. Gen, and Y. Tsujimura, “A tutorial survey of job-shop scheduling problems using genetic algorithms-I. Representation,” Computers & Industrial Engineering, vol. 30, no. 40, pp. 983–997, 1996. View at Publisher · View at Google Scholar
  23. R. Abounacer, J. Boukachour, B. Dkhissi, and A. El Hilali Alaoui, “A hybrid Ant Colony Algorithm for the exam timetabling problem,” Revue ARIMA, vol. 12, pp. 15–42, 2010. View at Google Scholar
  24. G. Bencheikh, J. Boukachour, and A. El Hilali Alaoui, “Improved Ant Colony Algorithm to solve the aircraft landing problem,” International Journal of Computer Theory and Engineering, vol. 3, no. 2, pp. 224–233, 2011. View at Google Scholar
  25. G. Bencheikh, J. Boukachour, A. El Hilali Alaoui, and F. El Khoukhi, “Hybrid method for aircraft landing scheduling based on a Job Shop formulation,” International Journal of Computer Science and Network Security, vol. 9, no. 8, 2009. View at Google Scholar