Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
J. Adams E. Balas D. Zawack (1988) ArticleTitleThe shifting bottleneck procedure for job shop scheduling Management Science 34 IssueID3 391–401 Occurrence Handle10.1287/mnsc.34.3.391
R. Aggoune M.-C. Portmann (2006) ArticleTitleFlow shop scheduling problem with limited machine availability: a heuristic approach International Journal of Production Economics 99 IssueID1-2 4–15 Occurrence Handle10.1016/j.ijpe.2004.12.002
R. Aggoune (2004) ArticleTitleMinimizing the makespan for the flow shop scheduling problem with availability constraints European Journal of Operational Research 153 534–543 Occurrence Handle10.1016/S0377-2217(03)00261-3
H. Allaoui A. Artiba (2006) ArticleTitleScheduling two-stage hybrid flow shop with availability Computers & Operations Research 33 IssueID5 1399–1419 Occurrence Handle10.1016/j.cor.2004.09.034
E. Balas A. Vazacopoulos (1998) ArticleTitleGuided local search with shifting bottleneck for job shop scheduling Management Science 44 IssueID2 262–275
J. Breit G. Schmidt V.A. Strusevich (2001) ArticleTitleTwo-machine open shop scheduling with an availability constraint Operation Research Letters 29 65–77 Occurrence Handle10.1016/S0167-6377(01)00079-7
J. Breit (2006) ArticleTitleA polynomial-time approximation scheme for the two-machine flow shop scheduling problem with an availability constraint Computers & Operations Research 33 IssueID8 2143–2153 Occurrence Handle10.1016/j.cor.2005.01.004
T. C. E. Cheng Z. Liu (2003) ArticleTitleApproximability of two-machine no-wait flowshop scheduling with availability constraints Operations Research Letters 31 319–322 Occurrence Handle10.1016/S0167-6377(02)00230-4
M. Gen R. Cheng (1997) Genetic algorithms & engineering design Wiley New York
M. Gen R. Cheng (2000) Genetic algorithms & engineering optimization Wiley New York
A. Gharbi M. Haouari (2005) ArticleTitleOptimal parallel machines scheduling with availability constraints Discrete Applied Mathematics 148 63–87 Occurrence Handle10.1016/j.dam.2004.12.003
J. F. Goncalves J. J. M. Mendes M. G. C. Resende (2005) ArticleTitleA hybrid genetic algorithm for the job shop scheduling problem European Journal of Operational Research 167 77–95 Occurrence Handle10.1016/j.ejor.2004.03.012
G.H. Graves C.-Y. Lee (1999) ArticleTitleScheduling maintenance and semiresumable jobs on a single machine Naval Research Logistics 46 845–863 Occurrence Handle10.1002/(SICI)1520-6750(199910)46:7<845::AID-NAV6>3.0.CO;2-#
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.
I. Kacem S. Hammadi P. Borne (2002) ArticleTitleApproach by localization and multiobjective evolutionary optimization for flexible job-shop scheduling problems IEEE Transactions on Systems, Man, and Cybernetics—Part C 32 IssueID1 1–13 Occurrence Handle10.1109/TSMCC.2002.1009117
C.-Y. Lee (1999) ArticleTitleTwo-machine flowshop scheduling with availability constraints European Journal of Operational Research 114 420–429 Occurrence Handle10.1016/S0377-2217(97)00452-9
C.-Y. Lee Z.-L. Chen (2000) ArticleTitleScheduling jobs and maintenances on parallel machines Naval Research Logistics 47 145–165 Occurrence Handle10.1002/(SICI)1520-6750(200003)47:2<145::AID-NAV5>3.0.CO;2-3
C.-J. Liao D.-L. Shyur C.-H. Lin (2005) ArticleTitleMakespan minimization for two parallel machines with an availability constraint European Journal of Operational Research 160 445–456 Occurrence Handle10.1016/j.ejor.2003.08.034
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.
M. Pinedo (2002) Scheduling theory, algorithms and systems Prentice-Hall Upper Saddle River, NJ
G. Schmidt (2000) ArticleTitleScheduling with limited machine availability European Journal of Operational Research 121 1–15 Occurrence Handle10.1016/S0377-2217(98)00367-1
S. Sadfi B. Penz C. Rapine J. Blażewicz P. Formanowicz (2005) ArticleTitleAn improved approximation algorithm for the single machine total completion time scheduling problem with availability constraints European Journal of Operational Research 161 3–10 Occurrence Handle10.1016/j.ejor.2003.08.026
Z. Wu M. X. Weng (2005) ArticleTitleMultiagent scheduling method with earliness and tardiness objectives in flexible job shops IEEE Transactions on System, Man, and Cybernetics—Part B 35 IssueID2 293–301 Occurrence Handle10.1109/TSMCB.2004.842412
W. Xia Z. Wu (2005) ArticleTitleAn effective hybrid optimization approach for muti-objective flexible job-shop scheduling problem Computer & Industrial Engineering 48 409–425 Occurrence Handle10.1016/j.cie.2005.01.018
H. Zhang M. Gen (2005) ArticleTitleMultistage-based genetic algorithm for flexible job-shop scheduling problem Journal of Complexity International 11 223–232
J. Zoghby J. W. Barnes J. J. Hasenbein (2005) ArticleTitleModeling the reentrant job shop scheduling problem with setups for metaheuristic searches European Journal of Operational Research 167 336–348 Occurrence Handle10.1016/j.ejor.2004.03.027
Author information
Authors and Affiliations
Corresponding author
Additional information
Received: June 2005 /Accepted: December 2005
Rights and permissions
About this article
Cite this article
Gao, J., Gen, M. & Sun, L. Scheduling jobs and maintenances in flexible job shop with a hybrid genetic algorithm. J Intell Manuf 17, 493–507 (2006). https://doi.org/10.1007/s10845-005-0021-x
Issue Date:
DOI: https://doi.org/10.1007/s10845-005-0021-x