Geodesic
On minimizing total tardiness in a serial batching problem
RAIRO - Operations Research - Recherche Opérationnelle, Tome 35 (2001) no. 1, pp. 107-115 Cet article a éte moissonné depuis la source Numdam

Voir la notice de l'article

We study the problem of scheduling jobs on a serial batching machine to minimize total tardiness. Jobs of the same batch start and are completed simultaneously and the length of a batch equals the sum of the processing times of its jobs. When a new batch starts, a constant setup time s occurs. This problem 1|s-batch|∑T i is known to be NP-Hard in the ordinary sense. In this paper we show that it is solvable in pseudopolynomial time by dynamic programming.

Classification : 90B35, 90C39, 90C27
Keywords: scheduling, batching, dynamic programming, total tardiness 
@article{RO_2001__35_1_107_0,
     author = {Baptiste, Philippe and Jouglet, Antoine},
     title = {On minimizing total tardiness in a serial batching problem},
     journal = {RAIRO - Operations Research - Recherche Op\'erationnelle},
     pages = {107--115},
     year = {2001},
     publisher = {EDP-Sciences},
     volume = {35},
     number = {1},
     mrnumber = {1841817},
     zbl = {0991.90062},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/RO_2001__35_1_107_0/}
}
TY  - JOUR
AU  - Baptiste, Philippe
AU  - Jouglet, Antoine
TI  - On minimizing total tardiness in a serial batching problem
JO  - RAIRO - Operations Research - Recherche Opérationnelle
PY  - 2001
SP  - 107
EP  - 115
VL  - 35
IS  - 1
PB  - EDP-Sciences
UR  - http://geodesic.mathdoc.fr/item/RO_2001__35_1_107_0/
LA  - en
ID  - RO_2001__35_1_107_0
ER  - 
%0 Journal Article
%A Baptiste, Philippe
%A Jouglet, Antoine
%T On minimizing total tardiness in a serial batching problem
%J RAIRO - Operations Research - Recherche Opérationnelle
%D 2001
%P 107-115
%V 35
%N 1
%I EDP-Sciences
%U http://geodesic.mathdoc.fr/item/RO_2001__35_1_107_0/
%G en
%F RO_2001__35_1_107_0
Baptiste, Philippe; Jouglet, Antoine. On minimizing total tardiness in a serial batching problem. RAIRO - Operations Research - Recherche Opérationnelle, Tome 35 (2001) no. 1, pp. 107-115. http://geodesic.mathdoc.fr/item/RO_2001__35_1_107_0/