Minimizing the average deviation of job completion times about a common due date

Kanet, John J.

doi:10.1002/nav.3800280411

Cited by 301 publications

(113 citation statements)

References 4 publications

(1 reference statement)

Supporting

Mentioning

105

Contrasting

Unclassified

Order By: Relevance

“…This paper considers the SMTWT scheduling problems with sequence dependent setup times. Kanet (1981) studied the single machine scheduling problem for minimising the sum of deviations from a common due date. He presented a polynomially bounded matching algorithm for the 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

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

show abstract

“…For d large, the problem with unit weights and the problem with j = and j = for all j are solvable in O(n log n) time Kanet, 1981Emmons, 1987. For distinct symmetric weights, that is j = j for all j, the problem is NP -hard but solvable in O(n P n j=1 p j ) time and space Hall and Posner, 1991].…”

Section: Introductionmentioning

confidence: 99%

“…2 Basics for the large common due date problem Kanet (1981) presents an O(n log n) algorithm for the large common due date problem with = . Emmons (1987) proposes an O(n log n) algorithm for the more general case that 6 = .…”

Section: Introductionmentioning

confidence: 99%

“…The concepts of these algorithms are prerequisites for the subsequent sections. Theorem 1 (Kanet, 1981) No optimal schedule has idle time between the execution of 3 the jobs.…”

Section: Introductionmentioning

confidence: 99%

“…Theorem 2 (Kanet, 1981) There is an optimal schedule for which the due date d coincides with either the start or the completion time of the job with the smallest processing time.…”

mentioning

confidence: 99%

See 2 more Smart Citations

Earliness-Tardiness Scheduling Around Almost Equal Due Dates

Hoogeveen

Velde²

1997

INFORMS Journal on Computing

View full text Add to dashboard Cite

The just-in-time concept in manufacturing has aroused interest in machine scheduling problems with earliness-tardiness penalties. In particular, common due date problems, which are structurally less complicated than problems with general due dates, have emerged as an interesting and proli c eld of research. We prove that so-called almost common due date problems, in which the due date d j and processing time p j of each j o b J j (j = 1 : : : n ) are such that d j 2 D D+ p j ] for some constant D, are structurally less complicated also. Our main contribution is an O(n 2 ) t i m e dynamic programming algorithm for the almost common due date problem with large D. The dynamic programming algorithm is interesting in its own right, since the optimality principle behind it applies to other common due date and almost common due date problems as well. 1980 Mathematics Subject Classi cation (1991): 9 0 B 3 5 .

show abstract

The single-machine absolute-deviation early-tardy problem with random completion times

Al‐Turki

Mittenthal

Raghavachari

1996

Naval Research Logistics

View full text Add to dashboard Cite

We consider sequencing n jobs on a single machine subject to job completion times arising from either machine breakdowns or other causes. The objective is to minimize an expected weighted combination of due dates, completion times, earliness, and tardiness penalties. The determination of optimal distinct due dates or optimal common due dates for a given schedule is investigated. The scheduling problem for a fixed common due date is considered when random completion times arise from machine breakdowns. The optimality of a V‐shaped about (a point) T sequence is established when the number of machine breakdowns follows either a Poisson or a geometric distribution and the duration of a breakdown has an exponential distribution. © 1996 John Wiley & Sons, Inc.

show abstract

Minimizing the average deviation of job completion times about a common due date

Cited by 301 publications

References 4 publications

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

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

Earliness-Tardiness Scheduling Around Almost Equal Due Dates

The single-machine absolute-deviation early-tardy problem with random completion times

Contact Info

Product

Resources

About