Citation
Multiple Orders Per Job Batch Scheduling With Incompatible Jobs. In proceedings of the 2nd Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2005), 18 -21 July 2005, New York, USA, pages 48-64, 2005.
Paper
Abstract
The growth in demand for semiconductors has been accompanied by intense competition between semiconductor manufacturers to satisfy customer on-time delivery needs. This paper is motivated by scheduling the wafer fabrication phase of 300-mm semiconductor manufacturing, as it contains both batch processing operations and multiple customer orders being grouped into production jobs. The resulting multiple orders per job (MOJ) scheduling problem is presented for the batch-processing environment as exemplified by a diffusion oven. A mixed-integer programming formulation is presented for incompatible job families wherein only jobs that belong to the same family may be grouped together in a batch. This formulation is analyzed using an experimental design to minimize total weighted tardiness. While optimal solutions are attainable for small problem instances in a reasonable amount of computation time, heuristic development is warranted to support the analysis of larger, more practical MOJ batch scheduling problems. Promising heuristic approaches are identified that find near-optimal solutions very quickly.
You can download the pdf of this publication from here
doi
This publication does not have a doi, so we cannot provide a link to the original source
What is a doi?: A doi (Document Object Identifier) is a unique identifier for sicientific papers (and occasionally other material). This provides direct access to the location where the original article is published using the URL http://dx.doi/org/xxxx (replacing xxx with the doi). See http://dx.doi.org/ for more information
URL
This pubication does not have a URL associated with it.
The URL is only provided if there is additional information that might be useful. For example, where the entry is a book chapter, the URL might link to the book itself.
Bibtex
@INPROCEEDINGS{2005-048-064-P, author = {V. Erramilli and S. J. Mason},
title = {Multiple Orders Per Job Batch Scheduling With Incompatible Jobs},
booktitle = {In proceedings of the 2nd Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2005), 18 -21 July 2005, New York, USA},
year = {2005},
editor = {G. Kendall and L. Lei and M. PinedoPaper},
pages = {48--64},
note = {Paper},
abstract = {The growth in demand for semiconductors has been accompanied by intense competition between semiconductor manufacturers to satisfy customer on-time delivery needs. This paper is motivated by scheduling the wafer fabrication phase of 300-mm semiconductor manufacturing, as it contains both batch processing operations and multiple customer orders being grouped into production jobs. The resulting multiple orders per job (MOJ) scheduling problem is presented for the batch-processing environment as exemplified by a diffusion oven. A mixed-integer programming formulation is presented for incompatible job families wherein only jobs that belong to the same family may be grouped together in a batch. This formulation is analyzed using an experimental design to minimize total weighted tardiness. While optimal solutions are attainable for small problem instances in a reasonable amount of computation time, heuristic development is warranted to support the analysis of larger, more practical MOJ batch scheduling problems. Promising heuristic approaches are identified that find near-optimal solutions very quickly.},
owner = {Faizah Hamdan},
timestamp = {2012.05.21},
webpdf = {2005-048-064-P.pdf} }