Advertisement

Journal of Intelligent Manufacturing

, Volume 11, Issue 5, pp 453–460 | Cite as

Tabu search for scheduling on identical parallel machines to minimize mean tardiness

  • Vinı´cius A. Armentano
  • Denise S. Yamashita
Article

Abstract

This paper presents a tabu search approach for scheduling jobs on identical parallel machines with the objective of minimizing the mean tardiness. Initially, we consider a basic tabu search that uses short term memory only. Local search is performed on a neighborhood defined by two types of moves. Insert moves consist of transferring each job from one machine to another and swap moves are those obtained by exchanging each pair of jobs between two machines. Next, we analyze the incorporation of two diversification strategies with the aim of exploring unvisited regions of the solution space. The first strategy uses long term memory to store the frequency of the moves executed throughout the search and the second makes use of influential moves. Computational tests are performed on problems with up to 10 machines and 150 jobs. The heuristic performance is evaluated through a lower bound given by Lagrangean relaxation. A comparison is also made with respect to the best constructive heuristic reported in the literature.

Scheduling parallel machines due date tardiness heuristic tabu search 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alidaee, B. and Gopalan, S. (1997) A note on the equivalence of two heuristics to minimize total tardiness. European Journal of Operational Research, 96, 514-517.Google Scholar
  2. Baker, K. R. and Bertrand, J. W. M. (1982) A dynamic priority rule for scheduling against due-dates. Journal of Operations Management, 3, 37-42.Google Scholar
  3. Barnes, J. W. and Brennan, J. J. (1977) An improved algorithm for scheduling jobs on identical machines. AIIE Transactions, 9, 25-31.Google Scholar
  4. Barnes, J. W. and Laguna, M. (1993) Solving the multiplemachine weighted flow time using tabu search. IIE Transactions, 25, 121-128.Google Scholar
  5. Dogramaci, A. and Surkis, J. (1979) Evaluation of a heuristic for scheduling independent jobs on parallel identical processors. Management Science, 25, 1208-1216.Google Scholar
  6. Dogramaci, A. (1984) Production scheduling of independent jobs on parallel identical processors. International Journal of Production Research, 22, 535-548.Google Scholar
  7. Elmaghraby, S. E. and Park, S. H. (1974) Scheduling jobs on a number of identical machines. AIIE Transactions, 6, 1-13.Google Scholar
  8. Francëa, P. M., Gendreau, M., Laporte, G. and Muèller, F. M. (1995) The m-traveling salesman problem with minimax objective. Transportation Science, 29, 267-275.Google Scholar
  9. Glover, F. (1989) Tabu Search: Part I. ORSA Journal on Computing, 1, 190-206.Google Scholar
  10. Glover, F. (1990) Tabu Search: Part II, ORSA Journal on Computing, 2, 4-32.Google Scholar
  11. Glover, F. and Laguna, M. (1997) Tabu Search, Kluwer Publishers, Boston.Google Scholar
  12. Guinet, A. (1995) Scheduling independent jobs on uniform parallel machines to minimize tardiness criteria. Journal of Intelligent Manufacturing, 6, 95-103.Google Scholar
  13. Ho, C. J. and Chang, Y. L. (1991) Heuristics for minimizing mean tardiness for m parallel machines. Naval Research Logistics, 38, 367-381.Google Scholar
  14. Huèbscher, R. and Glover, F. (1994) Applying tabu search with influential diversification to multiprocessor scheduling. Computers and Operations Research, 21, 877-884.Google Scholar
  15. Koulamas, C. P. (1994) The total tardiness problem: review and extensions. Operations Research, 42, 1025-1041.Google Scholar
  16. Laguna, M. and Velaverde, J. L. G. (1991) A search heuristic for just-in-time scheduling in parallel machines. Journal of Intelligent Manufacturing, 2, 253-260.Google Scholar
  17. Lawler, E. L. (1964) On scheduling problems with deferral costs. Management Science, 11, 280-288.Google Scholar
  18. Luh, P. B., Hoitomt, D. J., Max, E. and Pattiti, K. R. (1990) Schedule generation and reconfiguration for parallel machines. IEEE Transactions on Robotics and Automation, 6, 687-696.Google Scholar
  19. Panwalkar, S. S., Smith, M. L. and Koulamas, C. P. (1993) A heuristic for the single machine tardiness problem. European Journal of Operational Research, 70, 304-310.Google Scholar
  20. Potts, C. N. and Van Wassenhove, L. N. (1982) A decomposition algorithm for the single machine total tardiness problem. Operations Research Letters, 5, 177-181.Google Scholar
  21. Root, J. G. (1965) Scheduling with deadlines and loss functions on k parallel machines. Management Science, 11, 460-475.Google Scholar
  22. Wilkerson, L. J. and Irwin, J. D. (1970) An improved algorithm for scheduling independent tasks, Technical Report AU-T-15, Digital Systems Laboratory, Auburn University, Auburn, Alabama, in Baker, K. R. (1973) Procedures for sequencing tasks with one resource type. International Journal of Production Research, 11, 125-138.Google Scholar

Copyright information

© Kluwer Academic Publishers 2000

Authors and Affiliations

  • Vinı´cius A. Armentano
    • 1
  • Denise S. Yamashita
    • 1
  1. 1.Faculdade de Engenharia Ele´trica e de Computa¸a~oUniversidade Estadual de CampinasCampinas – SPBrazil

Personalised recommendations