Batch machine production with perishability time windows and limited batch size

European Journal of Operational Research

Volumn 210, Issue 1, 2011, Pages 39-47

  Chakhlevitch, Konstantin ^a   Glass, Celia A ^a   Kellerer, Hans ^b  

^a CITY UNIVERSITY   (United Kingdom)

^b UNIVERSITY OF GRAZ   (Austria)

Author keywords

Batch production; Broadcast scheduling; Optimisation; Scheduling

Indexed keywords

BATCH MACHINES; BATCH PROCESSING MACHINE; BATCH PRODUCTION; BATCH SIZES; BROADCAST SCHEDULING; COMBINED FEATURES; EQUAL LENGTHS; FAB PRODUCTIONS; HEURISTIC APPROACH; INPUT VARIABLES; JOB PROCESSING TIME; NP-HARD; OPEN PROBLEMS; OPTIMISATIONS; PRODUCTION PLANNING; RUNNING TIME; SCHEDULING JOBS; TIME HORIZONS; TIME WINDOWS; WIRELESS BROADCASTING;

HEURISTIC METHODS; OPTIMIZATION; PRODUCTION CONTROL; SCHEDULING; VEHICLE ROUTING;

SCHEDULING ALGORITHMS;

EID: 78650891508     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2010.10.033     Document Type: Article

References (24)

1. N. Bansal, D. Coppersmith, M. Sviridenko, Improved approximation algorithms for broadcast scheduling, in: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006, pp. 344-353.
2. P. Baptiste Batching identical jobs Mathematical Methods of Operations Research 52 2000 355 367
3. Y. Bartal, S. Muthukrishnan, Minimizing maximum response time in scheduling broadcasts, in: Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000, pp. 558-559.
4. P. Brucker, A. Gladky, H. Hoogeveen, M.Y. Kovalyov, C.N. Potts, T. Tautenhahn, and S.L. van de Velde Scheduling a batching machine Journal of Scheduling 1 1998 31 54
5. K. Chakhlevitch, C.A. Glass, H. Kellerer, An heuristic for equitable broadcast scheduling, Working paper, Cass Business School, City University London, UK, 2010.
6. K. Chakhlevitch, C.A. Glass, P. Sadd, Alleviating bottlenecks in the food testing process of a microbiological laboratory, Working paper, Cass Business School, City University London, UK, 2009.
7. J. Chang, T. Erlebach, R. Gailis, S. Khuller, Broadcast scheduling: algorithms and complexity, in: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008, pp. 473-482.
8. G. Dobson, and R.S. Nambimadom The batch loading and scheduling problem Operations Research 49 1 2001 52 65
9. R. Fu, J. Tian, and J. Yuan On-line scheduling on an unbounded parallel batch machine to minimize makespan of two families of jobs Journal of Scheduling 12 2009 91 97
10. D.S. Hochbaum, and D. Landy Scheduling with batching: minimizing the weighted number of tardy jobs Operations Research Letters 16 1994 79 86
11. Y. Ikura, and M. Gimple Efficient scheduling algorithms for a single batch processing machine Operations Research Letters 5 1986 61 65
12. F. Jolai Minimizing number of tardy jobs on a batch processing machine with incompatible job families European Journal of Operational Research 162 2005 184 190
13. C. Kenyon, and N. Schabanel The data broadcasting problem with non-uniform transmission times Algorithmica 35 2003 146 175
14. M.E. Kurz, and S.J. Mason Minimizing total weighted tardiness on a batch-processing machine with incompatible job families and job ready times International Journal of Production Research 46 2008 131 151
15. C.-Y. Lee, R. Uzsoy, and L.A. Martin-Vega Efficient algorithms for scheduling semiconductor burn-in operations Operations Research 40 1992 764 775
16. C.-L. Li, and C.-Y. Lee Scheduling with agreeable release times and due dates on a batch processing machine European Journal of Operational Research 96 1997 564 569
17. Z. Liu, J. Yuan, and T.C.E. Cheng On scheduling an unbounded batch machine Operations Research Letters 31 1 2003 42 48
18. M. Mathirajan, and A.I. Sivakumar A literature review, classification and simple meta-analysis on scheduling of batch processors in semiconductor International Journal of Advanced Manufacturing Technology 29 9-10 2006 990 1001
19. S. Malve, and R. Uzsoy A genetic algorithm for minimizing maximum lateness on parallel identical batch processing machines with dynamic job arrivals and incompatible job families Computers and Operations Research 34 2007 3016 3028
20. S.V. Mehta, and R. Uzsoy Minimizing total tardiness on a batch processing machine with incompatible job families IIE Transactions 30 1998 165 178
21. C.L. Monma, and C.N. Potts On the complexity of scheduling with batch setup times Operations Research 37 5 1989 798 804
22. C.N. Potts, and M.Y. Kovalyov Scheduling with batching: a review European Journal of Operational Research 120 2000 228 249
23. S.K. Tangudu, and M.E. Kurz A branch and bound algorithm to minimise total weighted tardiness on a single batch processing machine with ready times and incompatible job families Production Planning and Control 17 2006 728 741
24. R. Uzsoy Scheduling batch processing machines with incompatible job families International Journal of Production Research 33 1995 2685 2708