Optimization in Job Shop Scheduling Using Alternative Routes
No Thumbnail Available
Files
Date
2003-01-09
Authors
Journal Title
Series/Report No.
Journal ISSN
Volume Title
Publisher
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).
Description
Keywords
Job shop scheduling, tabu search, critical path
Citation
Degree
MS
Discipline
Operations Research
