Skip to main content
SpringerLink
Log in

A Taxonomy for the Flexible Job Shop Scheduling Problem

  • Conference paper
Optimization, Control, and Applications in the Information Age

Part of the book series: Springer Proceedings in Mathematics & Statistics ((PROMS,volume 130))

Abstract

This chapter aims at developing a taxonomic framework to classify the studies on the flexible job shop scheduling problem (FJSP). The FJSP is a generalization of the classical job shop scheduling problem (JSP), which is one of the oldest NP-hard problems. Although various solution methodologies have been developed to obtain good solutions in reasonable time for FSJPs with different objective functions and constraints, no study which systematically reviews the FJSP literature has been encountered. In the proposed taxonomy, the type of study, type of problem, objective, methodology, data characteristics, and benchmarking are the main categories. In order to verify the proposed taxonomy, a variety of papers from the literature are classified. Using this classification, several inferences are drawn and gaps in the FJSP literature are specified. With the proposed taxonomy, the aim is to develop a framework for a broad view of the FJSP literature and construct a basis for future studies.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Jain, A.S., Meeran, S.: Deterministic job-shop scheduling: past, present and future. Eur. J. Oper. Res. 113(2), 390–434 (1999)

    Article  MATH  Google Scholar 

  2. Johnson, S.: Optimal two and three stage production schedules with set-up times included. Naval Res. Logist. Q. 1, 61–68 (1954)

    Article  Google Scholar 

  3. Adams, J., Balas, E., Zawack, D.: The shifting bottleneck procedure for job shop scheduling, Manag. Sci. 34(3), 391–401 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  4. Brucker, P., Schlie, R.: Job-shop scheduling with multipurpose machines. Computing 45(4), 369–375 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  5. Reisman, A., Kumar, A., Motwani, J.: Flowshop scheduling/sequencing research: a statistical review of the literature, 1952–1994. IEEE Trans. Eng. Manage. 44(3), 316–329 (1997)

    Article  Google Scholar 

  6. Quadt, D., Kuhn, H.: A taxonomy of flexible flow line scheduling procedures. Eur. J. Oper. Res. 178(3), 686–698 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  7. Başar, A., Çatay, B., Ünlüyurt, T.: A taxonomy for emergency service station location problem. Optim. Lett. 6(6), 1147–1160 (2012)

    Article  MATH  Google Scholar 

  8. Pezzella, F., Morganti, G., Ciaschetti, G.: A genetic algorithm for the flexible job-shop scheduling problem. Comput. Oper. Res. 35(10), 3202–3212 (2008)

    Article  MATH  Google Scholar 

  9. Hurink, J., Jurisch, B., Thole, M.: Tabu search for the job-shop scheduling problem with multi-purpose machines. OR Spectr. 15, 205–215 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  10. Wagner, H.M.: An integer linear-programming model for machine scheduling. Naval Res. Logist. Q. 6(2), 131–140 (1959)

    Article  Google Scholar 

  11. Bowman, E.: The scheduling-sequence problem. Oper. Res. 7, 621–624 (1959)

    Article  MATH  Google Scholar 

  12. Manne, A.S.: On the job-shop scheduling problem. Oper. Res. 8(2), 219–223 (1960)

    Article  MathSciNet  Google Scholar 

  13. Özgüven, C., Özbakır, L., Yavuz, Y.: Mathematical models for job-shop scheduling problems with routing and process plan flexibility. Appl. Math. Model. 34(6), 1539–1548 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  14. Demir, Y., İşleyen, S.K.: Evaluation of mathematical models for flexible job-shop scheduling problems. Appl. Math. Model. 37(3), 977–988 (2013)

    Article  MathSciNet  Google Scholar 

  15. Birgin, E.G., Feofiloff, P., Fernandes, C.G., de Melo, E.L., Oshiro, M.T.I., Ronconi, D.P.: A MILP model for an extended version of the flexible job shop problem. Optim. Lett. 8(4), 1417–1431 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  16. Fattahi, P., Mehrabad, M.S., Jolai, F.: Mathematical modeling and heuristic approaches to flexible job shop scheduling problems. J. Intell. Manuf. 18(3), 331–342 (2007)

    Article  Google Scholar 

  17. Qi, J.G., Burns, G.R., Harrison, D.K.: The application of parallel multipopulation genetic algorithms to dynamic job-shop scheduling. Int. J. Adv. Manuf. Technol. 16(8), 609–615 (2000)

    Article  Google Scholar 

  18. Baykasoğlu, A., Özbakır, L.: Analyzing the effect of dispatching rules on the scheduling performance through grammar based flexible scheduling system. Int. J. Prod. Econ. 124(2), 369–381 (2010)

    Article  Google Scholar 

  19. Chen, J.C., Chen, K.H., Wu, J.J., Chen, C.W.: A study of the flexible job shop scheduling problem with parallel machines and reentrant process. Int. J. Adv. Manuf. Technol. 39(3–4), 344–354 (2008)

    Article  Google Scholar 

  20. Yazdani, M., Amiri, M., Zandieh, M.: Flexible job-shop scheduling with parallel variable neighborhood search algorithm. Expert Syst. Appl. 37(1), 678–687 (2010)

    Article  Google Scholar 

  21. Rajkumar, M., Asokan, P., Vamsikrishna, V.: A grasp algorithm for flexible job-shop scheduling with maintenance constraints. Int. J. Prod. Res. 48(22), 6821–6836 (2010)

    Article  MATH  Google Scholar 

  22. Rajkumar, M., Asokan, P., Anilkumar, N., Page, T.: A grasp algorithm for flexible job-shop scheduling problem with limited resource constraints. Int. J. Prod. Res. 49(8), 2409–2423 (2011)

    Article  Google Scholar 

  23. Saidi-Mehrabad, M., Fattahi, P.: Flexible job shop scheduling with tabu search algorithms. Int. J. Adv. Manuf. Technol. 32(5–6), 563–570 (2007)

    Article  Google Scholar 

  24. Ennigrou, M., Ghedira, K.: New local diversification techniques for flexible job shop scheduling problem with a multi-agent approach. Auton. Agent. Multi-Agent Syst. 17(2), 270–287 (2008)

    Article  Google Scholar 

  25. Fattahi, P., Jolai, F., Arkat, J.: Flexible job shop scheduling with overlapping in operations. Appl. Math. Model. 33(7), 3076–3087 (2009)

    Article  MATH  Google Scholar 

  26. Al-Hinai, N., ElMekkawy, T.Y.: An efficient hybridized genetic algorithm architecture for the flexible job shop scheduling problem. Flex. Serv. Manuf. J. 23(1), 64–85 (2011)

    Article  Google Scholar 

  27. Ho, N.B., Tay, J.C., Lai, E.M.K.: An effective architecture for learning and evolving flexible job-shop schedules. Eur. J. Oper. Res. 179(2), 316–333 (2007)

    Article  MATH  Google Scholar 

  28. De Giovanni, L., Pezzella, F.: An improved genetic algorithm for the distributed and flexible job-shop scheduling problem. Eur. J. Oper. Res. 200(2), 395–408 (2010)

    Article  MATH  Google Scholar 

  29. Cheng, R., Gen, M., Tsujimura, Y.: A tutorial survey of job-shop scheduling problems using genetic algorithms - I: representation. Comput. Ind. Eng. 30(4), 983–997 (1996)

    Article  Google Scholar 

  30. Mesghouni, K., Hammadi, S., Borne, P.: Evolution programs for job-shop scheduling. In: 1997 IEEE International Conference on Systems, Man, and Cybernetics, 1997. Computational Cybernetics and Simulation, Orlando, vol. 1, Oct 1997, pp. 720–725

    Google Scholar 

  31. Saad, I., Hammadi, S., Benrejeb, M., Borne, P.: Choquet integral for criteria aggregation in the flexible job-shop scheduling problems. Math. Comput. Simul. 76(5–6), 447–462 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  32. Chen, H., Ihlow, J., Lehmann, C.: A genetic algorithm for flexible job-shop scheduling. In: Proceedings of 1999 IEEE International Conference on Robotics and Automation, 1999, vol. 2, pp. 1120–1125 (1999)

    Google Scholar 

  33. Kacem, I., Hammadi, S., Borne, P.: Approach by localization and multiobjective evolutionary optimization for flexible job-shop scheduling problems. IEEE Trans. Syst. Man Cybern. C Appl. Rev. 32(1), 1–13 (2002)

    Article  Google Scholar 

  34. Chan, F.T.S., Wong, T.C., Chan, L.Y.: Flexible job-shop scheduling problem under resource constraints. Int. J. Prod. Res. 44(11), 2071–2089 (2006)

    Article  MATH  Google Scholar 

  35. Defersha, F.M., Chen, M.Y.: A parallel genetic algorithm for a flexible job-shop scheduling problem with sequence dependent setups. Int. J. Adv. Manuf. Technol. 49(1–4), 263–279 (2010)

    Article  Google Scholar 

  36. Moradi, E., Ghomi, S., Zandieh, M.: An efficient architecture for scheduling flexible job-shop with machine availability constraints. Int. J. Adv. Manuf. Technol. 51(1–4), 325–339 (2010)

    Article  Google Scholar 

  37. Moradi, E., Ghomi, S., Zandieh, M.: Bi-objective optimization research on integrated fixed time interval preventive maintenance and production for scheduling flexible job-shop problem. Expert Syst. Appl. 38(6), 7169–7178 (2011)

    Article  Google Scholar 

  38. Zhang, G.H., Gao, L., Shi, Y.: An effective genetic algorithm for the flexible job-shop scheduling problem. Expert Syst. Appl. 38(4), 3563–3573 (2011)

    Article  Google Scholar 

  39. Gao, L., Zhang, C.Y., Wang, X.J.: An improved genetic algorithm for multi-objective flexible job-shop scheduling problem. Adv. Mater. Res. 97, 2449–2454 (2010)

    Google Scholar 

  40. Gao, J., Sun, L.Y., Gen, M.S.: A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems. Comput. Oper. Res. 35(9), 2892–2907 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  41. Gao, J., Gen, M., Sun, L.Y., Zhao, X.H.: A hybrid of genetic algorithm and bottleneck shifting for multiobjective flexible job shop scheduling problems. Comput. Ind. Eng. 53(1), 149–162 (2007)

    Article  MATH  Google Scholar 

  42. Gao, J., Gen, M., Sun, L.Y.: Scheduling jobs and maintenances in flexible job shop with a hybrid genetic algorithm. J. Intell. Manuf. 17(4), 493–507 (2006)

    Article  Google Scholar 

  43. Li, J.Q., Pan, Q.K., Xie, S.X.: A hybrid variable neighborhood search algorithm for solving multi-objective flexible job shop problems. Comput. Sci. Inf. Syst. 7(4), 907–930 (2010)

    Article  Google Scholar 

  44. Lei, D.M.: A genetic algorithm for flexible job shop scheduling with fuzzy processing time. Int. J. Prod. Res. 48(10), 2995–3013 (2010)

    Article  MATH  Google Scholar 

  45. Wang, X.J., Gao, L., Zhang, C.Y., Shao, X.Y.: A multi-objective genetic algorithm based on immune and entropy principle for flexible job-shop scheduling problem. Int. J. Adv. Manuf. Technol. 51(5–8), 757–767 (2010)

    Article  Google Scholar 

  46. Xing, L.N., Chen, Y.W., Yang, K.W.: Multi-population interactive coevolutionary algorithm for flexible job shop scheduling problems. Comput. Optim. Appl. 48(1), 139–155 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  47. Sun, W., Pan, Y., Lu, X.H., Ma, Q.Y.: Research on flexible job-shop scheduling problem based on a modified genetic algorithm. J. Mech. Sci. Technol. 24(10), 2119–2125 (2010)

    Article  Google Scholar 

  48. Frutos, M., Olivera, A.C., Tohme, F.: A memetic algorithm based on a NSGAII scheme for the flexible job-shop scheduling problem. Ann. Oper. Res. 181(1), 745–765 (2010)

    Article  MathSciNet  Google Scholar 

  49. Jang, Y.J., Kim, K.D., Jang, S.Y., Park, J.: Flexible job shop scheduling with multi-level job structures. JSME Int. J. Ser. C Mech. Syst. Mach. Elem. Manuf. 46(1), 33–38 (2003)

    Article  Google Scholar 

  50. Liu, H.B., Abraham, A., Wang, Z.W.: A multi-swarm approach to multi-objective flexible job-shop scheduling problems. Fundam. Inform. 95(4), 465–489 (2009)

    MathSciNet  Google Scholar 

  51. Boukef, H., Benrejeb, M., Borne, P.: Flexible job-shop scheduling problems resolution inspired from particle swarm optimization. Stud. Inf. Control 17(3), 241–252 (2008)

    Google Scholar 

  52. Pongchairerks, P., Kachitvichyanukul, V.: A particle swarm optimization algorithm on job-shop scheduling problems with multi-purpose machines. Asia Pac. J. Oper. Res. 26(2), 161–184 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  53. Xing, L.N., Chen, Y.W., Wang, P., Zhao, Q.S., Xiong, J.: Knowledge-based ant colony optimization for flexible job shop scheduling problems. Appl. Soft Comput. 10(3), 888–896 (2010)

    Article  Google Scholar 

  54. Rossi, A., Dini, G.: Flexible job-shop scheduling with routing flexibility and separable setup times using ant colony optimisation method. Robot. Comput. Integr. Manuf. 23(5), 503–516 (2007)

    Article  Google Scholar 

  55. Xing, L.N., Chen, Y.W., Yang, K.W.: Multi-objective flexible job shop schedule: design and evaluation by simulation modeling. Appl. Soft Comput. 9(1), 362–376 (2009)

    Article  Google Scholar 

  56. Karthikeyan, S., Asokan, P., Nickolas, S.: A hybrid discrete firefly algorithm for multi-objective flexible job shop scheduling problem with limited resource constraints. Int. J. Adv. Manuf. Technol. 72(9–12), 1567–1579 (2014)

    Article  Google Scholar 

  57. Akyol, D.E., Bayhan, G.M.: Multi-machine earliness and tardiness scheduling problem: an interconnected neural network approach. Int. J. Adv. Manuf. Technol. 37(5–6), 576–588 (2008)

    Article  Google Scholar 

  58. Bagheri, A., Zandieh, M., Mahdavi, I., Yazdani, M.: An artificial immune algorithm for the flexible job-shop scheduling problem. Futur. Gener. Comput. Syst. Int. J. Grid Comput. Theory Methods Appl. 26(4), 533–541 (2010)

    Article  Google Scholar 

  59. Ziaee, M.: A heuristic algorithm for solving flexible job shop scheduling problem. Int. J. Adv. Manuf. Technol. 71(1–4), 519–528 (2014)

    Article  Google Scholar 

  60. Tay, J.C., Ho, N.B.: Evolving dispatching rules using genetic programming for solving multi-objective flexible job-shop problems. Comput. Ind. Eng. 54(3), 453–473 (2008)

    Article  Google Scholar 

  61. Zribi, N., Kacem, I., El Kamel, A., Borne, P.: Assignment and scheduling in flexible job-shops by hierarchical optimization. IEEE Trans. Syst. Man Cybern. C Appl. Rev. 37(4), 652–661 (2007)

    Article  Google Scholar 

  62. Xia, W.J., Wu, Z.M.: An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems. Comput. Ind. Eng. 48(2), 409–425 (2005)

    Article  MathSciNet  Google Scholar 

  63. Grobler, J., Engelbrecht, A.P., Kok, S., Yadavalli, S.: Metaheuristics for the multi-objective FJSP with sequence-dependent set-up times, auxiliary resources and machine down time. Ann. Oper. Res. 180(1), 165–196 (2010)

    Article  MATH  Google Scholar 

  64. Zhang, G.H., Shao, X.Y., Li, P.G., Gao, L.: An effective hybrid particle swarm optimization algorithm for multi-objective flexible job-shop scheduling problem. Comput. Ind. Eng. 56(4), 1309–1318 (2009)

    Article  Google Scholar 

  65. Moslehi, G., Mahnam, M.: A Pareto approach to multi-objective flexible job-shop scheduling problem using particle swarm optimization and local search. Int. J. Prod. Econ. 129(1), 14–22 (2011)

    Article  Google Scholar 

  66. Li, J.Q., Pan, Q.K., Suganthan, P.N., Chua, T.J.: A hybrid tabu search algorithm with an efficient neighborhood structure for the flexible job shop scheduling problem. Int. J. Adv. Manuf. Technol. 52(5–8), 683–697 (2011)

    Article  Google Scholar 

  67. Li, J.-Q., Pan, Q.-K., Tasgetiren, M.F.: A discrete artificial bee colony algorithm for the multi-objective flexible job-shop scheduling problem with maintenance activities. Appl. Math. Model. 38(3), 1111–1132 (2014)

    Article  MathSciNet  Google Scholar 

  68. Scrich, C.R., Armentano, V.A., Laguna, M.: Tardiness minimization in a flexible job shop: a tabu search approach. J. Intell. Manuf. 15(1), 103–115 (2004)

    Article  Google Scholar 

  69. Bozejko, W., Uchronski, M., Wodecki, M.: Parallel hybrid metaheuristics for the flexible job shop problem. Comput. Ind. Eng. 59(2), 323–333 (2010)

    Article  Google Scholar 

  70. Li, J.Q., Pan, Q.K., Liang, Y.C.: An effective hybrid tabu search algorithm for multi-objective flexible job-shop scheduling problems. Comput. Ind. Eng. 59(4), 647–662 (2010)

    Article  Google Scholar 

  71. Li, J., Pan, Q., Xie, S., Wang, S.: A hybrid artificial bee colony algorithm for flexible job shop scheduling problems. Int. J. Comput. Commun. Control 6(2), 286–296 (2011)

    Google Scholar 

  72. Wang, S.J., Zhou, B.H., Xi, L.F.: A filtered-beam-search-based heuristic algorithm for flexible job-shop scheduling problem. Int. J. Prod. Res. 46(11), 3027–3058 (2008)

    Article  MATH  Google Scholar 

  73. Liouane, N., Saad, I., Hammadi, S., Borne, P.: Ant systems and local search optimization for flexible job shop scheduling production. Int. J. Comput. Commun. Control 2(2), 174–184 (2007)

    Google Scholar 

  74. Reisman, A.: Management Science Knowledge: Its Creation, Generalization, and Consolidation. Quorum Books, Westport, CT (1992)

    Google Scholar 

  75. Eksioglu, B., Vural, A.V., Reisman, A.: The vehicle routing problem: a taxonomic review. Comput. Ind. Eng. 57(4), 1472–1483 (2009)

    Article  Google Scholar 

  76. Gattoufi, S., Oral, M., Reisman, A.: A taxonomy for data envelopment analysis. Socio Econ. Plan. Sci. 38(2–3), 141–158 (2004)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Industrial Engineering, İstanbul Technical University, 34367, İstanbul, Turkey

    Didem Cinar & Y. Ilker Topcu

  2. Center for Applied Optimization, Faculty of Engineering, University of Florida, Gainesville, FL, 32611, USA

    Didem Cinar

  3. Centro Algoritmi/Departamento de Produção e Sistemas, Universidade do Minho, 4710-057, Braga, Portugal

    José António Oliveira

Authors
  1. Didem Cinar
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Y. Ilker Topcu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. José António Oliveira
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Didem Cinar .

Editor information

Editors and Affiliations

  1. Industrial Logistics, ETS Institute, Luleå Technical University, Luleå, Sweden

    Athanasios Migdalas

  2. Industrial Logistics, ETS Institute, Luleå Technical University, Luleå, Sweden

    Athanasia Karakitsiou

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Cinar, D., Topcu, Y.I., Oliveira, J.A. (2015). A Taxonomy for the Flexible Job Shop Scheduling Problem. In: Migdalas, A., Karakitsiou, A. (eds) Optimization, Control, and Applications in the Information Age. Springer Proceedings in Mathematics & Statistics, vol 130. Springer, Cham. https://doi.org/10.1007/978-3-319-18567-5_2

Download citation

Publish with us

Policies and ethics

Search

Navigation