Local Search Heuristics for the Single Machine Total Weighted Tardiness Scheduling Problem

Published Online:https://doi.org/10.1287/ijoc.10.3.341

References

  • Abdul-Razaq T. S., Potts C. N., Van Wassenhove L. N. A Survey of Algorithms for the Single Machine Total Weighted Tardiness Scheduling Problem. Discrete Applied Mathematics (1990) 26:235–253CrossrefGoogle Scholar
  • Della Croce F., Tadei R., Volta G. A Genetic Algorithm for the Job Shop Problem. Computers & Operations Research (1995) 22:15–24CrossrefGoogle Scholar
  • Dueck G., Scheuer T. Threshold Accepting: a General Purpose Optimization Algorithm Appearing Superior to Simulated Annealing. Journal of Computational Physics (1990) 90:161–175CrossrefGoogle Scholar
  • Eglese R. W. Simulated Annealing: a Tool for Operational Research. European Journal of Operational Research (1990) 46:271–281CrossrefGoogle Scholar
  • Glover F. Tabu Search—Part I. ORSA Journal on Computing (1989) 1:190–206LinkGoogle Scholar
  • Glover F. Tabu Search: A Tutorial. Interfaces (1990) 20:74–94LinkGoogle Scholar
  • Goldberg D. E.Genetic Algorithms in Search, Optimization and Machine Learning (1989) (Addison-Wesley, Reading, MA) Google Scholar
  • Lawler E. L. A “Pseudopolynomial” Algorithm for Sequencing Jobs To Minimize Total Tardiness. Annals of Discrete Mathematics (1977) 1:331–342CrossrefGoogle Scholar
  • Lenstra J. K., Rinnooy Kan A. H. G., Brucker P. Complexity of machine scheduling problems. Annals of Discrete Mathematics (1977) 1:343–362CrossrefGoogle Scholar
  • Morton T. E., Pentico D. W.Heuristic Scheduling Algorithms (1993) (Wiley, NY) Google Scholar
  • Morton T. E., Rachamadugu R. M., Vepsalainen A. Accurate myopic heuristics for tardiness scheduling. (1984) . GSIA Working paper no. 36-83-84, Carnegie-Mellon University, PAGoogle Scholar
  • Pirlot M. General Local Search Heuristics in Combinatorial Optimization: A Tutorial. Belgian Journal of Operations Research, Statistics and Computer Science (1992) 32:8–67Google Scholar
  • Potts C. N., Van Wassenhove L. N. A Branch And Bound Algorithm for the Total Weighted Tardiness Problem. Operations Research (1985) 33:363–377LinkGoogle Scholar
  • Potts C. N., Van Wassenhove L. N. Single Machine Tardiness Sequencing Heuristics. IIE Transactions (1991) 23:346–354CrossrefGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.