We examine a basic stochastic sequencing model with due dates as decisions. The objective is to make due dates as tight as possible while meeting service level constraints. We develop an optimizing procedure using branch and bound, and we evaluate the performance of heuristic procedures as well.

This paper is concerned with the problem of scheduling preemptive tasks subject to precedence constraints in order to minimize the maximum lateness and the makespan. The number of available parallel processors is allowed to vary in time. It is shown that when an Earliest Due Date rst algorithm provides an optimal nonpreemptive schedule for unit-execution-time (UET) tasks, then the preemptive pr...

We consider a single-machine scheduling problem in which due dates are linear functions of the job waiting-times and the objective is to minimize the maximum lateness. An optimal sequence is constructed by implementing an index-based priority rule for a fixed value of the due date normalizing constant k. We determine in polynomial time all the k value ranges so that the optimal sequence remains...

Due-dates are often determined during sales negotiations between customers and the sales team of the firm. In the preliminary (pre-sale) stage, the customer provides a time interval (due-window) of his preferred due-dates. This interval reflects acceptable leadtimes, which are functions of the customer resource constraints (e.g. storage or personnel limitations). If the due-dates are assigned e...

We present a discrete-time, Mixed Integer Linear Programming (MILP) model for the production scheduling of a continuous-process multi-grade PET resin plant. The objective is to minimize the cost associated with grade changeovers in order to avoid undesirable variations in base resin properties and process conditions that occur during such changes. The constraints of the model include requiremen...