Citation
Complex Job Shop Multiple Orders per Job Scheduling. In proceedings of the 3rd Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2007), 28 -31 August 2007, Paris, France, pages 225-233, 2007.
Paper
Abstract
Semiconductor manufacturing production scheduling is a challenging task due to process complexity that includes the assignment of customer orders to front opening unified pods (FOUPs), FOUP batch processing, parallel machines, and re-entrant flow. A network-based optimization model and a column generation (CG) heuristic are presented for this problem to minimize the weighted completion time of customer orders. Computational results show that the CG heuristic obtains solutions that are very close to/better than a mixed-integer program-based heuristic (MIP heuristic) for problem instances without order ready times. In the problem instances with order ready times, CG solutions are within 11% of MIP heuristic solutions, but are obtained in seconds rather than hours.
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{2007-225-233-P, author = {J. Jampani and S. J. Mason},
title = {Complex Job Shop Multiple Orders per Job Scheduling},
booktitle = {In proceedings of the 3rd Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2007), 28 -31 August 2007, Paris, France},
year = {2007},
editor = {P. Baptiste and G. Kendall and A. Munier-Kordon and F. Sourd},
pages = {225--233},
note = {Paper},
abstract = {Semiconductor manufacturing production scheduling is a challenging task due to process complexity that includes the assignment of customer orders to front opening unified pods (FOUPs), FOUP batch processing, parallel machines, and re-entrant flow. A network-based optimization model and a column generation (CG) heuristic are presented for this problem to minimize the weighted completion time of customer orders. Computational results show that the CG heuristic obtains solutions that are very close to/better than a mixed-integer program-based heuristic (MIP heuristic) for problem instances without order ready times. In the problem instances with order ready times, CG solutions are within 11% of MIP heuristic solutions, but are obtained in seconds rather than hours.},
owner = {Faizah Hamdan},
timestamp = {2012.05.21},
webpdf = {2007-225-233-P.pdf} }