A SIMULATION STUDY OF DUE-DATE ASSIGNMENT RULES IN A DYNAMIC JOB-SHOP

This paper is a report of a simulation study that investigates a dynamic approach to scheduling jobs in a multi-machine job shop. The workload information of a job is used in different forms to evaluate the shop performance based on three measures: mean job lateness, percentage of tardy jobs and lateness variance. Different combinations of due-date assignment methods and sequencing rules are compared based on specific performance criteria. The results indicate that using the cumulative distribution function of workload information can yield a better performance than using a proportional function of workload information or ignoring shop congestion information. A few situations are identified in which workload information is not critical.