A composite heuristic for the single machine early/tardy job scheduling problem

Computers and Operations Research

Volumn 25, Issue 7-8, 1998, Pages 625-635

  Almeida, Maria Teresa ^a   Centeno, Mario ^a  

^a UNIVERSITY OF LISBON   (Portugal)

Author keywords

Job scheduling; Simulated annealing; Tabu search

Indexed keywords

COMPUTATIONAL COMPLEXITY; HEURISTIC METHODS; PROBLEM SOLVING; PROCESS CONTROL; RANDOM NUMBER GENERATION; SCHEDULING; SIMULATED ANNEALING;

SINGLE MACHINE EARLY/TARDY JOB SCHEDULING PROBLEM (SMETP); TABU SEARCH METHOD;

JUST IN TIME PRODUCTION;

EID: 0032114780     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0305-0548(97)00097-X     Document Type: Article

References (32)

1. Adenso-Diaz, B., An SA/Ts mixture algorithm for the scheduling tardiness problem. European Journal of Operational Research, 1996, 88, 516-524.
2. Abdul-Razaq, T. S. and Potts, C. N., Dynamic programming state-space relaxation for single-machine scheduling. Journal of the Operational Research Society, 1988, 39, 141-152.
3. Baker, K. R. and Scudder, G. D., Sequencing with earliness and tardiness penalties: A review. Operations Research, 1990, 38, 22-36.
4. Centeno, M., Métodos Heurísticos para o Problema de Escalonamento de Tarefas numa Máquina com Custos de Antecipação e Atraso, M.Sc. Dissertation, Instituto Superior de Economia e Gestão-Universidade Técnica de Lisboa, Lisboa, 1993.
5. Centeno, M. and Almeida, M. T., Soluções Aproximadas para um Problema de Escalonamento numa Máquina: Algoritmos construtivos. Working-Paper CEMAPRE 2/94, Instituto Superior de Economia e Gestão-Universidade Técnica de Lisboa, 1994.
6. Chand, S. and Chhajed, D., A single machine model for determination of optimal due dates and sequence. Operations Research, 1992, 40, 596-602.
7. Davis, J. S. and Kanet, J. J., Single machine scheduling with early and tardy completion costs. Working-Paper, Clemson University, 1988.
8. French, S., Sequencing and scheduling, an introduction to the mathematics of the job-shop, Ellis Horwood, 1990.
9. Garey, M. R., Tarjan, R. E. and Wilfong, G. T., One-processor scheduling with symmetric earliness and tardiness penalties. Mathematics of Operations Research, 1988, 13, 330-348.
10. Glover, F., Tabu search - Part I. ORSA Journal on Computing, 1989, 1, 190-206.
11. Glover, F., Tabu search - Part II. ORSA Journal on Computing, 1990, 2, 4-32.
12. Glover, F., Taillard, E. and de Werra, D., A users guide to tabu search. Annals of Operations Research, 1993, 41, 3-28.
13. Glover, F. and Laguna, M., Tabu search. In Modern Heuristic Techniques for Combinatorial Problems, ed. C. Reeves, Blackwell Scientific Publications, 1993.
14. Glover, F., Laguna, M., Taillard, E. and de Werra, D. (eds.), Tabu search, Annals of Operations Research 41, J. C. Baltzer AG, 1993.
15. Hall, N. G., Kubiak, W. and Sethi, S. P., Earliness-tardiness scheduling problems, II: Deviation of completion times about a restrictive common due date. Operations Research, 1991, 39, 847-856.
16. Hall, N. G. and Posner, M. E., Earliness-tardiness scheduling problems, I: Weighted deviation of completion times about a common due date. Operations Research, 1991, 39, 836-846.
17. Johnson, D. S., Aragon, C. R., McGeoch, L. A. and Schevon, C., Optimization by simulated annealing: An experimental evaluation; part I graph partitioning. Operations Research, 1989, 37, 865-892.
18. Johnson, D. S., Aragon, C. R., McGeoch, L. A. and Schevon, C., Optimization by simulated annealing: An experimental evaluation; part II graph coloring and number partitioning. Operations Research, 1991, 39, 378-406.
19. Kahlbacher, H. G., Scheduling with monotonous earliness and tardiness penalties. European Journal of Operational Research, 1993, 64, 258-277.
20. Kirkpatrick, S., Gelatt, C. D., Jr. and Vecchi., M., Optimization by simulated annealing. Science, 1983, 220, 671-680.
21. Lakshminarayan, S., Lakshmanan, R., Papineau, R. L. and Rochette, R., Optimal single-machine scheduling with earliness and tardiness penalties. Operations Research, 1978, 26, 1079-1082.
22. Lawler, E. L., Lenstra, J. K., Rinnooy Kan, A. H. G. and Shmoys, D. B., Sequencing and scheduling: Algorithms and complexity. In Logistics of Production and Inventory, Handbooks in Operations Research and Management Science 4, North-Holland, 1993.
23. Lin, S., Computer solutions of the traveling salesman problem. Bell System Tech. J., 1965, 44, 2245-2269.
24. Mittenthal, J., Raghavachari, M. and Rana, A. I., A hybrid simulated annealing approach for single machine scheduling problems with non-regular penalty functions. Computers and Operations Research, 1993, 20, 103-111.
25. Morton, T. E. and Pentico, D. W., Heuristic Scheduling Systems with Applications to Production Systems and Project Management, John Wiley and Sons, 1993.
26. max flowshop problem. Computers and Operations Research, 1990, 17, 243-253.
27. Ow, P. S. and Morton, T., The single machine early/tardy problem. Management Science, 1989, 35, 177-191.
28. Quaddus, M. A., A generalized model of optimal due date assignment by linear programming. Journal of the Operational Research Society, 1987, 38, 353-359.
29. Reeves, C. (ed.), Modern Heuristic Techniques for Combinatorial Problems, Blackwell Scientific Publications, 1993.
30. Sidney, J., Optimal single machine scheduling with earliness and tardiness penalties. Operations Research, 1977, 25, 62-69.
31. Sousa, J. P. and Wolsey, L. A., A time indexed formulation of non-preemptive single machine scheduling problems. Mathematical Programming, 1992, 54, 353-367.
32. Van Laarhoven, P., Aarts, E. and Lenstra, J., Job scheduling by simulated annealing. Operations Research, 1992, 40, 113-125.