Title :
A Branch-and-Bound to solve the scheduling problem Pm/rj/ΣTj
Author_Institution :
Inst. Charles Delaunay, Univ. de Technol. de Troyes
Abstract :
This paper presents the first study for the total tardiness minimization on parallel machine scheduling problem with different release dates of jobs. In this problem, a set of jobs has to be scheduled, without any preemption or splitting, on identical parallel machine. Each job has a due date and a release date. A polynomial lower bound is proposed using a relaxation procedure. A set of dominance properties are also established. A branch and bound algorithm is developed by taking into account the theoretical properties, lower and also upper bounds. This exact method has been tested on a large number of randomly generated problems. The obtained results are promising
Keywords :
job shop scheduling; parallel machines; tree searching; branch-and-bound algorithm; dominance properties; identical parallel machine; job release dates; polynomial lower bound; relaxation procedure; scheduling problem; Job shop scheduling; Parallel machines; Polynomials; Production systems; Random number generation; Simulated annealing; Single machine scheduling; Testing; Time measurement; Upper bound; Branch and bound; Dominance properties; Identical parallel machines; Lower bound; Release dates; Scheduling; Total tardiness;
Conference_Titel :
Service Systems and Service Management, 2006 International Conference on
Conference_Location :
Troyes
Print_ISBN :
1-4244-0450-9
Electronic_ISBN :
1-4244-0451-7
DOI :
10.1109/ICSSSM.2006.320679
