Optimization in Job Shop Scheduling Using Alternative Routes

Job shop scheduling;tabu search;critical path

Davenport, Catherine Elizabeth ; Russell King, Committee Chair,Kristin Thoney, Committee Co-Chair,Scott Schultz, Committee Co-Chair,Thom Hodgson, Committee Member,Davenport, Catherine Elizabeth ; Russell King ; Committee Chair ; Kristin Thoney ; Committee Co-Chair ; Scott Schultz ; Committee Co-Chair ; Thom Hodgson ; Committee Member

University:North Carolina State University

关键词: Job shop scheduling;    tabu search;    critical path;   

Others  :  https://repository.lib.ncsu.edu/bitstream/handle/1840.16/2924/etd.pdf?sequence=1&isAllowed=y

美国|英语

来源: null

【 摘 要 】

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).