In this paper, a job shop scheduling problem with the objective of minimizing work in process (WIP) subject to meeting due dates constraints is evaluated in a rolling horizon setting. An iterative-adaptive deterministic simulation-based procedure is first used to obtain a feasible solution. This procedure, the Virtual Factory, has been shown to provide near-optimal solutions to industrial-sized problems in seconds for the criterion of minimizing maximum lateness, L<sub>max</sub>. Then, a simulated annealing post-processing procedure is used to determine when to release jobs to minimize WIP while keeping L<sub>max</sub> ≤ 0.
Identifer | oai:union.ndltd.org:NCSU/oai:NCSU:etd-12162002-212521 |
Date | 09 January 2003 |
Creators | Coley, Andrea L |
Contributors | Dr. Thom J. Hodgson, Dr. Russell E. King, Dr. Kristin A. Thoney, Dr. Scott R. Schultz |
Publisher | NCSU |
Source Sets | North Carolina State University |
Language | English |
Detected Language | English |
Type | text |
Format | application/pdf |
Source | http://www.lib.ncsu.edu/theses/available/etd-12162002-212521/ |
Rights | unrestricted, I hereby certify that, if appropriate, I have obtained and attached hereto a written permission statement from the owner(s) of each third party copyrighted matter to be included in my thesis, dissertation, or project report, allowing distribution as specified below. I certify that the version I submitted is the same as that approved by my advisory committee. I hereby grant to NC State University or its agents the non-exclusive license to archive and make accessible, under the conditions specified below, my thesis, dissertation, or project report in whole or in part in all forms of media, now or hereafter known. I retain all other ownership rights to the copyright of the thesis, dissertation or project report. I also retain the right to use in future works (such as articles or books) all or part of this thesis, dissertation, or project report. |
Page generated in 0.0017 seconds