Title :
Exact procedures for single machine total cost scheduling
Author :
Jouglet, Antoine ; Baptiste, Philippe ; Carlier, Jacques
Author_Institution :
CNRS, Univ. de Technol. de Compiegne, France
Abstract :
We study the One-Machine problem with release dates with the aim of minimizing several objective functions among those the total (weighted) tardiness and the total (weighted) completion time. These problems are NP hard in the strong sense. We present general dominance properties, propagation rules along with an intelligent backtracking technique, which are valid for all these criteria. These techniques have been integrated into branch and bound methods and have been experimentally studied. These results show the efficiency of these techniques which improve the best results found for these criteria.
Keywords :
backtracking; minimisation; production control; scheduling; tree searching; NP hard; One-Machine problem; branch and bound methods; experiment; general dominance properties; intelligent backtracking technique; objective function minimization; propagation rules; release dates; single machine total cost scheduling; Costs; Polynomials; Single machine scheduling; Sliding mode control;
Conference_Titel :
Systems, Man and Cybernetics, 2002 IEEE International Conference on
Print_ISBN :
0-7803-7437-1
DOI :
10.1109/ICSMC.2002.1175623
