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

Journal of Heuristics

Volumn 12, Issue 6, 2006, Pages 427-446

  Armentano, Vinícius Amaral ^a   De Araujo, Olinto César Bassi ^a  

^a UNIVERSITY OF CAMPINAS   (Brazil)

Author keywords

Greedy randomized adaptive search procedures; Memory mechanisms; Setup times; Single machine scheduling; Tardiness

Indexed keywords

HEURISTIC METHODS; MACHINE DESIGN; OPERATIONS RESEARCH; PROBABILITY; PROBLEM SOLVING; RANDOM PROCESSES;

GREEDY RANDOMIZED ADAPTIVE SEARCH PROCEDURES; MEMORY MECHANISMS; SETUP TIMES; SINGLE MACHINE SCHEDULING; TARDINESS;

COMPUTATIONAL METHODS;

EID: 33750372737     PISSN: 13811231     EISSN: 15729397     Source Type: Journal    
DOI: 10.1007/s10732-006-6662-x     Document Type: Article

References (36)

1. 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.
2. 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.
3. Allahverdi, A., J.N.D. Gupta, and T. Aldowaisan. (1999). "A Review of Scheduling Research Involving Setup Considerations," OMEGA 27, 219-239.
4. 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.
5. 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.
6. Bresina, J.L. (1996). "Heuristic-Biased Stochastic Sampling." In Proceedings of the AAAI'96 Conference, pp. 271-278.
7. 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.
8. 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.
9. Du, J. and J.Y.T. Leung. (1990). "Minimizing Total Tardiness on one Machine is NP-Hard." Mathematics of Operations Research 15, 483-495.
10. Feo, T. and M. Resende. (1995). "Greedy Randomized Adaptive Search Procedures." Journal of Global Optimization 2, 1-27.
11. 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.
12. Festa, P. and M.M.G.C. Resende. (2004). "An Annotated Bibliography of GRASP." European Journal of Operational Research, submitted.
13. Fleurent, C. and F. Glover. (1999). "Improved Constructive Multistart Strategies for the Quadratic Assignment Problem." INFORMS Journal on Computing 11, 198-204.
14. 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.
15. 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.
16. 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.
17. Glover, F. and M. Laguna. (1997). Tabu Search, Kluwer.
18. 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.
19. Glover, F., M. Laguna, and R. Martí. (2000). "Fundamentals of Scatter Search and Path Relinking." Control and Cybernetics 29, 653-684.
20. Laguna, M. and F. Glover. (1993). "Integrating Target Analysis and Tabu Search for Improved Scheduling Systems." Expert Systems with Applications 6, 287-297.
21. Laguna, M. and R. Martí. (1999). "GRASP with Path Relinking for 2-layer Straight line Crossing Minimization." INFORMS Journal on Computing 11, 44-52.
22. Lee, Y.H., K. Bhaskaran, and M. Pinedo. (1997). "A Heuristic to Minimize the Total Weighted Tardiness with Sequence-Dependent Setups." HE Transactions 29, 45-52.
23. 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.
24. 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.
25. 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.
26. 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.
27. 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.
28. Resende, M.G.C. and C.C. Ribeiro. (2003b). "A GRASP With Path-relinking for Private Virtual Circuit Routing." Networks 41, 104-114.
29. Resende, M.G.C. and R.F. Werneck. (2004). "A Hybrid Heuristic for the p-median Problem." Journal of Heuristics 10, 59-88.
30. 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.
31. 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.
32. 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.
33. 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.
34. 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.
35. Vepsalainen, A. and T.E. Morton. (1987). "Priority Rules for Jobshops With Weighted Tardiness Costs." Management Science 33, 1035-1047.
36. 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.