Abstract
Scheduling for the flexible job shop is very important in both fields of production management and combinatorial optimization. However, it is quite difficult to achieve an optimal solution to this problem in medium and actual size problem with traditional optimization approaches owing to the high computational complexity. For solving the realistic case with more than two jobs, two types of approaches have been used: hierarchical approaches and integrated approaches. In hierarchical approaches assignment of operations to machines and the sequencing of operations on the resources or machines are treated separately, i.e., assignment and sequencing are considered independently, where in integrated approaches, assignment and sequencing are not differentiated. In this paper, a mathematical model and heuristic approaches for flexible job shop scheduling problems (FJSP) are considered. Mathematical model is used to achieve optimal solution for small size problems. Since FJSP is NP-hard problem, two heuristics approaches involve of integrated and hierarchical approaches are developed to solve the real size problems. Six different hybrid searching structures depending on used searching approach and heuristics are presented in this paper. Numerical experiments are used to evaluate the performance of the developed algorithms. It is concluded that, the hierarchical algorithms have better performance than integrated algorithms and the algorithm which use tabu search and simulated annealing heuristics for assignment and sequencing problems consecutively is more suitable than the other algorithms. Also the numerical experiments validate the quality of the proposed algorithms.
Similar content being viewed by others
References
Aarts E.H.L., Korst J.H.M., van Laarhoven P.J.M. (1997). Simulated annealing. In: Aarts E., Lenstra J. (eds). Local search in combinatorial optimization. Chichester, Wiley, pp. 91–120
Brandimarte P. (1993). Routing and scheduling in a flexible job shop by taboo search. Annals of Operations Research, 41, 157–183
Bruker P., Schlie R. (1990). Job shop scheduling with multi-purpose machines. Computing, 45, 369–375
Cerny V. (1985). Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm. Journal of Optimization Theory and Applications, 45, 41–51
Dauzere-Peres S., Paulli J. (1997). An integrated aooroach for modeling and solving the general multiprocessor job shop scheduling problem using tabu search. Annals of Operations Research, 70, 281–306
Garey M.R., Johnson D.S., Sethi R. (1976). The complexity of flowshop and jobshop scheduling. Mathematics of Operations Research, 1, 117–129
Hurink E., Jurisch B., Thole M. (1994). Tabu search for the job shop scheduling problem with multi-purpose machines. Operations Research Spektrum, 15, 205–215
Johnson D.S., Aragon C.R., McGeoch L.A., Schevon C. (1989). Optimization by simulated annealing: An experimental evaluation; part 1, Graph partitioning. Operations Research, 37, 865–892
Kacem I., Hammadi S., Borne P. (2002). Pareto-optimality approach for flexible job-shop scheduling problems: Hybridization of evolutionary algorithms and fuzzy logic. Mathematics and Computers in Simulation, 60, 245–276
Kirkpatrick S., Gelatt Jr. C., Vecchi M. (1983). Optimization by simulated annealing. Science, 220, 671–680
Low C., Yip Y., Wu T. (2006). Modelling and heuristics of FMS scheduling with multiple objectives. Computers & Operations Research, 33, 674–694
Mastrololli M., Gambardella L.M. (2002). Effective neighborhood functions for the flexible job shop problem. Journal of Scheduling, 3(1):3–20
Pham D.T., Karaboga D. (2000). Intelligent optimization techniques: Genetic algorithms, tabu search, simulated annealing and neural networks. London, Sringer
Saidi Mehrabad M., Fattahi P. (2007). Flexible job shop scheduling with tabu search algorithm. International Journal of Advanced Manufacturing Technology 32, 563–570
Van Laarhoven P.J.M., Aarts E.H.L. (1987). Simulated annealing: theory and applications. Dordrecht, Reidel
Xia W., Wu Z. (2005). An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems. Computers & Industrial Engineering, 48, 409–425
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Fattahi, P., Saidi Mehrabad, M. & Jolai, F. Mathematical modeling and heuristic approaches to flexible job shop scheduling problems. J Intell Manuf 18, 331–342 (2007). https://doi.org/10.1007/s10845-007-0026-8
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10845-007-0026-8