Abstract
Simulated annealing (SA), genetic algorithms (GA), and tabu search (TS) are the three well known meta-heuristics for combinatorial optimization problems. In this paper, single-machine total weighted tardiness problems with sequence-dependent setup times are solved by SA, GA, and TS approaches. A random swap and insertion search is applied in SA, and a mutation operator performed by a greedy local search is used in a GA. Similarly, a swap and an insertion tabu list are adopted in TS. To verify these proposed approaches, computational experiments were conducted on benchmark problem sets. The experimental results show that these approaches find new upper bound values for most benchmark problems within reasonable computational expenses.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Panwalkar SS, Dudek RA, Smith ML (1973) Sequencing research and the industrial scheduling problem. In: Elmaghraby SE (ed) Proceedings of the Symposium on the Theory of Scheduling and its Applications, Rayleigh, North Carolina, 1972. Springer
Potts CN, van Wassenhove LN (1991) Single machine tardiness sequencing heuristics. IIE Trans 23(4):346–354
Potts CN, van Wassenhove LN (1987) Dynamic programming and decomposition approaches for the single machine total tardiness problem. Eur J Oper Res 32:405–414
Tan KC, Narasimhan R, Rubin PA, Ragatz GL (2000) A comparison of four methods for minimizing total tardiness on a single processor with sequence dependent setup times. Omega 28(3):313–326
Lockett AG, Muhelmann AP (1972) Technical notes: a scheduling problem involving sequence dependent changeover times. Oper Res 20(4):895–902
Wortman DB (1992) Managing capacity: getting the most from your company’s assets. Ind Eng 24:47–49
White CH, Wilson RC (1977) Sequence dependent set-up times and job sequencing. Int J Prod Res 15(2):191–202
Allahverdi A, Gupta JND, Aldowaisan T (1999) A review of scheduling research involving setup considerations. Omega 27(2):219–239
Emmons H (1969) One machine sequencing to minimize certain functions of job tardiness. Oper Res 17(4):701–715
Lawler EL (1977) A ‘pseudopolynomial’ algorithm for sequencing jobs to minimize total tardiness. Ann Discrete Math 1:331–342
Du J, Leung JY (1990) Minimizing total tardiness on one machine is NP-hard. Math Oper Res 15(3):483–494
Abdul-Razaq TS, Potts CN, van Wassenhove LN (1990) A survey of algorithms for the single machine total weighted tardiness scheduling problems. Discrete Appl Math 26:235–253
Potts CN, van Wassenhove LN (1985) A branch and bound algorithm for the total weighted tardiness problem. Oper Res 33(2):363–377
Vepsalainen APJ, Morton TE (1987) Priority rules for job shops with weighted tardiness cost. Manage Sci 33(8):1035–1047
Lee YH, Bhaskaran K, Pinedo M (1997) A heuristic to minimize the total weighted tardiness with sequence-dependent setups. IIE Trans 29(1):45–52
Holsenback JE, Russell RM, Markland RE, Philipoom PR (1999) An improved heuristic for the single-machine, weighted-tardiness problem. Omega 27(4):485–495
Feo TA, Sarathy K, McGahan J (1996) A grasp for single machine scheduling with sequence dependent setup costs and linear delay penalties. Comput Oper Res 23(9):881–895
Glover F, Greenberg HJ (1989) New approaches for heuristic search: a bilateral linkage with artificial intelligence. Eur J Oper Res 39(1):119–130
Rubin PA, Ragatz GL (1995) Scheduling in a sequence dependent setup environment with genetic search. Comput Oper Res 22(1):85–99
Tan KC, Narasimhan R (1997) Minimizing tardiness on a single processor with sequence-dependent setup times: a simulated annealing approach. Omega 25(6):619–634
Armentano VA, Mazzini R (2000) A genetic algorithm for scheduling on a single machine set-up times and due dates. Prod Plan Control 11(7):713–720
Franca PM, Mendes A, Moscato P (2001) A memetic algorithm for the total tardiness single machine scheduling problem. Eur J Oper Res 132(1):224–242
Sun X, Noble JS, Klein CM (1999) Single-machine scheduling with sequence dependent setup to minimize total weighted squared tardiness. IIE Trans 31(2):113–124
Gagné C, Price WL, Gravel M (2002) Comparing an ACO algorithm with other heuristics for the single machine scheduling problem with sequence-dependent setup times. J Oper Res Soc 53(8):895–906
Cicirello VA, Smith SF (2005) Enhancing stochastic search performance by value-based randomization of heuristics. J Heuristics 11:5–34
Metropolis N, Rosenbluth AW, Rosenbluth MN, Teller AH, Teller E (1953) Equations of state calculations by fast computing machines. J Chem Phys 21(6):1087–1092
Kirkpatrick S., Gelatt CD Jr, Vecchi MP (1983) Optimization by simulated annealing. Science 220(4598):671–680
Holland JH (1975) Adaptation in natural and artificial systems. University of Michigan Press, Ann Arbor, Michigan
Goldberg DE (1989) Genetic algorithms in search, optimization, and machine learning. Addison-Wesley, Reading, Massachusetts
Davis L (1985) Applying adaptive algorithms to epistatic domains. In: Proceedings of the 9th International Joint Conference on Artificial Intelligence (IJCAI’85), Los Angeles, California, August 1985, pp 162–164
Glover F (1989) Tabu search—part I. ORSA J Comput 1(3):190–206
Glover F (1989) Tabu search—part II. ORSA J Comput 2(1):4–32
Glover F, Laguna M (1997) Tabu search. Kluwer, Dordrecht, The Netherlands
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Lin, SW., Ying, KC. Solving single-machine total weighted tardiness problems with sequence-dependent setup times by meta-heuristics. Int J Adv Manuf Technol 34, 1183–1190 (2007). https://doi.org/10.1007/s00170-006-0693-1
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00170-006-0693-1