Abstract
This paper presents a tabu search algorithm that solves the flexible job shop scheduling problem to minimize the makespan time. As a context for solving sequencing and scheduling problems, the flexible job shop model is highly complicated. Alternative operation sequences and sequence-dependent setups are two important factors that frequently appear in various manufacturing environments and in project scheduling. In this paper, we present a model for a flexible job shop scheduling problem while considering those factors simultaneously. The purpose of this paper is to minimize the makespan time and to find the best sequence of operations and the best choice of machine alternatives, simultaneously. The proposed tabu search algorithm is composed of two parts: a procedure that searches for the best sequence of job operations, and a procedure that finds the best choice of machine alternatives. Randomly generated test problems are used to evaluate the performance of the proposed algorithm. Results of the algorithm are compared with the optimal solution using a mathematical model solved by the traditional optimization technique (the branch and bound method). After modeling the scheduling problem, the model is verified and validated. Then the computational results are presented. Computational results indicate that the proposed algorithm can produce optimal solutions in a short computational time for small and medium sized problems. Moreover, it can be applied easily in real factory conditions and for large size problems. The proposed algorithm should thus be useful to both practitioners and researchers.
Similar content being viewed by others
References
Garey MR, Johnson DS, Sethi R (1976) The complexity of flowshop and jobshop scheduling. Math Oper Res 1:117–129
Van Laarhoven P, Aarts E, Lenstra J (1992) Jobshop scheduling by simulated annealing. Oper Res 40:113–125
Jain A, Meeran S (1998) Job shop scheduling using neural networks. Int J Prod Res 36:1249–1272
Lee C, Piramuthu S, Tsai Y (1997) Job shop scheduling with a genetic algorithm and machine learning. Int J Prod Res 35:1171–1191
Nowicki E, Smutnicki C (1996) Fast tabu search algorithm for job shop problem. Manage Sci 42:797–813
Taillard E (1994) Parallel tabu search techniques for job shop scheduling problem. ORSA J Comput 16:108–117
Choi IC, Choi DS (2002) A local search algorithm for job shop scheduling problems with alternative operations and sequence-dependent setups. Comput Ind Eng 42:43–45
Shin HJ, Kim CO, Kim SS (2002) A tabu search algorithm for single machine scheduling with release time, due dates and sequence dependent setup times. Int J Adv Manuf Technol 19:859–866
Ponnambalam SG, Aravindan P, Rajesh SV (2000) A tabu search algorithm for job shop scheduling. Int J Adv Manuf Technol 16:765–771
Kim S, Bobrowski P (1992) Impact of sequence-dependent setup time on job shop scheduling performance. Int J Prod Res 32:1503–1520
Aanen E, Gaalman G, Nawijn W (1993) A scheduling approach for a flexible manufacturing system. Int J Prod Res 31:2369–2385
Choi I, Korkmaz O (1997) Job shop scheduling with separable sequence-dependent setups. Annals Oper Res 70:155–170
Gupta S (1982) N job and m machines job shop problems with sequence dependent setup time. Int J Prod Res 20:643–656
Allahverdi A, Gupta J, Aldowaisan T (1999) A review of scheduling research involving setup consideration. OMEGA 27:219–239
Franca PM et al. (2005) Evolutionary algorithms for scheduling a flowshop manufacturing cell with sequence dependent family setups. Comput Ind Eng 48:491–506
Antami A (1995) A production planning model for flexible manufacturing systems with setup cost consideration. Comput Ind Eng 29:723–727
Jinyan M, Chai S, Youyi W (1995) FMS job shop scheduling using Lagrangian relaxation method. In: Proceedings of the IEEE international conference on robotics and automation, Nagoya, Japan, pp 490–495
Glover F (1990) Tabu search-part II. ORSA J Comput 2:4–32
Pirlot M (1996) General local search methods. Eur J Oper Res 92:493–511
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Saidi-Mehrabad, M., Fattahi, P. Flexible job shop scheduling with tabu search algorithms. Int J Adv Manuf Technol 32, 563–570 (2007). https://doi.org/10.1007/s00170-005-0375-4
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00170-005-0375-4