Batching identical jobs

Mathematical Methods of Operations Research

Volumn 52, Issue 3, 2000, Pages 355-367

  Baptiste, Philippe ^a  

^a UNIVERSITÉ DE TECHNOLOGIE DE COMPIÈGNE   (France)

Author keywords

Complexity; Dynamic Programming; Scheduling Theory

Indexed keywords

EID: 0011830579     PISSN: 14322994     EISSN: None     Source Type: Journal    
DOI: 10.1007/s001860000088     Document Type: Article

References (19)

1. Albers S, Brucker P (1993) The complexity of one-machine batching problems. Discrete Applied Mathematics 47:87-107
2. Baptiste Ph (1998) A theoretical and experimental study of resource constraint propagation. Thèse de doctorat, Université de Technologie de Compiègne
3. Baptiste Ph (1999) Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine when processing times are equal. Journal of Scheduling 2:245-252
4. Baptiste Ph (1998) Scheduling equal-length jobs on identical parallel machines. Technical Report 98-159 Université de Technologie de Compiègne, to appear in Discrete Applied Mathematics
5. Brucker P (1995) Scheduling algorithms. Springer Lehrbuch
6. Brucker P, Gladky A, Hoogeveen H, Kovalyov M. Potts C, Tautenhahn T. van de Velde S (1998) Scheduling a batching machine. Journal of Scheduling 1:31-54
7. Brucker P, Knust S, Complexity results of scheduling problems. URL: www//mathematik.uni-osnabrueck.de/research/OR/class
8. Brucker P, Kovalyov MY (1996) Single machine batch scheduling to minimize the weighted number of late jobs. Mathematical Methods of Operations Research 43:1-8
9. Carlier J (1981) Problème à une machine et algorithmes polynômiaux. QUESTIO 5:219-228
10. Carlier J (1984) Problèmes d'ordonnancements à contraintes de Ressources: Algorithmes et Complexité. Thèse d'Etat, Université Paris VI
11. Coffman EG, Yannakakis M, Magazine MJ, Santos C (1990) Batch sizing and sequencing on a single machine. Annals of Operations Research 26:135-147
12. Dessouky MI, Lageweg BJ, Karel Lenstra J, van de Velde SL (1990) Scheduling identical jobs on uniform parallel machines. Statistica Neerlandica 44:115-123
13. Du J, Leung JY-T (1990) Minimizing total tardiness on one machine is NP-hard. Mathematics of Operations Research 15:483-495
14. Dupont L (1999) Ordonnancements sur machines à traitement par batch (fournée), research report GILCO Institut National Polytechnique de Grenoble
15. Hochbaum DS, Landy D (1994) Scheduling with batching: minimizing the weighted number of tardy jobs. Operations Research Letters 16:79-86
16. Monma CL, Potts CN (1989) On the complexity of scheduling with batch setup times. Operations Research 37:798-804
17. Potts CN, Kovalyov MY (2000) Scheduling with batching: A review. European Journal of Operational Research 120:228-249
18. Shallcross DF (1992) A polynomial algorithm for a one machine batching problem. OR Letters 11:213-218
19. Webster S, Baker KR (1995) Scheduling groups of jobs on a single machine. Operations Research 43:692-703