A heuristic to minimize the total weighted tardiness with sequence-dependent setups

Lee, Young Ho; Bhaskaran, Kumar; Pinedo, Michael

doi:10.1080/07408179708966311

Cited by 225 publications

(125 citation statements)

References 14 publications

Supporting

Mentioning

116

Contrasting

Unclassified

Order By: Relevance

“…For a review of the literature on such scheduling problems and for a comparison of leading heuristics, see Koulamas (1994) and Russell and Holsenback (1997). Scheduling subject to sequence-dependent setup times is considered in Lee et al (1997) and Lee and Pinedo (1997). Complexity results for machine scheduling problems can be found in Lawler et al (1990).…”

Section: Order Sequencing and Run Formationmentioning

confidence: 99%

Scheduling Solutions for the Paper Industry

Keskinocak

Wu²,

Goodwin³

et al. 2002

Operations Research

View full text Add to dashboard Cite

This paper describes a decision support system for paper production scheduling. This is the first system to provide an integrated solution to paper production scheduling and to consider interactions between different stages of the manufacturing and distribution process. Using a multicriteria optimization approach, the system generates multiple enterprisewide schedules to reveal tradeoffs between the multiple, often competing, objectives. The large portfolio of algorithms used by the system is embedded in an agent-based decision support framework, called Asynchronous Team (A-Team). Successful implementations of the system in several paper mills in North America have resulted in significant savings and improved customer satisfaction.

show abstract

Section: Order Sequencing and Run Formationmentioning

confidence: 99%

Scheduling Solutions for the Paper Industry

Keskinocak

Wu²,

Goodwin³

et al. 2002

Operations Research

View full text Add to dashboard Cite

show abstract

“…Lee and Kim (1995) presented a parallel GA to solve the earliness tardiness job scheduling problem with general penalty weights. Lee et al (1997) proposed a constructive heuristics for the SMTWT scheduling problems with sequence dependent setup times. James (1997) developed a TS algorithm for solving the common due date early/tardy machine scheduling problem.…”

Section: Introductionmentioning

confidence: 99%

A hybrid cuckoo search metaheuristic algorithm for solving single machine total weighted tardiness scheduling problems with sequence dependent setup times

Marichelvam¹,

Mani²

2016

IJCCIA

View full text Add to dashboard Cite

Abstract:In this paper, we present a hybrid algorithm based on cuckoo search algorithm to solve the single machine total weighted tardiness (SMTWT) scheduling problems with sequence dependent setup times which have been proved to be strongly NP-hard. Three different dispatching rules are incorporated with the initial random solutions of the cuckoo search (CS) algorithm to improve the solution quality. Computational results show that the proposed algorithm is very competitive to many metaheuristic algorithms in the literature.Keywords: metaheuristics; cuckoo search; total weighted tardiness; NP-hard; scheduling.Reference to this paper should be made as follows: Marichelvam, M.K. and Geetha, M. (2016) 'A hybrid cuckoo search metaheuristic algorithm for solving single machine total weighted tardiness scheduling problems with sequence dependent setup times', Int.

show abstract

“…If the time needed for adjusting depends on the previous and the following job, this is referred to as sequence dependent setup time and must be defined for every possible combination of two jobs [11] [12]. This condition further increases the problem complexity for some scheduling criteria.…”

Section: Problem Statementmentioning

confidence: 99%

“…A distinct setup time, which does not depend of the speed of the machine, is defined for every possible sequence of two jobs. The values of all of the above parameters are generated in accordance with methods and examples given in [4], [11], [12] and [13]. Overall, we defined 120 test cases for learning and 600 evaluation test cases for comparison of the evolved and existing scheduling heuristics.…”

Section: Test Cases Formulationmentioning

confidence: 99%

“…In this work, we included the following widely used scheduling heuristics for efficiency comparison: weighted shortest processing time (WSPT), earliest due date (EDD), longest processing time (LPT), X-dispatch bottleneck dynamics heuristic [13] (XD), Rachamadugu & Morton heuristic [16] (RM), weighted Montagne heuristic [13] (MON) and Apparent Tardiness Cost with Setups heuristic [11] (ATCS). Each heuristic is defined with its priority function which is used by a meta-algorithm for a given environment (stated in the next section).…”

Section: Scheduling Heuristicsmentioning

confidence: 99%

See 1 more Smart Citation

Genetic Programming Heuristics for Multiple Machine Scheduling

Jakobović

Jelenkovic

Budin

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. In this paper we present a method for creating scheduling heuristics for parallel proportional machine scheduling environment and arbitrary performance criteria. Genetic programming is used to synthesize the priority function which, coupled with an appropriate metaalgorithm for a given environment, forms the priority scheduling heuristic. We show that the procedures derived in this way can perform similarly or better than existing algorithms. Additionally, this approach may be particularly useful for those combinations of scheduling environment and criteria for which there are no adequate scheduling algorithms.

show abstract

A heuristic to minimize the total weighted tardiness with sequence-dependent setups

Cited by 225 publications

References 14 publications

Scheduling Solutions for the Paper Industry

Scheduling Solutions for the Paper Industry

A hybrid cuckoo search metaheuristic algorithm for solving single machine total weighted tardiness scheduling problems with sequence dependent setup times

Genetic Programming Heuristics for Multiple Machine Scheduling

Contact Info

Product

Resources

About