A grasp for single machine scheduling with sequence dependent setup costs and linear delay penalties

Computers and Operations Research

Volumn 23, Issue 9, 1996, Pages 881-895

  Feo, Thomas A ^a   Sarathy, Kishore ^a   McGahan, John ^a  

^a The University of Texas at Austin   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COSTS; DYNAMIC PROGRAMMING; HEURISTIC METHODS; MACHINERY; OPTIMIZATION; PERFORMANCE;

GREEDY RANDOMIZED ADAPTIVE SEARCH PROCEDURE; LINEAR DELAY PENALTIES; SEQUENCE DEPENDENT SETUP COSTS; SINGLE MACHINE SCHEDULING;

SCHEDULING;

EID: 0030242341     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/0305-0548(95)00084-4     Document Type: Article

References (17)

1. J. W. Barnes and L. K. Vanston, Scheduling jobs with linear delay penalties and sequence dependent setup costs. Ops Res. 29, 146-160 (1981).
2. T. L. Morin and R. F. Marsten, Branch and bound strategies for dynamic programming. Ops Res. 24 (1976).
3. M. Laguna, J. W. Barnes, and F. W. Glover, Tabu search methods for a single machine scheduling program. J. Intelligent Manufac. 2, 63-74 (1991).
4. M. Laguna and F. W. Glover, Integrating target analysis and tabu search for improved scheduling systems. Expert Sys. Appl. 6, 287-297 (1993).
5. Fred Glover, Tabu search - part i. ORSA J. Computing 1, 190-206 (1989).
6. Fred Glover, Tabu search - part ii. ORSA J. Computing 2, 4-32 (1990).
7. Fred Glover, Tabu search: a tutorial. Interfaces 20, 74-94 (1990).
8. T. A. Feo, M. G. C. Resende, and S. H. Smith, A greedy randomized adaptive search procedure for maximum independent set. Technical report, Graduate Program in Operations Research, Department of Mechanical Engineering, University of Texas at Austin, (1990).
9. J. G. Klincewicz, Avoiding local optima in the p-hub location problem using tabu search and grasp. Technical report, AT&T Bell laboratories, Holmdel, New Jersey, (1989).
10. S. H. Smith and T. A. Feo, A grasp for coloring graphs. Technical report, Graduate Program in Operations Research, Department of Mechanical Engineering, University of Texas at Austin (1990).
11. M. Laguna and J. L. G. Velarde, A search heuristic for just-in-time scheduling in parallel machines. Technical report, University of Colorado, Boulder (1991).
12. J. F. Bard and T. A. Feo, An algorithm for the manufacturing equipment selection problem. IIE Transcations 23 (1989).
13. J. F. Bard and T. A. Feo, Operations sequencing in discrete parts manufacturing. Mmgt Sci. 35, 249-255 (1989).
14. T. A. Feo and J. F. Bard, Flight scheduling and maintenance base planning. Mmgt Sci. 35, 1415-1432 (1989).
15. T. A. Feo and M. G. C. Resende, A Probabilistic heuristic for a computationally difficult set covering problem. Ops Res. Lett. 8, 67-71 (1989).
16. T. A. Feo and J. L. G. Velarde, The internodal trailer assignment problem: models, algorithms, and heuristics. Technical report, Graduate Program in Operations Research, Department of Mechanical Engineering, University of Texas at Austin (1990).
17. M. Laguna, J. W. Barnes, and F. W. Glover, Scheduling jobs with linear delay penalties and sequence dependent setup costs using tabu search. Technical report, Graduate Program in Operations Research, Department of Mechanical Engineering, University of Texas at Austin (1989).