Efficient simulation/optimization of dispatching priority with “fake” processing time

Abstract

An efficient simulation/optimization approach is presented for finding a dynamic dispatching priority in a static job shop environment under the presence of multiple identical jobs. The key ingredients of the proposed approach are (1) an efficient processingtime-based dispatching rule, (2) simulation of a job shop, and (3) a mechanism to "fake" (or modify) job processing times based on the information of job slack obtained from simulation.