Abstract
In this paper, a new controlled search simulated annealing method is developed for addressing the single machine weighted tardiness problem. The proposed method is experimentally shown to solve optimally 99% of fifteen job problems with less than 0.2 CPU seconds, and to solve one hundred job problems as accurately as any existing methods, but with far less computational effort. This superior performance is achieved by using controlled search strategies that employ a good initial solution, a small neighborhood for local search, and acceptance probabilities of inferior solutions that are independent of the change in the objective function value.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
E.H.L. Aarts and P.J.M. van Laarhoven, Statistical cooling: a general approach to combinatorial optimization problems, Philips J. Res. 40 (1985) 193–226.
S. Anily and A. Federgruen, Simulated annealing methods with general acceptance probabilities, J. Applied Probability 24 (1987) 657–667.
S. Anily and A. Federgruen, Ergodicity in parametric non-stationary Markov chains: an application to simulated annealing methods, Operations Research 35 (1987) 867–874.
K.R. Baker and J.B. Martin, An experimental comparison of solution algorithms for the single machine tardiness problem, Naval Research Logistics Quarterly 21 (1974) 187–199.
I.O. Bohachevsky, M.E. Johnson and M.L. Stein, Generalized simulated annealing for function optimization, Technometrics 28 (1986) 209–217.
D.C. Carroll, Heuristic sequencing of single and multiple components, Ph.D. Dissertation, Massachusetts Institute of Technology, MA, 1965.
V. Cerny, Thermodynamical approach to the travelling salesman problem: an efficient simulation algorithm, Journal of Optimization Theory and Applications 45 (1985) 41–51.
S.E. Elmaghraby, The one-machine sequencing problem with delay costs, Journal of Industrial Engineering 19 (1968) 105–108.
H. Emmons, One-machine sequencing to minimize certain functions of job tardiness, Operations Research 17 (1969) 701–705.
M.L. Fisher, A dual algorithm for the one-machine scheduling problem, Mathematical Programming 11 (1976) 229–252.
S.B. Gelfand and S.K. Mitter, Analysis of simulated annealing for optimization,Proc. 24th Conf. on Decision and Control, Ft. Lauderdale, December 1985, 779–786.
S. Geman and D. Geman, Stochastic relaxation, Gibbs Distributions, and the Bayesian restoration of images, IEEE Proc. Pattern Analysis and Machine Intelligence 6 (1984) 721–741.
B. Gidas, Nonstationary Markov chains and convergence of the annealing algorithm, Journal of Statistical Physics 39 (1985) 73–131.
J.W. Greene and K.J. Supowit, Simulated annealing without rejected moves, IEEE Trans. on Computer-Aided Design, CAD-5 (1986) 221–228.
B. Hajek, Cooling schedules for optimal annealing, Mathematics of Operations Research 13 (1988) 311–329.
S. Kirkpatrick, C.D. Gelatt, Jr. and M.P. Vecchi, Optimization by simulated annealing, Science 220 (1983) 671–680.
E.L. Lawler, A pseudopolynomial algorithm for sequencing jobs to minimize total tardiness, Annals of Discrete Mathematics 1 (1977) 331–342.
J.K. Lenstra, A.H.G. Rinnooy Kan and P. Brucker, Complexity of machine scheduling problem, Annals of Disrete Mathematics 1 (1977) 343–362.
H. Matsuo and G. Tang, Worst case and empirical analysis of local search heuristics for the one-machine total tardiness problem, Graduate School of Business, University of Texas at Austin, Preprint, 1986.
N. Metropolis, A. Rosenbluth, M. Rosenbluth, A. Teller and E. Teller, Equation of state calculations by fast computing machines, Journal of Chemical Physics 21 (1953) 1087–1092.
D. Mitra, F. Romeo and A.L. Sangiovanni-Vincentelli, Convergence and finite-time behavior of simulated annealing, Adv. Appl. Prob. 18 (1986) 747–771.
E.R. Montague, Jr., Sequencing with time delay costs, Arizona State University Industrial Engineering Research Bulletin (January 1969) 20–31.
T.E. Morton, R.M. Rachamadugu and A.P.J. Vepsalainen, Accurate myopic heuristics for tardiness scheduling, GSIA Working Paper #36-83-84, Carnegie-Mellon University, PA, 1984.
J.C. Picard and M. Queyranne, The time-dependent traveling salesman problem and applications to the tardiness problem in one-machine scheduling, Operations Research 26 (1978) 86–110.
C.N. Potts and L.N. Van Wassenhove, A decomposition algorithm for the single machine total tardiness problem, Operations Research Letters 1 (1982) 177–181.
C.N. Potts and L.N. Van Wassenhove, A branch and bound algorithm for the total weighted tardiness problem, Operations Research 33 (1985) 363–377.
A.H.G. Rinnooy Kan, B.J. Lageweg and J.K. Lenstra, Minimizing total costs in one-machine scheduling, Operations Research 23 (1975) 908–927.
A. Schild and I.J. Fredman, On scheduling tasks with associated linear loss functions, Management Science 7 (1961) 280–285.
L. Schrage and K.R. Baker, Dynamic programming solution of sequencing problem with precedence constraints, Operations Research 26 (1978) 444–449.
J. Shwimer, On theN-job, one-machine sequence-independent scheduling problem with tardiness penalties: a branch and bound solution, Management Science 18 (1972) B301-B313.
P.J.M. Van Laarhoven and E.H.L. Aarts,Simulated Annealing: Theory and Applications (D. Reidel, Dordrecht, 1987).
L.J. Wilkerson and J.D. Irwin, An improved algorithm for scheduling independent tasks, AIIE Transactions 3 (1971) 239–245.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Matsuo, H., Juck SUH, C. & Sullivan, R.S. A controlled search simulated annealing method for the single machine weighted tardiness problem. Ann Oper Res 21, 85–108 (1989). https://doi.org/10.1007/BF02022094
Issue Date:
DOI: https://doi.org/10.1007/BF02022094