JOB SHOPS SCHEDULING WITH DUE DATES

Abstract
A simulation model is developed for a jobbing shop, which consists of two identical machines operating in parallel. Jobs, which have a Poissonian arrival, join a single queue and can be processed on either machine. The jobs have an estimated processing time, which is generated from a negative exponential distribution. The actual processing times, however, are subject to variation; deviations from the estimated times follow a normal distribution. Due dates for completing the jobs are quoted, based on estimated process times and on arrival times. The object of the study is first to compare five loading rules for several rates of arrivals, and secondly to suggest how more realistic due dates can be quoted.

This publication has 0 references indexed in Scilit: