The Batch Loading and Scheduling Problem

References

  • Ahmadi J. H., Ahmadi R. H., Dasu Sriram, Tang Christopher S. Batching and scheduling jobs on batch and discrete processors. Oper. Res. (1992) 40:750–763LinkGoogle Scholar
  • Chandru V., Lee C. Y., Uzsoy R. Minimizing total completion time on batch processing machines. IJPR (1993a) 31:2097–2122CrossrefGoogle Scholar
  • Chandru V., Lee C. Y., Uzsoy R. Minimizing total completion time on batch processing machines with job families. OR Lett. (1993b) 13:61–65CrossrefGoogle Scholar
  • Dobson G., Nambimadom R. S. The batch loading and scheduling problem. (1994) . Working Paper QM 92-03, Wm. E. Simon Grad. School of Business Administration, University of Rochester, Rochester, NYGoogle Scholar
  • Fisher M. L., Jaikumar R., Wassenhove L. N. A multiplier adjustment procedure for the generalized assignment problem. Management Sci. (1986) 32:1095–1103LinkGoogle Scholar
  • Fisher M. L. The Lagrangian relaxation method for solving integer programming problems. Management Sci. (1981) 27:1–18LinkGoogle Scholar
  • Fowler J. W., Phillips D. T., Hogg G. L. Strategic control of multiproduct bulk service diffusion/oxidation processes. (1991) . Sematech Working Paper INEN/MS/WP/03/3-91Google Scholar
  • Glassey C. R., Weng W. W. Dynamic batching heuristic for simultaneous processing. IEEE Trans. Semiconductor Manufacturing (1991) 4:77–82CrossrefGoogle Scholar
  • Hochbaum D. S., Landy D. Scheduling semiconductor burn-in operations to minimize total flowtime. Oper. Res. (1997) 45:874–885LinkGoogle Scholar
  • Hochbaum D. S., Landy D. Scheduling with batching: minimizing the number of tardy jobs. O. R. Lett. (1994) 16:79–86CrossrefGoogle Scholar
  • Ikura Y., Gimple M. Scheduling algorithms for a single batch processing machine. Oper. Res. Lett. (1986) 5:61–65CrossrefGoogle Scholar
  • Lee C. Y., Uzsoy R., Martin-Vega L. A. Efficient algorithms for scheduling semiconductor burn-in operations. Oper. Res. (1992) 40:764–775LinkGoogle Scholar
  • Lefrancois P., L'Esperance P., Turmel M. Batching annealing operations to optimize queueing times and furnace efficiency: a simulation model. (1991) . Working Paper 91-22, Department Operations et Systemes de Decision, Universite Laval, Quebec, CanadaGoogle Scholar
  • Nemhauser G. L., Wolsey L. A.Integer and Combinatorial Optimization (1988) (John Wiley & Sons, New York) CrossrefGoogle Scholar
  • Uzsoy R. Scheduling a single batch processing machine with non-identical job sizes. IJPR (1994) 32:1615–1635CrossrefGoogle Scholar
  • Uzsoy R. Scheduling batch processing machines with incompatible job families. IJPR (1995) 33:2685–2708CrossrefGoogle Scholar
  • Webster S., Baker K. R. Scheduling groups of jobs on a single machine. Oper. Res. (1995) 43:692–703LinkGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.