An exact approach for scheduling jobs with regular step cost functions on a single machine

Authors:
Boris Detienne;Stéphane Dauzère-Pérès;Claude Yugma
Affiliations:
Université d'Avignon et des pays de Vaucluse, 339, chemin des Meinajaries, Agroparc BP 1228, 84 911 Avignon Cedex 9, France;ícole des Mines de Saint-ítienne, Centre Microélectronique de Provence, Site Georges Charpak, 880 route de Mimet, 13541 Gardanne, France;ícole des Mines de Saint-ítienne, Centre Microélectronique de Provence, Site Georges Charpak, 880 route de Mimet, 13541 Gardanne, France
Venue:
Computers and Operations Research
Year:
2012

Citing 5
Cited 0

A time indexed formulation of non-preemptive single machine scheduling problems

Mathematical Programming: Series A and B
Scheduling Algorithms

Scheduling Algorithms
New Exact Algorithms for One-Machine Earliness-Tardiness Scheduling

INFORMS Journal on Computing
An exact algorithm for single-machine scheduling without machine idle time

Journal of Scheduling
Sequencing a single machine with due dates and deadlines: an ILP-based approach to solve very large instances

Journal of Scheduling

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper studies a single-machine scheduling problem whose objective is to minimize a regular step total cost function. Lower and upper bounds, obtained from linear and Lagrangian relaxations of different Integer Linear Programming formulations, are compared. A dedicated exact approach is presented, based on a Lagrangian relaxation. It consists of finding a Constrained Shortest Path in a specific graph designed to embed a dominance property. Filtering rules are developed for this approach in order to reduce the size of the graph, and the problem is solved by successively removing infeasible paths from the graph. Numerical experiments are conducted to evaluate the lower and upper bounds. Moreover, the exact approach is compared with a standard solver and a naive branch-and-bound algorithm.