We consider a manufacturer, served by a single supplier, who has to quote due dates to arriving customers in a maketo-order production environment. The manufacturer is penalized for long lead times and for missing due dates. To meet due dates, the manufacturer has to obtain components from a supplier. We model this manufacturer and supplier as a two-machine flow shop, consider several variation...

We consider supply chain networks composed of several centrally managed production facilities as well as external suppliers. We design effective heuristics for inventory positioning, order sequencing, and short and reliable due date quotation for this supply chain. We perform extensive computational testing to assess the effectiveness of our algorithms, and we explore the impact of supply chain...

We present a novel model for due date quotation. Jobs arrive at a single server or m-machine flow shop over time. Upon arrival, the processing times on each machine of the job are known, and due dates must be quoted for each job. The jobs are sequenced on the machines without preemption. Associated with each job, there are three measures of disadvantages to the inventory cost and the service le...

We consider a model in which there are m products and for each i=1,...,m, there are ni observations of the service times associated with the th i product. Assuming the service times associated with the th i product follow an exponential distribution with parameter i θ , and i θ 's are independent random variables with a common gamma distribution, with unknown parameters α and β , we provide two...

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...