Optimization in Job Shop Scheduling Using Alternative Routes
| dc.contributor.advisor | Russell King, Committee Chair | en_US |
| dc.contributor.advisor | Kristin Thoney, Committee Co-Chair | en_US |
| dc.contributor.advisor | Scott Schultz, Committee Co-Chair | en_US |
| dc.contributor.advisor | Thom Hodgson, Committee Member | en_US |
| dc.contributor.author | Davenport, Catherine Elizabeth | en_US |
| dc.date.accessioned | 2010-04-02T18:18:48Z | |
| dc.date.available | 2010-04-02T18:18:48Z | |
| dc.date.issued | 2003-01-09 | en_US |
| dc.degree.discipline | Operations Research | en_US |
| dc.degree.level | thesis | en_US |
| dc.degree.name | MS | en_US |
| dc.description.abstract | The ability of a production system to complete orders on time is a critical measure of customer service. While there is typically a preferred routing for a job through the processing machines, often an alternative route is available that can be used to avoid bottleneck operations and improve due date performance. In this paper a heuristic approach is given to dynamically select routing alternatives for a set of jobs to be processed in a job shop. The approach is coupled with a job shop scheduling algorithm developed by Hodgson et al. (1998, 2000) to minimize the latest job (Lmax). | en_US |
| dc.identifier.other | etd-12162002-222211 | en_US |
| dc.identifier.uri | http://www.lib.ncsu.edu/resolver/1840.16/2924 | |
| dc.rights | 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. | en_US |
| dc.subject | Job shop scheduling | en_US |
| dc.subject | tabu search | en_US |
| dc.subject | critical path | en_US |
| dc.title | Optimization in Job Shop Scheduling Using Alternative Routes | en_US |
Files
Original bundle
1 - 1 of 1
