Skip to main content
SpringerLink
Log in

Grasp with memory-based mechanisms for minimizing total tardiness in single machine scheduling with setup times

  • Published:
Journal of Heuristics Aims and scope Submit manuscript

Abstract

This paper addresses the problem of scheduling jobs in a single machine with sequence dependent setup times in order to minimize the total tardiness with respect to job due dates. We propose variants of the GRASP metaheuristic that incorporate memory-based mechanisms for solving this problem. There are two mechanisms proposed in the literature that utilize a long-term memory composed of an elite set of high quality and sufficiently distant solutions. The first mechanism consists of extracting attributes from the elite solutions in order to influence the construction of an initial solution. The second one makes use of path relinking to connect a GRASP local minimum with a solution of the elite set, and also to connect solutions from the elite set. Reactive GRASP, which probabilistically determines the degree of randomness in the GRASP construction throughout the iterations, is also investigated. Computational tests for instances involving up to 150 jobs are reported, and the proposed method is compared with heuristic and exact methods from the literature.

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

  • Ahmadi, S. and I.H. Osman. (2005). “Greedy Random Adaptive Memory Programming search for the Capacitated Clustering Problem.” European Journal of Operational Research 162, 30–44.

    Article  MATH  MathSciNet  Google Scholar 

  • Aiex, R.M., M.G.C. Resende, P.M. Pardalos, and G. Toraldo. (2005). “GRASP with Path Relinking for the Three-Index Assignment Problem.” INFORMS Journal on Computing 17, 224–247.

    Google Scholar 

  • Allahverdi, A., J.N.D. Gupta, and T. Aldowaisan. (1999). “A Review of Scheduling Research Involving Setup Considerations,” OMEGA 27, 219–239.

    Article  Google Scholar 

  • Armentano, V.A. and R. Mazzini. (2000). “A Genetic Algorithm for Scheduling on a Single Machine with Setup Times and Due Dates.” Production Planning & Control 11, 713–120.

    Article  Google Scholar 

  • Binato, S., J. Hery, D.M. Loewenstern, and M.G.C. Resende. (2002). “A Greedy Randomized Adaptive Search Procedure for Job Shop Scheduling.” In Ribeiro P. Hansen (ed.), Essays and Surveys on Metaheuristics Essays and Surveys on Metaheuristics C.C., Kluwer, pp. 58–79.

  • Bresina, J.L. (1996). “Heuristic-Biased Stochastic Sampling.” In Proceedings of the AAAI’96 Conference, pp. 271–278.

  • Christofoletti, L.M. (2002). Métodos de Reínicio Aplicados ao Problema de Seqüenciamento em Uma máquina Com Tempos de Preparação e Datas de Entrega, Dissertação de Mestrado, In Portuguese, Faculdade de Engenharia Elétrica e de Computação, Universidade Estadual de Campinas, Brasil.

  • Cirasella, J., D.S., Johnson, L.A. McGeoch, and W. Zhang. (2001). “The Asymmetric Traveling Salesman Problem: Algorithms, Instance Generators, and Tests.” In A.L. Buchsbaum and J. Snoeyink (eds.), ALENEX 2001 Proceedings, Springer Lecture Notes in Computer Science 2153, pp. 32–59.

  • Du, J. and J.Y.T. Leung. (1990). “Minimizing Total Tardiness on one Machine is NP-Hard.” Mathematics of Operations Research 15, 483–495.

    MATH  MathSciNet  Google Scholar 

  • Feo, T. and M. Resende. (1995). “Greedy Randomized Adaptive Search Procedures.” Journal of Global Optimization 2, 1–27.

    Google Scholar 

  • Fernandes, E.R. and C.C. Ribeiro. (2005). “A Multistart Constructive Heuristic for Sequencing by Hybridization Using Adaptive Memory.” Electronic Notes in Discrete Mathematics 19, 41–47.

    Article  MathSciNet  Google Scholar 

  • Festa, P. and M.M.G.C. Resende. (2004). “An Annotated Bibliography of GRASP.” European Journal of Operational Research, submitted.

  • Fleurent, C. and F. Glover. (1999). “Improved Constructive Multistart Strategies for the Quadratic Assignment Problem.” INFORMS Journal on Computing 11, 198–204.

    MATH  MathSciNet  Google Scholar 

  • França, P.M., A. Mendes, and P. Moscato. (2001). “A Memetic Algorithm for the Total Tardiness Single Machine Scheduling Pproblem.” European Journal of Operational Research 132, 224–242.

    Article  MathSciNet  Google Scholar 

  • Gagné, C., W.L. Price, and M. Gravel. (2002). “Comparing an ACO Algorithm With Other Heuristics for the Single Machine Problem with Sequence Dependent Setup Times.” Journal of the Operational Research Society 53, 895–906.

    Article  MATH  Google Scholar 

  • Glover, F. (1996). “Tabu Search and Adaptive Memory Programming—Advances, Applications and Challenges.” In R.S. Barr, R.V. Helgason and J.L. Kennington (eds.), Computing Tools for Modeling, Optimization and Simulation: Interfaces in Computer Science and Operations Research, Kluwer, pp. 1–75.

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

  • Glover, F. (1998). “A Template for Scatter Search and Path Relinking, in Artificial Evolution.” In J.-K. Hao, E. Lutton, E. Ronald, M. Schoenauer and D. Snyers (eds.), Lecture Notes in Computer Science, Springer 1363, pp. 13–54.

  • Glover, F., M. Laguna, and R. Martí. (2000). “Fundamentals of Scatter Search and Path Relinking.” Control and Cybernetics 29, 653–684.

    MATH  MathSciNet  Google Scholar 

  • Laguna, M. and F. Glover. (1993). “Integrating Target Analysis and Tabu Search for Improved Scheduling Systems.” Expert Systems with Applications 6, 287–297.

    Article  Google Scholar 

  • Laguna, M. and R. Martí. (1999). “GRASP with Path Relinking for 2-layer Straight line Crossing Minimization.” INFORMS Journal on Computing 11, 44–52.

    Article  MATH  Google Scholar 

  • Lee, Y.H., K. Bhaskaran, and M. Pinedo. (1997). “A Heuristic to Minimize the Total Weighted Tardiness with Sequence-Dependent Setups.” IIE Transactions 29, 45–52.

    MATH  Google Scholar 

  • Panwalkar, S.S., R.A. Dudek, and M.L. Smith. (1973). “Sequencing Research and the Industrial Scheduling Problem.” In S.E. Elmaghraby (ed.), Symposium on the Theory of Scheduling and Its Applications, Springer, Berlin.

  • Prais, M. and C.C. Ribeiro. (2000). Reactive GRASP: “An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment.” INFORMS Journal on Computing 12, 164–176.

    Article  MATH  MathSciNet  Google Scholar 

  • Ragatz, C.L. (1993). “A Branch-and-bound Method for Minimum Tardiness Sequencing on a Single Processor with Sequence Dependent Setup Times.” In Proceedings: Twenty-fourth Annual Meeting of The Decision Sciences Institute, 1375–1377.

  • Raman, N., R. V. Rachamaduguru, and F.B. Talbot. (1989). “Real Time Scheduling of an Automated Manufacturing Center.” European Journal of Operational Research 40, 222–242.

    Article  MATH  Google Scholar 

  • Resende, M.G.C. and C.C. Ribeiro. (2003a). “Greedy Randomized Adaptive Search Procedures.” In F. Glover and G. Kochenberger (eds.), Handbook of Metaheuristics, Kluwer, 219–249.

  • Resende, M.G.C. and C.C. Ribeiro. (2003b). “A GRASP With Path-relinking for Private Virtual Circuit Routing.” Networks 41, 104–114.

    Article  MathSciNet  MATH  Google Scholar 

  • Resende, M.G.C. and R.F. Werneck. (2004). “A Hybrid Heuristic for the p-median Problem.” Journal of Heuristics 10, 59–88.

    Article  MATH  Google Scholar 

  • Resende, M.G.C. and C.C. Ribeiro. (2005). “GRASP With Path-relinking: Recent Advances and Applications.” In T. Ibaraki, K. Nonobe and M. Yagiura (ed.), Metaheuristics: Progress as Real Problem Solvers, Kluwer.

  • Ribeiro, C.C. and I. Rosseti. (2002). “A Parallel GRASP for the 2-path Network Design Problem.” Lecture Notes in Computer Science, 2004, 922–926.

  • Rubin, P.A. and G.L. Ragatz. (1995). “Scheduling in a Sequence Dependent Setup Environment With Genetic Search.” Computers and Operations Research 22, 85–99.

    Article  MATH  Google Scholar 

  • Tan, K.C. and R. Narasimhan. (1997). “Minimizing Tardiness on a Single Processor with Sequence-Dependent Setup Times: A Simulated Annealing Approach.” OMEGA 25, 619–634.

    Article  Google Scholar 

  • Tan, K.C., R. Narasimhan, P.A. Rubin, and G.L. Ragatz. (2000). “A Comparison of Four Methods for Minimizing Total Tardiness on a Single Processor with Sequence Dependent Setup Times.” OMEGA 28, 313–326.

    Google Scholar 

  • Vepsalainen, A. and T.E. Morton. (1987). “Priority Rules for Jobshops With Weighted Tardiness Costs.” Management Science 33, 1035–1047.

    Google Scholar 

  • Yamashita, D.S., V.A. Armentano, and M. Laguna. (2006). “Scatter Search for Project Scheduling with Resource Availability Cost.” European Journal of Operational Research 169, 623–637.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculdade de Engenharia Elétrica e de, Computação Universidade Estadual de Campinas, Caixa Postal 6101, Campinas, SP, CEP 13083-970, Brazil

    Vinícius Amaral Armentano & Olinto César Bassi de Araujo

Authors
  1. Vinícius Amaral Armentano
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Olinto César Bassi de Araujo
    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

Armentano, V.A., Araujo, O.C.B.d. Grasp with memory-based mechanisms for minimizing total tardiness in single machine scheduling with setup times. J Heuristics 12, 427–446 (2006). https://doi.org/10.1007/s10732-006-6662-x

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10732-006-6662-x

Keywords

Search

Navigation