Coordinating due dates of operations throughout all stages of manufacturing and assembly is a problem especially for complex product structures with uncertainties in process times. A recursive procedure is described to estimate distributions of completion times for each operation. Stage due dates are then calculated to meet speci® ed service targets. Compared with plans from existing heuristic ...

In the scheduling problem addressed in this note we have to determine: (i) the job sequence, (ii) the (common) due-date, and (iii) the location of a rate modifying (maintenance) activity. Jobs scheduled before (after) the due-date are penalized according to their earliness (tardiness) value. The processing time of a job scheduled after the maintenance activity decreases by a job-dependent facto...

This paper studies the single machine scheduling problem for minimizing the expected total weighted deviations of completion times from random common due date. Jobs have exponentially distributed processing times and the common due date is a generalized Erlang distribution. The optimal schedules are shown to be ⁄-shaped. Moreover, we give the optimal schedules when the machine is subject to sto...

The problem considered in this work consists scheduling a set of tasks on single machine, around an unrestrictive common due date to minimize the weighted sum earliness and tardiness. This can be formulated as compact mixed integer program (MIP). In article, we focus neighborhood-based dominance properties, where neighborhood is associated insert swap operations. We derive from these properties...