Job shop scheduling with modified due dates

Abstract

EXECUTIVE SUMMARYThis paper introduces a new dispatching rule to job shop scheduling, extending earlier results to a multi-machine environment.

Deconstructing bottleneck shiftiness: the impact of bottleneck position on order release control in pure flow shops

“…The MPST rule is a variant of the Modified Operation Due Date (MODD) rule (e.g. Baker & Kanet, 1983).…”

Due Date Management Policies

“…Minimizing tardiness or conditional mean tardiness, which is the average tardiness measured over only the tardy jobs, helps in completing the jobs on or before their due dates, to avoid penalties due to delays, loss of goodwill, expedited shipment, etc. As noted by Baker and Kanet [9], average tardiness is equal to the product of the proportion of tardy jobs and the conditional mean tardiness, hence, looking at the two latter measures separately provides more information about the performance than just looking at the aggregate measure of average tardiness. Minimizing due dates helps in attracting and retaining customers.…”

“…In a related study to [60], Baker and Kanet [9] compare the performance of MDD and MDD o with a number of other well-studied scheduling rules under the TWK due date rule, focusing on the impact of due date tightness and shop utilization. Using industrial data, they note that the average manufacturing capacity utilization in the U.S. ranged from 80 to 90% between 1965 and 1980.…”

“…Scheduling rules based on operation due dates have received limited attention in the literature; but the current results suggest that they are quite promising and in some cases perform better than the corresponding rules based on job due dates [8] [9] [12] [60]. In general, if the variability in the system is low, one can obtain better estimates of ßow times and hence quote more accurate due dates.…”

Relationship between the modified due date rule and the heuristic of Wilkerson and Irwin

“…Among the simple rules, the modified due date (MDD) rule due to Baker and Bertrand (1982) and the heuristic of Wilkerson and Irwin (W-I) (1971) have been found to be very effective in reducing total tardiness and in some cases have been found to produce optimal tardiness schedules (see Baker and Bertrand (1982) and Baker and Kanet (1983)). The W-I heuristic is an example of a pair-wise interchange technique and is based on conditions of local optimality.…”