Journal of Intelligent Manufacturing

, Volume 17, Issue 4, pp 493–507 | Cite as

Scheduling jobs and maintenances in flexible job shop with a hybrid genetic algorithm



Most flexible job shop scheduling models assume that the machines are available all of the time. However, in most realistic situations, machines may be unavailable due to maintenances, pre-schedules and so on. In this paper, we study the flexible job shop scheduling problem with availability constraints. The availability constraints are non-fixed in that the completion time of the maintenance tasks is not fixed and has to be determined during the scheduling procedure. We then propose a hybrid genetic algorithm to solve the flexible job shop scheduling problem with non-fixed availability constraints (fJSP-nfa). The genetic algorithm uses an innovative representation method and applies genetic operations in phenotype space in order to enhance the inheritability. We also define two kinds of neighbourhood for the problem based on the concept of critical path. A local search procedure is then integrated under the framework of the genetic algorithm. Representative flexible job shop scheduling benchmark problems and fJSP-nfa problems are solved in order to test the effectiveness and efficiency of the suggested methodology.


Flexible job shop scheduling Availability constraints Genetic algorithm Local search Critical path Maintenance scheduling 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Adams, J., Balas, E., Zawack, D. 1988The shifting bottleneck procedure for job shop schedulingManagement Science34391401CrossRefGoogle Scholar
  2. Aggoune, R., Portmann, M.-C. 2006Flow shop scheduling problem with limited machine availability: a heuristic approachInternational Journal of Production Economics99415CrossRefGoogle Scholar
  3. Aggoune, R. 2004Minimizing the makespan for the flow shop scheduling problem with availability constraintsEuropean Journal of Operational Research153534543CrossRefGoogle Scholar
  4. Allaoui, H., Artiba, A. 2006Scheduling two-stage hybrid flow shop with availabilityComputers & Operations Research3313991419CrossRefGoogle Scholar
  5. Balas, E., Vazacopoulos, A. 1998Guided local search with shifting bottleneck for job shop schedulingManagement Science44262275Google Scholar
  6. Breit, J., Schmidt, G., Strusevich, V.A. 2001Two-machine open shop scheduling with an availability constraintOperation Research Letters296577CrossRefGoogle Scholar
  7. Breit, J. 2006A polynomial-time approximation scheme for the two-machine flow shop scheduling problem with an availability constraintComputers & Operations Research3321432153CrossRefGoogle Scholar
  8. Cheng, T. C. E., Liu, Z. 2003Approximability of two-machine no-wait flowshop scheduling with availability constraintsOperations Research Letters31319322CrossRefGoogle Scholar
  9. Gen, M., Cheng, R. 1997Genetic algorithms & engineering designWileyNew YorkGoogle Scholar
  10. Gen, M., Cheng, R. 2000Genetic algorithms & engineering optimizationWileyNew YorkGoogle Scholar
  11. Gharbi, A., Haouari, M. 2005Optimal parallel machines scheduling with availability constraintsDiscrete Applied Mathematics1486387CrossRefGoogle Scholar
  12. Goncalves, J. F., Mendes, J. J. M., Resende, M. G. C. 2005A hybrid genetic algorithm for the job shop scheduling problemEuropean Journal of Operational Research1677795CrossRefGoogle Scholar
  13. Graves, G.H., Lee, C.-Y. 1999Scheduling maintenance and semiresumable jobs on a single machineNaval Research Logistics46845863CrossRefGoogle Scholar
  14. Krasnogor, N., & Smith, J. (2000). A memetic algorithm with self-adaptive local search: TSP as a case study. Proceedings of 2000 genetic and evolutionary computation conference, July 10–12, Las Vegas, NV, pp. 987–994.Google Scholar
  15. Kacem, I., Hammadi, S., Borne, P. 2002Approach by localization and multiobjective evolutionary optimization for flexible job-shop scheduling problemsIEEE Transactions on Systems, Man, and Cybernetics—Part C32113CrossRefGoogle Scholar
  16. Lee, C.-Y. 1999Two-machine flowshop scheduling with availability constraintsEuropean Journal of Operational Research114420429CrossRefGoogle Scholar
  17. Lee, C.-Y., Chen, Z.-L. 2000Scheduling jobs and maintenances on parallel machinesNaval Research Logistics47145165CrossRefGoogle Scholar
  18. Liao, C.-J., Shyur, D.-L., Lin, C.-H. 2005Makespan minimization for two parallel machines with an availability constraintEuropean Journal of Operational Research160445456CrossRefGoogle Scholar
  19. Moscato, P., & Norman, M. (1992). A memetic approach for the traveling salesman problem: implementation of a computational ecology for combinatorial optimization on message-passing systems. Proceedings of the international conference on parallel computing and transputer applications, Amsterdam.Google Scholar
  20. Pinedo, M. 2002Scheduling theory, algorithms and systemsPrentice-HallUpper Saddle River, NJGoogle Scholar
  21. Schmidt, G. 2000Scheduling with limited machine availabilityEuropean Journal of Operational Research121115CrossRefGoogle Scholar
  22. Sadfi, S., Penz, B., Rapine, C., Blażewicz, J., Formanowicz, P. 2005An improved approximation algorithm for the single machine total completion time scheduling problem with availability constraintsEuropean Journal of Operational Research161310CrossRefGoogle Scholar
  23. Wu, Z., Weng, M. X. 2005Multiagent scheduling method with earliness and tardiness objectives in flexible job shopsIEEE Transactions on System, Man, and Cybernetics—Part B35293301CrossRefGoogle Scholar
  24. Xia, W., Wu, Z. 2005An effective hybrid optimization approach for muti-objective flexible job-shop scheduling problemComputer & Industrial Engineering48409425CrossRefGoogle Scholar
  25. Zhang, H., Gen, M. 2005Multistage-based genetic algorithm for flexible job-shop scheduling problemJournal of Complexity International11223232Google Scholar
  26. Zoghby, J., Barnes, J. W., Hasenbein, J. J. 2005Modeling the reentrant job shop scheduling problem with setups for metaheuristic searchesEuropean Journal of Operational Research167336348CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2006

Authors and Affiliations

  1. 1.School of ManagementXi’an Jiaotong UniversityXi’anChina
  2. 2.Graduate School of Information, Production and SystemsWaseda UniversityKitakyushuJapan

Personalised recommendations