Hostname: page-component-848d4c4894-cjp7w Total loading time: 0 Render date: 2024-07-03T15:47:40.288Z Has data issue: false hasContentIssue false
  • English
  • Français

On Minimizing Total Tardiness in a Serial Batching Problem

Published online by Cambridge University Press:  15 August 2002

Philippe Baptiste  and
Antoine Jouglet
Philippe Baptiste
Affiliation:
CNRS, UMR 6599 , Université de Technologie de Compiègne, Centre de Recherches de Royallieu, 60205 Compiègne Cedex, France.
Antoine Jouglet
Affiliation:
CNRS, UMR 6599 , Université de Technologie de Compiègne, Centre de Recherches de Royallieu, 60205 Compiègne Cedex, France.
Get access

Abstract

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 | ∑Ti 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.

Keywords

Schedulingbatchingdynamic programmingtotal tardiness.
Type
Research Article
Information
RAIRO - Operations Research , Volume 35 , Issue 1 , January 2001 , pp. 107 - 115
Copyright
© EDP Sciences, 2001

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Albers, S. and Brucker, P., The Complexity of One-Machine Batching Problems. Discrete Appl. Math. 47 (1993) 87-107. CrossRef
Ph. Baptiste, Batching Identical Jobs, Technical Report, University of Technology of Compiègne (1999).
P. Brucker, Scheduling Algorithms. Springer Lehrbuch (1995).
Brucker, P., Gladky, A., Hoogeveen, H., Kovalyov, M., Potts, C., Tautenhahn, T. and van de Velde, S., Scheduling a Batching Machine. J. Sched. 1 (1998) 31-54. 3.0.CO;2-R>CrossRef
P. Brucker and S. Knust, Complexity Results of Scheduling Problems.URL: www//mathematik.uni-osnabrueck.de/research/OR/class
Brucker, P. and Kovalyov, M.Y., Single machine batch scheduling to minimize the weighted number of late jobs. Math. Methods Oper. Res. 43 (1996) 1-8. CrossRef
Coffman, E.G., Yannakakis, M., Magazine, M.J. and Santos, C., Batch sizing and sequencing on a single machine. Ann. Oper. Res. 26 (1990) 135-147. CrossRef
Du, J. and Leung, J.Y.-T., Minimizing Total Tardiness on One Machine is NP-Hard. Math. Oper. Res. 15 (1990) 483-495. CrossRef
L. Dupont, Ordonnancements sur machines à traitement par batch (fournée). TSI 10 (to appear).
Lawler, E.L., A ``Pseudopolynomial'' Algorithm for Sequencing Jobs to Minimize Total Tardiness. Ann. Discrete Math. 1 (1977) 331-342. CrossRef
Monma, C.L. and Potts, C.N., On the Complexity of Scheduling with Batch Setup Times. Oper. Res. 37 (1989) 798-804. CrossRef
C.N. Potts and M.Y. Kovalyov. Scheduling with batching: A review. European J. Oper. Res. 120 (2000) 228-249.
Webster, S. and Baker, K.R., Scheduling Groups of Jobs on a Single Machine. Oper. Res. 43 (1995) 692-703. CrossRef