Skip to main content
SpringerLink
Log in

Tardiness minimization in a flexible job shop: A tabu search approach

  • Published:
Journal of Intelligent Manufacturing Aims and scope Submit manuscript

Abstract

This paper addresses the problem of scheduling jobs in a flexible job shop with the objective of minimizing total tardiness. The flexible job shop differs from the classical job shop in that each of the operations associated with a job can be processed on any of a set of alternative machines. Two heuristics based on tabu search are developed for this problem: a hierarchical procedure and a multiple start procedure. The procedures use dispatching rules to obtain an initial solution and then search for improved solutions in neighborhoods generated by the critical paths of the jobs in a disjunctive graph representation. Diversification strategies are also implemented and tested. The outcomes of extensive computational results are reported.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Aarts, E. H. L., Van Laarhoven, P. J. M., Lenstra, J. K. and Ulder, N. L. J. (1994) A computational study of local search algorithms for job shop scheduling. ORSA Journal on Computing, 6, 118–125.

    Google Scholar 

  • Adams, J., Balas, E. and Zawack, D. (1988) The shifting bottleneck procedure for job shop scheduling. Management Science, 34, 391–401.

    Google Scholar 

  • Anderson, E. J. and Nyirenda, J. C. (1990) Two new rules to minimize tardiness in a job shop. International Journal of Production Research, 28, 2277–2292.

    Google Scholar 

  • Armentano, V. A. and Scrich, C. R. (2000) Tabu search for minimizing total tardiness in a job shop. International Journal of Production Economics, 63, 131–140.

    Google Scholar 

  • Baker, K. R. (1984) Sequencing rules and due-date assignments in a job shop. Management Science, 30, 1093–1104.

    Google Scholar 

  • Baker, K. R. and Kanet, J. J. (1983) Job shop scheduling with modified due dates. Journal of Operations Management, 4, 11–22.

    Google Scholar 

  • Balas, E. (1969) Machine sequencing via disjunctive graphs: An implicit enumeration algorithm. Operations Research, 17, 941–957.

    Google Scholar 

  • Barnes, J. W. and Chambers, J. B. (1995) Solving the job shop scheduling problem with tabu search. IIE Transactions, 27, 257–263.

    Google Scholar 

  • Brandimarte, P. (1993) Routing and scheduling in a flexible job shop by tabu search. Annals of Operations Research, 41, 157–183.

    Google Scholar 

  • Chakrapani, J. and Skorin-Kapov, J. (1993) Massively parallel tabu search for the quadratic assignment problem. Annals of Operations Research, 41, 327–341.

    Google Scholar 

  • Chang, Y. and Sullivan, R. S. (1990) Schedule generation in a dynamic job shop. International Journal of Production Research, 28, 65–74.

    Google Scholar 

  • Chang, Y., Matsuo, H. and Sullivan, R. S. (1989) A bottleneck-based beam search for job scheduling in a flexible manufacturing system. International Journal of Production Research, 27, 1949–1961.

    Google Scholar 

  • Dauzère-Pérès, S. and Paulli, J. (1997) An integrated approach for modeling and solving the general multi-processor job-shop scheduling problem using tabu search. Annals of Operations Research, 70, 281–306.

    Google Scholar 

  • Dell'Amico, M. and Trubian, M. (1993) Applying tabu search to the job-shop scheduling problem. Annals of Operations Research, 41, 231–252.

    Google Scholar 

  • Du, J. and Leung, J. Y.-T. (1990) Minimizing total tardiness on one machine is NP-hard. Mathematics of Operations Research, 15, 483–495.

    Google Scholar 

  • Fleurent, C. and Glover, F. (1999) Improved constructive multistart strategies for the quadratic assignment problem using adaptive memory, INFORMS Journal on Computing, 11, 198–204.

    Google Scholar 

  • Glover, F. (2000) Multi-start and strategic oscillation methods principles to exploit adaptive memory, in Laguna, M. and Velaverde, J. L. G. (eds) Computing Tools for Modeling, Optimization and Simulation, Kluwer Publishers, Boston.

    Google Scholar 

  • Glover, F. and Laguna, M. (1997) Tabu Search, Kluwer Publishers, Boston.

    Google Scholar 

  • He, Z., Yang, T. and Deal, D. E. (1993) A multiple-pass heuristic rule for job shop scheduling with due dates. International Journal of Production Research, 31, 2677–2692.

    Google Scholar 

  • Hoitomt, D. J., Luh, P. B. and Pattipati, K. R. (1993) A practical approach to job-shop scheduling problems. IEEE Transactions on Robotics and Automation, 9, 1–13.

    Google Scholar 

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

    Google Scholar 

  • Hutchison, J., Leong, K., Snyder, D. and Ward, P. (1991) Scheduling approaches for random job shops flexible manufacturing systems. International Journal of Production Research, 29, 1053–1067.

    Google Scholar 

  • Kelly, J. P., Laguna, M. and Glover, F. (1994) A study of diversification strategies for the quadratic assignment problem. Computers and Operations Research, 21, 885–893.

    Google Scholar 

  • Lawler, E. L., Lenstra, J. K., Rinnooy Kan, A. H. G. and Shmoys, D. B. (1993) Sequencing and scheduling: Algorithms and complexity, in S. C. Graves, A. H. G. Rinnoy Kan and P. H. Zipkin (eds) Logistics of Production and Inventory, North Holland.

  • Logendran, R. and Sonthinen, A. (1997) A tabu search-based approach for scheduling job-shop type flexible manufacturing systems. Journal of the Operational Research Society, 48, 264–277.

    Google Scholar 

  • Montazeri, M. and Van Wassenhove, L. N. (1990) Analysis of scheduling rules for an FMS. International Journal of Production Research, 28, 785–802.

    Google Scholar 

  • Nowicki, E. and Smutnicki, C. (1996) A fast taboo search algorithm for the job shop problem. Management Science, 42, 797–813.

    Google Scholar 

  • Paulli, J. (1995) A hierarchical approach for the FMS scheduling problem. European Journal of Operational Research, 86, 32–42.

    Google Scholar 

  • Stecke, K. (1983) Formulation and solution of nonlinear integer production planning problems for flexible manufacturing systems. Management Science, 29, 273–288.

    Google Scholar 

  • Taillard, E. D. (1994) Parallel taboo search techniques for the job shop scheduling problem. ORSA Journal on Computing, 6, 108–117.

    Google Scholar 

  • Van Laarhoven, P. J. M., Aarts, E. H. L. and Lenstra, J. K. (1992) Job shop scheduling by simulated annealing. Operations Research, 40, 113–125.

    Google Scholar 

  • Vepsalainen, A. P. J. and Morton, T. E. (1987) Priority rules for job shops with weighted tardiness costs. Management Science, 33, 1035–1047.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratório Associado de Computação e Matemática Aplicada, Instituto Nacional de Pesquisas Espaciais, C.P. 515 CEP, 12201-970, São José dos Campos SP, Brazil

    Cintia Rigão Scrich

  2. Faculdade de Engenharia Elétrica e de Computação, Universidade Estadual de Campinas, C.P. 6101 CEP, 13083-970, Campinas SP, Brazi

    Vinícius Amaral Armentano

  3. Leeds School of Business, University of Colorado, 419 UCB, Boulder, CO, 80309-0419, USA

    Manuel Laguna

Authors
  1. Cintia Rigão Scrich
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Vinícius Amaral Armentano
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Manuel Laguna
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Vinícius Amaral Armentano.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Scrich, C.R., Armentano, V.A. & Laguna, M. Tardiness minimization in a flexible job shop: A tabu search approach. Journal of Intelligent Manufacturing 15, 103–115 (2004). https://doi.org/10.1023/B:JIMS.0000010078.30713.e9

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/B:JIMS.0000010078.30713.e9

Search

Navigation