An Assignment Algorithm of Due Date in a Dynamic Job Shop

Abstract

This paper develops an algorithm for due date assignment in a dynamic job shop. The objective is to provide an earlier due date for a newly ordered job to a customer, based on a feasible schedule for the already scheduled jobs and the newly ordered job. The proposed algorithm is based on a certain static job shop scheduling to meet due dates, and determines a new schedule under due date constraints for the already scheduled jobs so as to approximately assign the earliest due date for the newly ordered job. Thus, the producing agency proposes an earlier due date and then the producer and customer agree on a final due date.