The batch loading and scheduling problem

Operations Research

Volumn 49, Issue 1, 2001, Pages 52-65

  Dobson, Gregory ^a   Nambimadom, Ramakrishnan S ^b  

^a UNIVERSITY OF ROCHESTER   (United States)

^b Burning Glass Technologies   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BATCH DATA PROCESSING; COMPUTATION THEORY; HEURISTIC METHODS; INTEGER PROGRAMMING; POLYNOMIALS; SCHEDULING;

BATCH LOADING; BATCH PROCESSORS;

OPERATIONS RESEARCH;

EID: 0035000239     PISSN: 0030364X     EISSN: None     Source Type: Journal    
DOI: 10.1287/opre.49.1.52.11189     Document Type: Article

References (17)

1. Ahmadi, J. H., R. H. Ahmadi, Sriram Dasu, Christopher S. Tang. 1992. Batching and scheduling jobs on batch and discrete processors, Oper. Res. 40 750-763.
2. Chandru, V., C. Y. Lee, R. Uzsoy. 1993a. Minimizing total completion time on batch processing machines. IJPR 31 2097-2122.
3. _, _, _. 1993b. Minimizing total completion time on batch processing machines with job families. OR Lett. 13 61-65.
4. Dobson, G., R. S. Nambimadom. 1994. The batch loading and scheduling problem. Working Paper QM 92-03, Wm. E. Simon Grad. School of Business Administration, University of Rochester, Rochester, NY.
5. Fisher, M. L., R. Jaikumar, L. N. Wassenhove. 1986. A multiplier adjustment procedure for the generalized assignment problem. Management Sci. 32 1095-1103.
6. _. 1981. The Lagrangian relaxation method for solving integer programming problems. Management Sci. 27 1-18.
7. Fowler, J. W., D. T. Phillips, G. L. Hogg. 1991. Strategic control of multiproduct bulk service diffusion/oxidation processes. Sematech Working Paper INEN/MS/WP/03/3-91.
8. Glassey, C. R., and W. W. Weng. 1991. Dynamic batching heuristic for simultaneous processing. IEEE Trans. Semiconductor Manufacturing 4 77-82.
9. Hochbaum, D. S., D. Landy. 1997. Scheduling semiconductor burn-in operations to minimize total flowtime. Oper. Res. 45 874-885.
10. _, _. 1994. Scheduling with batching: minimizing the number of tardy jobs, O. R. Lett. 16 79-86.
11. Ikura, Y., M. Gimple. 1986. Scheduling algorithms for a single batch processing machine. Oper. Res. Lett. 5 61-65.
12. Lee, C. Y., R. Uzsoy, L. A. Martin-Vega. 1992. Efficient algorithms for scheduling semiconductor burn-in operations. Oper. Res. 40 764-775.
13. Lefrancois, P., P. L'Esperance, M. Turmel. 1991. Batching annealing operations to optimize queueing times and furnace efficiency: a simulation model. Working Paper 91-22, Department Operations et Systemes de Decision, Universite Laval, Quebec, Canada.
14. Nemhauser, G. L., L. A. Wolsey. 1988. Integer and Combinatorial Optimization. John Wiley & Sons, New York.
15. Uzsoy, R. 1994. Scheduling a single batch processing machine with non-identical job sizes. IJPR 32 1615-1635.
16. _. 1995. Scheduling batch processing machines with incompatible job families. IJPR 33 2685-2708.
17. Webster, S., K. R. Baker. 1995. Scheduling groups of jobs on a single machine. Oper. Res. 43 692-703.