Improved dynamic programs for some batching problems involving the maximum lateness criterion

Operations Research Letters

Volumn 27, Issue 3, 2000, Pages 109-118

  Wagelmans, A P M ^a   Gerodimos, A E ^b  

^a ERASMUS UNIVERSITY ROTTERDAM   (Netherlands)

^b IMPERIAL COLLEGE LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DATA STRUCTURES; DYNAMIC PROGRAMMING; SCHEDULING;

MONOTONICITY;

OPERATIONS RESEARCH;

EID: 0034290955     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-6377(00)00040-7     Document Type: Article

References (15)

1. A Aggarwal J.K Park Improved algorithms for economic lot size problems Oper. Res. 41 3 1993 549 571
2. A.V Aho J.E Hopcroft J.D Ullman Data Structures and Algorithms 1987 Addison-Wesley Reading, MA
3. S Albers P Brucker The complexity of one-machine batching problems Disc. Appl. Math. 47 1993 87 107
4. K.R Baker Scheduling the production of components at a common facility IIE Trans. 20 1 1988 32 35
5. P Brucker Scheduling Algorithms 1995 Springer Berlin
6. P Brucker A Gladky H Hoogeveen M.Y Kovalyov C.N Potts T Tautenhahn S van de Velde Scheduling a batching machine J. Schedul. 1 1998 31 54
7. E.G Coffman M Yannakakis M.J Magazine C Santos Batch sizing and job sequencing on a single machine Ann. Oper. Res. 26 1990 135 147
8. A Federgruen M Tzur A simple forward algorithm to solve general dynamic lot sizing models with n periods in O (n log n) or O ( n ) time Manage. Sci. 37 1991 909 925
9. A.E. Gerodimos, C.A. Glass, C.N. Potts, Scheduling customised jobs on a single machine under item availability, unpublished report, Faculty of Mathematical Studies, University of Southampton, UK (1999)
10. A.E Gerodimos C.A Glass C.N Potts Scheduling the production of two-operation jobs on a single machine Euro. J. Oper. Res. 120 2000 250 259
11. M.Y Kovalyov C.N Potts Scheduling with batching: a review Euro. J. Oper. Res. 120 2000 228 249
12. C.A Santos M.J Magazine Batching in single operation manufacturing systems Oper. Res. Lett. 4 3 1985 99 103
13. S van Hoesel A Wagelmans B Moerman Using geometric techniques to improve dynamic programming algorithms for the economic lot-sizing problem and extensions Euro. J. Oper. Res. 75 1994 312 331
14. A Wagelmans S van Hoesel A Kolen Economic lot sizing: an O (n log n) algorithm that runs in linear time in the Wagner–Whitin case Oper. Res. 40 Supp. 1 1992 145 156
15. S Webster K.R Baker Scheduling groups of jobs on a single machine Oper. Res. 43 1995 692 703