Flexible Job-shop Scheduling Problem with Sequence-dependent Setup Times using Genetic Algorithm

Ameni Azzouz, Meriem Ennigrou, Lamjed Ben Said

Abstract

Job shop scheduling problems (JSSP) are among the most intensive combinatorial problems studied in literature. The flexible job shop problem (FJSP) is a generalization of the classical JSSP where each operation can be processed by more than one resource. The FJSP problems cover two difficulties, namely, machine assignment problem and operation sequencing problem. This paper investigates the flexible job-shop scheduling problem with sequence-dependent setup times to minimize two kinds of objectives function: makespan and bi-criteria objective function. For that, we propose a genetic algorithm (GA) to solve this problem. To evaluate the performance of our algorithm, we compare our results with other methods existing in literature. All the results show the superiority of our GA against the available ones in terms of solution quality.

References

  1. Allahverdi, A. (2015). The third comprehensive survey on scheduling problems with setup times/costs. In European Journal of Operational Research.
  2. Azzouz, A., Ennigrou, M., and Jlifi, B. (2015). Diversifying ts using ga in multi-agent system for solving flexible job shop problem. In Proceedings of the 12th International Conference on Informatics in Control, Automation and Robotics (ICINCO) vol1,pp 94-101.
  3. Azzouz, A., Ennigrou, M., Jlifi, B., and Ghedira, K. (2012). Combining tabu search and genetic algorithm in a multi-agent system for solving flexible job shop problem. In In 11th Mexican International Conference on ArtificialIntelligence (MICAI) pp. 83-88.
  4. Bagheri, A. and Zandieh, M. (2011). Bi-criteria flexible job-shop scheduling with sequence-dependent setup times-variable neighborhood search approach. In Journal of Manufacturing Systems, 30(1), 8-15.
  5. Cheung, W. and Zhou, H. (2001). Using genetic algorithms and heuristics for job shop scheduling with sequencedependent setup times. In Ann Oper Res 107:65.
  6. Davis, L. D. (1985). Applying adaptive algorithms to epistatic domains. In In Proc.InternationalJoint Conference on Artificial Intelligence. 162-164.
  7. Ennigrou, M. and Ghedira, K. (2008). New local diversification techniques for flexible job shop scheduling problem with a multi-agent approach. In In Autonomous Agents and Multi-Agent Systems, vol.17(2),270-287.
  8. Gajpal, Y.and Rajendran, C. and Ziegler, H. (2006). . an ant colony algorithm for scheduling in flowshops with sequence-dependent setup times of jobs. In Int J of Advanced Manufacturing Technology 30 (5-6), 416- 424.
  9. Garey, M. R., Johnson, D. S., and Stockmeyer, L. (1976). Some simplified np-complete graph problems. InTheoretical computer science, 1(3), 237-267.
  10. González, M. Í.and Rodríguez Vela, C. and Varela, R. (2013). An efficient memetic algorithm for the flexible job shop with setup times. In InTwenty-Third International Conference on Automated Planning and Scheduling pp 91-99.
  11. Holland, J. (1975). Adaptation in natural and artificial system. In MIT University of Michigan Press, Ann Arbor.
  12. Hurink, J., Jurisch, B., and Thole, M. (1994). Tabu search for the job-shop scheduling problem with multipurpose machines. In Operations-Research-Spektrum, 15(4), 205-215.
  13. Imanipour, N. (2006). Modeling & solving flexible job shop problem with sequence dependent setup times. In International Conference on Service Systems and Service Management (Vol. 2, pp. 1205-1210). IEEE.
  14. Kacem, I.and Hammadi, S. and Borne, P. (2002). Approach by localization and multiobjective evolutionary optimization for flexible job-shop scheduling problems. In Syst IEEE Syst Man Cybern 32(1):1-13.
  15. Kaweegitbundit, P. (2011). Comparison of heuristic for flow shop scheduling problems with sequence dependent setup time. In Advanced Materials Research 339 (1), 332-335.
  16. Kim, S. C. and Bobrowski, P. M. (1994). Impact of sequence-dependent setup time on job shop scheduling performance. In The International Journal of Production Research, 32(7), 1503-1520.
  17. Li, X. and Zhang, Y. (2012). Adaptive hybrid algorithms for the sequence-dependent setup time permutation flow shop scheduling problem. In IEEE Transactions on Automation Science and Engineering 9(3), 578-595.
  18. Mirabi, M. (2011). Ant colony optimization technique for the sequence-dependent flowshop scheduling problem. In Int J of Advanced Manufacturing Technology 55 (1-4), 317-326.
  19. Mirabi, M. (2014). A novel hybrid genetic algorithm to solve the sequence-dependent permutation flow-shop scheduling problem. In International Journal of Advanced Manufacturing Technology 74 (1-4), 429-437.
  20. Moghaddas, R. and Houshmand, M. (2008). Job-shop scheduling problem with sequence dependent setup times. In Proceedings of the International MultiConference of Engineers and Computer Scientists, Vol II.
  21. Mousakhani, M. (2013). Sequence-dependent setup time flexible job shop scheduling problem to minimise total tardiness. In International Journal of Production Research, 51(12), 3476-3487.
  22. Naderi, B.and Zandieh, M. and Ghomi, S. F. (2009). Scheduling sequence-dependent setup time job shops with preventive maintenance. In The International Journal of Advanced Manufacturing Technology, 43(1-2), 170-181.
  23. Nuijten, W. P. and Aarts, E. H. (1996). A computational study of constraint satisfaction for multiple capacitated job shop scheduling. In European Journal of Operational Research, 90(2), 269-284.
  24. Oddi, A., Rasconi, R., Cesta, A., and Smith, S. (2011). Applying iterative flattening search to the job shop scheduling problem with alternative resources and sequence dependent setup times. In In COPLAS 2011 Proceedings of the Workshopon Constraint Satisfaction Techniques for Planning and Scheduling Problems.
  25. Pezzella, F., Morganti, G., and Ciaschetti, G. (2008). A genetic algorithm for the flexible job-shop scheduling problem. In Computers & Operations Research,35(10), 3202-3212.
  26. Rossi, A. (2014). Flexible job shop scheduling with sequence-dependent setup and transportation times by ant colony with reinforced pheromone relationships. In International Journal of Pro-duction Economics, 153, 253-267.
  27. Sadrzadeh, A. (2013). Development of both the ais and pso for solving the flexible job shop scheduling problem. In Arabian Journal for Science and Engineering, 38(12), 3593-3604.
  28. Saidi-Mehrabad, M. and Fattahi, P. (2007). Flexible job shop scheduling with tabu search algorithms. In The International Journal of Advanced Manufacturing Technology, 32(5-6), 563-570.
  29. Santos, N., Rebelo, R., and Pedroso, J. (2014). A tabu search for the permutation flow shop problem with sequence dependent setup times. In International Journal of Data Analysis Tech-niques and Strategies 6 (3), 275-285.
  30. Turkyllmaz, A. and Bulkan, S. (2014). A hybrid algorithm for total tardiness minimisation in flexible job shop: genetic algorithm with parallel vns execution. In International Journal of Production Research, 53(6), 1832-1848.
  31. Varmazyar, M. and Salmasi, N. (2012). Minimizing the number of tardy jobs in flow shop sequence dependent setup times scheduling problem. In Applied Mechanics and Materials 110-116, 4063-4069.
  32. Zhang, G., Gao, L., and Shi, Y. (2011). An effective genetic algorithm for the flexible job-shop scheduling problem. In Expert Syst. Appl. 38(4)3563-3573.
  33. Zhou, Y., Beizhi, L., and Yang, J. (2006). Study on job shop scheduling with sequence-dependent setup times using biological immune algorithm. In Int J Adv Manuf Technol 30:105-111.
  34. Ziaee, M. (2014). A heuristic algorithm for solving flexible job shop scheduling problem. In Int Adv Manuf Technol 71: 519.
Download


Paper Citation


in Harvard Style

Azzouz A., Ennigrou M. and Said L. (2016). Flexible Job-shop Scheduling Problem with Sequence-dependent Setup Times using Genetic Algorithm . In Proceedings of the 18th International Conference on Enterprise Information Systems - Volume 2: ICEIS, ISBN 978-989-758-187-8, pages 47-53. DOI: 10.5220/0005821900470053


in Bibtex Style

@conference{iceis16,
author={Ameni Azzouz and Meriem Ennigrou and Lamjed Ben Said},
title={Flexible Job-shop Scheduling Problem with Sequence-dependent Setup Times using Genetic Algorithm},
booktitle={Proceedings of the 18th International Conference on Enterprise Information Systems - Volume 2: ICEIS,},
year={2016},
pages={47-53},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0005821900470053},
isbn={978-989-758-187-8},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 18th International Conference on Enterprise Information Systems - Volume 2: ICEIS,
TI - Flexible Job-shop Scheduling Problem with Sequence-dependent Setup Times using Genetic Algorithm
SN - 978-989-758-187-8
AU - Azzouz A.
AU - Ennigrou M.
AU - Said L.
PY - 2016
SP - 47
EP - 53
DO - 10.5220/0005821900470053