Dominance rules for the parallel machine total weighted tardiness scheduling problem with release dates

Authors:
Antoine Jouglet;David Savourey
Affiliations:
Heudiasyc, UMR CNRS 6599, Université de Technologie de Compiègne, BP 20529, 60205 Compiègne, France;Ecole Polytechnique, CNRS LIX, F-91128 Palaiseau, France
Venue:
Computers and Operations Research
Year:
2011

Citing 4
Cited 1

Scheduling equal-length jobs on identical parallel machines

Discrete Applied Mathematics
Scheduling Algorithms

Scheduling Algorithms
Scheduling unrelated parallel machines to minimize total weighted tardiness

Computers and Operations Research
A branch-and-bound algorithm to minimize total weighted completion time on identical parallel machines with job release dates

Computers and Operations Research

Minimizing Total Tardiness in Parallel-Machine Scheduling with Release Dates

International Journal of Applied Evolutionary Computation

Quantified Score

Hi-index	0.01

Visualization

Abstract

We address the parallel machine total weighted tardiness scheduling problem with release dates. We describe dominance rules and filtering methods for this problem. Most of them are adaptations of dominance rules based on solution methods for the single-machine problem. We show how it is possible to deduce whether or not certain jobs can be processed by a particular machine in a particular context and we describe techniques that use this information to improve the dominance rules. On the basis of these techniques we describe an enumeration procedure and we provide experimental results to determine the effectiveness of the dominance rules.