Technical Note—A Note on the Weighted Tardiness Problem

Rachamadugu, Ram

doi:10.1287/opre.35.3.450

Cited by 53 publications

(23 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Rinnooy Kan et a/. (1975) and Rachamadugu (1987) extended these results to 11 I C w,?. The Branch and Bound (BB) algorithm of Potts and van Wassenhove (1985) can solve problem *Corresponding author instances with up to 40 jobs.…”

Section: Introductionmentioning

confidence: 80%

An exact approach to minimizing total weighted tardiness with release dates

Aktürk¹,

Özdemir²

2000

IIE Transactions

View full text Add to dashboard Cite

The study deals with scheduling a set of independent jobs with unequal release dates to minimize total weighted tardiness on a single machine. We propose new dominance properties that are incorporated in a branch and bound algorithm. The proposed algorithm is tested on a set of randomly generated problems with 10, 15 and 20 jobs. To the best of our knowledge, this is the first exact approach that attempts to solve the l(rjl C w j q problem.

show abstract

Section: Introductionmentioning

confidence: 80%

An exact approach to minimizing total weighted tardiness with release dates

Aktürk¹,

Özdemir²

2000

IIE Transactions

View full text Add to dashboard Cite

show abstract

“…Ref. [27] shows that this rule can be used as an effective pruning device in enumerative methods. Modifications of this rule deliver very good results for flow shop and job shop problems with weighted tardiness criteria (see Ref.…”

Section: Heuristic Solution With Priority Rulesmentioning

confidence: 99%

Scheduling a Flow Shop with Simultaneously Loaded Stations: A Real World Application

Herrmann¹

2015

JCSE

View full text Add to dashboard Cite

Abstract:Companies use special designed flow shops, in order to satisfy specific demands. Products need to be transported (from one station to the next station) by a crane and the way of working of this crane excludes the intermediate storage (of a work piece). In addition, the way of working restricts the set of feasible schedules even more than the no-buffer restriction discussed in the literature in the case of limited storage. Since this scheduling problem is integrated in the usual hierarchical planning, the tardiness is minimised. A linear optimisation model is presented to provide a formal description of this NP-hard problem. It is also used to explain the performance of priority rule based heuristic solutions on small test problems. In detail, priority rules as well as a priority rule based branch and bound procedure are analysed; priority rules are regarded, because a priority rule is still the standard procedure for on-line scheduling in industrial practise. Out of successful priority rules in the literature the best one is identified by an extensive simulative investigation. An improved look-ahead is realised by a restricted search over all possible schedules.Key words: Scheduling, real world flow shop with restrictions, no buffer and no wait, minimising tardiness, optimisation model, priority rules, priority rule based branch and bound procedure.

show abstract

“…An obvious ÿrst step might be the 1|r j | j T j problem. For this problem it should be possible to build on the dominance property for 1 j T j already developed by Rachamadugu (1987). For E=T problems, similar extensions may be possible.…”

Section: Research Opportunitiesmentioning

confidence: 99%

Scheduling with Inserted Idle Time: Problem Taxonomy and Literature Review

Kanet

Sridharan

2000

Operations Research

127

View full text Add to dashboard Cite

In the context of production scheduling, inserted idle time (IIT) occurs whenever a resource is deliberately kept idle in the face of waiting jobs. IIT schedules are particularly relevant in multimachine industrial situations where earliness costs and=or dynamically arriving jobs with due dates come into play. We provide a taxonomy of environments in which IIT scheduling is relevant, review the extant literature on IIT scheduling, and identify areas of opportunity for future research.

show abstract

Technical Note—A Note on the Weighted Tardiness Problem

Cited by 53 publications

References 8 publications

An exact approach to minimizing total weighted tardiness with release dates

An exact approach to minimizing total weighted tardiness with release dates

Scheduling a Flow Shop with Simultaneously Loaded Stations: A Real World Application

Scheduling with Inserted Idle Time: Problem Taxonomy and Literature Review

Contact Info

Product

Resources

About