Weighted tardiness for the single machine scheduling problem: An examination of precedence theorem productivity

Authors:
J. J. Kanet;C. Birkemeier
Affiliations:
Department of MIS OM & DS, University of Dayton, 300 College Park, Dayton, OH 45469-2130, USA;Department of MIS OM & DS, University of Dayton, 300 College Park, Dayton, OH 45469-2130, USA
Venue:
Computers and Operations Research
Year:
2013

Citing 14
Cited 0

Priority rules for job shops with weighted tardiness costs

Management Science
A survey of algorithms for the single machine total weighted tardiness scheduling problem

Discrete Applied Mathematics - Southampton conference on combinatorial optimization, April 1987
Design of Iterated Local Search Algorithms

Proceedings of the EvoWorkshops on Applications of Evolutionary Computing
An Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling Problem

INFORMS Journal on Computing
On the equivalence of the max-min transportation lower bound and the time-indexed lower bound for single-machine scheduling problems

Mathematical Programming: Series A and B
Beam search algorithms for the single machine total weighted tardiness scheduling problem with sequence-dependent setups

Computers and Operations Research
A population-based variable neighborhood search for the single machine total weighted tardiness problem

Computers and Operations Research
Interval-indexed formulation based heuristics for single machine total weighted tardiness problem

Computers and Operations Research
Minimizing total tardiness on a single machine with controllable processing times

Computers and Operations Research
A discrete differential evolution algorithm for the single machine total weighted tardiness problem with sequence dependent setup times

Computers and Operations Research
New Precedence Theorems for One-Machine Weighted Tardiness

Mathematics of Operations Research
Time-Indexed Formulations and the Total Weighted Tardiness Problem

INFORMS Journal on Computing
Principles of Sequencing and Scheduling

Principles of Sequencing and Scheduling
Single CNC machine scheduling with controllable processing times to minimize total weighted tardiness

Computers and Operations Research

Quantified Score

Hi-index	0.01

Visualization

Abstract

Earlier research by Kanet [11] has provided a number of new theorems for deciding precedence between pairs of jobs for 1||@Sw"jT"j. The theorems supplant those of Rinnooy Kan, Lageweg, and Lenstra [16]. Presented here are the results of an analysis of the marginal benefit these new theorems provide over the earlier versions of Rinnooy Kan et al. Results show that the new theorems can provide noteworthy improvements in the ability to discover precedence relations between job pairs. For a large set of problem instances the new theorems uncovered up to 8% more precedence relations than the original theorems of Rinnooy Kan et al. The improvement in the productivity in discovering precedence relations shows to be dependent on the coefficient of variation of the distribution of job weights. Logical application of the theorems is to include them in search procedures and/or heuristic approaches to 1||@Sw"jT"j. One such heuristic based on the theorems is provided here in which the solutions to a large set of sample problems are within 8-12% of the optimum.