| Type of Document |
Master's Thesis |
| Author |
Davenport, Catherine Elizabeth, |
| Author's Email Address |
cedavenp@unity.ncsu.edu |
| URN |
etd-12162002-222211 |
| Title |
Optimization in Job Shop Scheduling Using Alternative Routes |
| Degree |
Master of Science |
| Graduate Program |
Operations Research |
| Advisory Committee |
| Advisor Name |
Title |
| Russell King |
Committee Chair |
| Kristin Thoney |
Committee Co-Chair |
| Scott Schultz |
Committee Co-Chair |
| Thom Hodgson |
Committee Member |
|
| Keywords |
- Job shop scheduling
- tabu search
- critical path
|
| Date of Defense |
2002-12-13 |
| Availability |
unrestricted |
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).
|
| Files |
| Filename |
Size |
Approximate Download Time
(Hours:Minutes:Seconds)
|
| 28.8 Modem |
56K Modem |
ISDN (64 Kb) |
ISDN (128 Kb) |
Higher-speed Access |
| |
etd.pdf |
204.24 Kb |
00:00:56 |
00:00:29 |
00:00:25 |
00:00:12 |
00:00:01 |
|
