An efficient ILP formulation for the single machine scheduling problem
RAIRO - Operations Research - Recherche Opérationnelle, Tome 44 (2010) no. 1, pp. 61-71.

This paper considers the problem of scheduling n jobs on a single machine. A fixed processing time and an execution interval are associated with each job. Preemption is not allowed. On the basis of analytical and numerical dominance conditions, an efficient integer linear programming formulation is proposed for this problem, aiming at minimizing the maximum lateness (Lmax). Experiments have been performed by means of a commercial solver that show that this formulation is effective on large problem instances. A comparison with the branch-and-bound procedure of Carlier is provided.

DOI : 10.1051/ro/2010007
Classification : 90B35
Mots-clés : single machine scheduling, integer linear programming, dominance conditions 
@article{RO_2010__44_1_61_0,
     author = {Briand, Cyril and Ourari, Samia and Bouzouia, Brahim},
     title = {An efficient {ILP} formulation for the single machine scheduling problem},
     journal = {RAIRO - Operations Research - Recherche Op\'erationnelle},
     pages = {61--71},
     publisher = {EDP-Sciences},
     volume = {44},
     number = {1},
     year = {2010},
     doi = {10.1051/ro/2010007},
     mrnumber = {2642916},
     zbl = {1183.90161},
     language = {en},
     url = {http://www.numdam.org/articles/10.1051/ro/2010007/}
}
TY  - JOUR
AU  - Briand, Cyril
AU  - Ourari, Samia
AU  - Bouzouia, Brahim
TI  - An efficient ILP formulation for the single machine scheduling problem
JO  - RAIRO - Operations Research - Recherche Opérationnelle
PY  - 2010
SP  - 61
EP  - 71
VL  - 44
IS  - 1
PB  - EDP-Sciences
UR  - http://www.numdam.org/articles/10.1051/ro/2010007/
DO  - 10.1051/ro/2010007
LA  - en
ID  - RO_2010__44_1_61_0
ER  - 
%0 Journal Article
%A Briand, Cyril
%A Ourari, Samia
%A Bouzouia, Brahim
%T An efficient ILP formulation for the single machine scheduling problem
%J RAIRO - Operations Research - Recherche Opérationnelle
%D 2010
%P 61-71
%V 44
%N 1
%I EDP-Sciences
%U http://www.numdam.org/articles/10.1051/ro/2010007/
%R 10.1051/ro/2010007
%G en
%F RO_2010__44_1_61_0
Briand, Cyril; Ourari, Samia; Bouzouia, Brahim. An efficient ILP formulation for the single machine scheduling problem. RAIRO - Operations Research - Recherche Opérationnelle, Tome 44 (2010) no. 1, pp. 61-71. doi : 10.1051/ro/2010007. http://www.numdam.org/articles/10.1051/ro/2010007/

[1] C. Briand, H.T. La and J. Erschler, Une approche pour l'ordonnancement robuste de tâches sur une machine, 4ème Conférence Francophone de MOdélisation et SIMulation (MOSIM'03). Toulouse, France (2003) 205-211.

[2] J. Carlier, The one-machine sequencing problem. Eur. J. Oper. Res. 11 (1982) 42-47. | Zbl

[3] J. Erschler, F. Roubellat and J.-P Vernhes, Characterizing the set of feasible sequences for n jobs to be carried out on a single machine. Eur. J. Oper. Res. 4 (1980) 189-194. | Zbl

[4] J. Erschler, G. Fontan, C. Merce and F. Roubellat, A New Dominance Concept in Scheduling n Jobs on a Single Machine with Ready Times and Due Dates. Oper. Res. 31 (1983) 114-127. | Zbl

[5] A.M. Hariri and C.N. Potts, An algorithm for single machine sequencing with release dates to minimize total weighted completion time. Discrete Appl. Math. 5 (1983) 99-109. | Zbl

[6] J.K. Lenstra, A.H.G. Rinnooy Han and P. Brucker, Complexity of machine scheduling problems. Ann. Discrete Math. 1 (1977) 343-362. | Zbl

Cité par Sources :