Due-date setting and priority sequencing in a multiclass M/G/1 queue

The problem of simultaneous due-date setting and priority sequencing is analyzed in the setting of a multiclass M/G/1 queueing system. The objective is to minimize the weighted average due-date lead time (due-date minus arrival date) of customers subject to a constraint on either the fraction of tardy customers or the average customer tardiness. Several parametric and non-parametric due-date setting policies are proposed that depend on the class of arriving customer, the state of the queueing system at the time of customer arrival, and the sequencing policy (the weighted shortest expected processing time rule) that is used. Simulation results suggest that these policies significantly outperform tra-ditional due-date setting policies and that setting due-dates can have a larger impact on performance than priority sequencing