In this study we compare the cycle-time and on-time-delivery performance of the Critical Ratio (CR), the Earliest Due Date (EDD), and the Operation Due Date (ODD) dispatching rules in semiconductor wafer manufacturing. In addition, we comment on the robustness of the rules to low target flow factor values. It turns out that EDD has almost no positive effect on on-time delivery compared to First...

The input-queued switching architecture is becoming an attractive alternative for high speed switches owing to its scalability. Tremendous eeorts have been made to overcome the throughput problem caused by the contentions occurred at input and output sides of a switch. Existing input queueing algorithms mostly aim at improving through-put without considering QoS features. In this paper, a new a...

Yet, the few existing models considering learning effects in scheduling concentrate on learning-by-doing (autonomous learning). But recent contributions to the literature on learning in manufacturing organizations emphasize the important impact of proactive investments in technological knowledge on the learning rate (induced learning). In the present paper, we focus on a scheduling problem wher...

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

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