A new model for the preemptive earliness-tardiness scheduling problem

Authors:
Nina Runge;Francis Sourd
Affiliations:
Laboratoire d'Informatique Paris 6, Université Pierre et Marie Curie, 4 place Jussieu, 75252 Paris Cedex 05, France;SNCF, Innovation & Recherche, 45 rue de Londres, 75379 Paris Cedex 08, France
Venue:
Computers and Operations Research
Year:
2009

Citing 6
Cited 3

The One-Machine Problem with Earliness and Tardiness Penalties

Journal of Scheduling
The Continuous Assignment Problem and Its Application to Preemptive and Non-Preemptive Scheduling with Irregular Cost Functions

INFORMS Journal on Computing
An improved earliness-tardiness timing algorithm

Computers and Operations Research
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
Preemption in single machine earliness/tardiness scheduling

Journal of Scheduling
A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem

Journal of Scheduling

A class of multi-objective expected value decision-making model with birandom coefficients and its application to flow shop scheduling problem

Information Sciences: an International Journal
A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem

Computers and Operations Research
Resource constrained project scheduling problem with discounted earliness-tardiness penalties: Mathematical modeling and solving procedure

Computers and Industrial Engineering

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper addresses a new model for the one-machine earliness-tardiness scheduling problem where jobs can be interrupted. Some dominance rules and a lower bound are derived. A new timing algorithm is also presented and a local search algorithm based on this timing algorithm permits the computation of good feasible solutions. We experimentally compare our timing algorithm with a previously published timing algorithm. The tests show that the execution time of the new timing algorithm is significantly faster, especially for large instances. The values of the solutions are compared to the lower bound.