Coordinated Multistage Scheduling of Parallel Batch-Processing Machines Under Multiresource Constraints

References

• Barua A., Narasimhan R., Uzsoy R., Upasani A. Implementing global factory schedules in the face of stochastic disruptions. Internat. J. Production Res. (2005) 43(4):793–818Crossref, Google Scholar
• Bruno J., Coffman E. G., Sethi R. Scheduling independent tasks to reduce mean finishing time. Comm. Assoc. Comput. Machinery (1974) 17(7):382–387Google Scholar
• Chandru V., Lee C. Y., Uzsoy R. Minimizing total completion time on batch processing machines. Internat. J. Production Res. (1993a) 31(9):2097–2121Crossref, Google Scholar
• Chandru V., Lee C. Y., Uzsoy R. Minimizing total completion time on a batch processing machine with job families. Oper. Res. Lett. (1993b) 13(2):61–65Crossref, Google Scholar
• Dessouky M. M., Leachman R. C. Dynamic models of production with multiple operations and general processing times. J. Oper. Res. Soc. (1997) 48(6):647–654Crossref, Google Scholar
• Dobson G., Nambimadom R. S. The batch loading and scheduling problem. Oper. Res. (2001) 49(1):52–64Link, Google Scholar
• Dupont L., Flipo C. D. Minimizing the makespan on a batch machine with non-identical job sizes: An exact procedure. Comput. Oper. Res. (2002) 29:807–819Crossref, Google Scholar
• Dupont L., Ghazvini F. J. Minimizing makespan on a single batch processing machine with nonidentical job sizes. Eur. J. Automation (1998) 32:431–440Google Scholar
• Glassey C. R., Weng W. W. Dynamic batching heuristic for simultaneous processing. IEEE Trans. Semiconductor Manufacturing (1991) 4(2):77–82Crossref, Google Scholar
• Hochbaum D. S., Landy D. Scheduling semiconductor burn-in operations to minimize total flow time. Oper. Res. (1997) 45(6):874–885Link, Google Scholar
• Jula P., Leachman R. C. Coordinating decentralized local schedulers in complex supply chain manufacturing. Ann. Oper. Res. (2008) 161(1):123–147Crossref, Google Scholar
• Kang J. A method for target scheduling of semiconductor wafer fabrication based on event-based optimization modeling and discrete event simulation. (1996) . Ph.D. dissertation, Department of Industrial Engineering and Operations Research, University of California, BerkeleyGoogle Scholar
• Kempf K. G., Uzsoy R., Wang C. S. Scheduling a single batch processing machine with secondary resource constraints. J. Manufacturing Systems (1998) 17(1):37–51Crossref, Google Scholar
• Koh S. G., Koo P. H., Ha J. W., Lee W. S. Scheduling parallel batch processing machines with arbitrary job sizes and incompatible job families. Internat. J. Production Res. (2004) 42(19):4091–4107Crossref, Google Scholar
• Koh S. G., Koo P. H., Kim D. C., Hur W. S. Scheduling a single batch processing machine with arbitrary job sizes and incompatible job families. Internat. J. Production Econom. (2005) 98(1):81–96Crossref, Google Scholar
• Leachman R. C., Kang J., Lin V. SLIM: Short cycle time and low inventory in manufacturing at Samsung Electronics. Interfaces (2002) 32(1):61–77Link, Google Scholar
• Lee C.-Y., Uzsoy R., Martin-Vega L. A. Efficient algorithms for scheduling semiconductor burn-in operations. Oper. Res. (1992) 40(4):764–775Link, Google Scholar
• Malve S., Uzsoy R. A genetic algorithm for minimizing maximum lateness on parallel identical batch processing machines with dynamic job arrivals and incompatible job families. Comput. Oper. Res. (2007) 34(10):3016–3028Crossref, Google Scholar
• Mathirajan M., Sivakumar A. I. A literature review, classification and simple meta-analysis on scheduling of batch processors in semiconductor. Internat. J. Adv. Manufacturing Tech. (2006) 29(9–10):990–1001Crossref, Google Scholar
• Perez I. C., Fowler J. W., Carlyle W. M. Minimizing total weighted tardiness on a single batch process machine with incompatible job families. Comput. Oper. Res. (2005) 32(2):327–341Crossref, Google Scholar
• Uzsoy R. Scheduling a single batch processing machine with non-identical job sizes. Internat. J. Production Res. (1994) 32(7):1615–1635Crossref, Google Scholar
• Uzsoy R., Yang Y. Minimizing total weighted completion time on a single batch processing machine. Production Oper. Management (1997) 6(1):57–73Crossref, Google Scholar
• Van Der Zee D. J. Dynamic scheduling of batch-processing machines with non-identical product sizes. Internat. J. Production Res. (2007) 45(10):2327–2349Crossref, Google Scholar
• Wang C. S., Uzsoy R. A genetic algorithm to minimize maximum lateness on a batch processing machine. Comput. Oper. Res. (2002) 29(12):1621–1640Crossref, Google Scholar
• Weng W. C. W. Short-term scheduling of semiconductor burn-in. (1992) . Ph.D. dissertation, Department of Industrial Engineering and Operations Research, University of California, BerkeleyGoogle Scholar
• Weng W. C. W., Leachman R. C. An improved methodology for real-time production decisions at batch production work stations. IEEE Trans. Semiconductor Manufacturing (1993) 6(4):219–225Crossref, Google Scholar