Minimizing WIP over a Rolling Horizon in a Job Shop

job shop;virtual factory;shceduling;WIP;simulated annealing;rolling horizon

Coley, Andrea L ; Dr. Thom J. Hodgson, Committee Member,Dr. Russell E. King, Committee Co-Chair,Dr. Kristin A. Thoney, Committee Co-Chair,Dr. Scott R. Schultz, Committee Co-Chair,Coley, Andrea L ; Dr. Thom J. Hodgson ; Committee Member ; Dr. Russell E. King ; Committee Co-Chair ; Dr. Kristin A. Thoney ; Committee Co-Chair ; Dr. Scott R. Schultz ; Committee Co-Chair

University:North Carolina State University

关键词: job shop;    virtual factory;    shceduling;    WIP;    simulated annealing;    rolling horizon;   

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

美国|英语

来源: null

【 摘 要 】

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, Lmax.Then, a simulated annealing post-processing procedure is used to determine when to release jobs to minimize WIP while keeping Lmax ≤ 0.