The one-machine just-in-time scheduling problem with preemption

Authors:
Yann Hendel;Nina Runge;Francis Sourd
Affiliations:
Université Pierre et Marie Curie - LIP6 - 4, place Jussieu - 75252 PARIS CEDEX 05, France;Université Pierre et Marie Curie - LIP6 - 4, place Jussieu - 75252 PARIS CEDEX 05, France;SNCF - Innovation & Recherche - 45, rue de Londres - 75379 PARIS CEDEX 08, France
Venue:
Discrete Optimization
Year:
2009

Citing 10
Cited 1

A strongly polynomial algorithm to solve combinatorial linear programs

Operations Research
One-processor scheduling with symmetric earliness and tardiness penalties

Mathematics of Operations Research
Polynomial Methods for Separable Convex Optimization in Unimodular Linear Spaces with Applications

SIAM Journal on Computing
Foundations of Computer Science

Foundations of Computer Science
PERT scheduling with convex cost functions

Theoretical Computer Science
The One-Machine Problem with Earliness and Tardiness Penalties

Journal of Scheduling
Solving the Convex Cost Integer Dual Network Flow Problem

Management Science
An improved earliness-tardiness timing algorithm

Computers and Operations Research
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 genetic algorithm for JIT single machine scheduling with preemption and machine idle time

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper investigates the notion of preemption in scheduling, with earliness and tardiness penalties. Starting from the observation that the classical cost model where penalties only depend on completion times does not capture the just-in-time philosophy, we introduce a new model where the earliness costs depend on the start times of the jobs. To solve this problem, we propose an efficient representation of dominant schedules, and a polynomial algorithm to compute the best schedule for a given representation. Both a local search algorithm and a branch-and-bound procedure are then derived. Experiments finally show that the gap between our upper bound and the optimum is very small.