Due Date Assignment, Job Order Release, and Sequencing Interaction in Job Shop Scheduling*

Abstract

Depending on the techniques employed, the due date assignment, release, and sequencing procedures in job shop scheduling may depend on one another. This research investigates the effects of these interactions with a simulation model of a dynamic five-machine job shop in which early shipments are prohibited. Performance of the system is measured primarily in terms of the total cost (work-in-process cost, finished goods holding cost, and late penalty) incurred by the shop, but a number of non-cost performance measures are also reported. The results support existence of a three-way interaction between the due date, release, and sequencing procedures as well as interaction between shop utilization and procedure combination. Statistical tests are used to identify those rules that perform best both overall and in combination with other ~1~s .Subject Areas: Scheduling and Simulation.

On the integration of due date setting and order release control

“…Similarly, the Workload Control literature that has considered the estimation of due dates and order release simultaneously assumes that the pool waiting time is either zero (e.g. Enns, 1995a;Ahmed & Fisher, 1992) or constant for all jobs (Hendry et al, 1998;Thürer et al, 2013 and2014a). To the best of our knowledge, the only study to date to present a method that estimates a dynamic allowance for the pool waiting time was presented by Land (2009).…”

“…Meanwhile, other studies link the processing time and shop load to the delivery time based on historical data via regression (e.g. Ragatz & Mabert, 1984, Ahmed & Fisher, 1992Vig & Dooley, 1993;Moses et al, 2004) or link the workload at a station to the allowance for the operation throughput time (e.g. Nyhuis & Wiendahl, 2009).…”

“…that the delivery time is given by the time a job spends on the shop floor only (e.g. Weeks, 1979;Ragatz & Mabert, 1984;Ahmed & Fisher, 1992;Vig & Dooley, 1993;Moses et al 2004;Thürer et al, 2013). This has limited applicability to shops where the release of jobs is controlled.…”

A methodology for planning and controlling workload in a job-shop: a four-way decision-making problem

“…There is a lot of research on this issue, alone or combined with other decision rules (e.g. Seidmann and Smith 1981, Panwalkar et al 1982, Bertrand 1983a, 1983b, Baker 1984, Ragatz and Mabert 1984, Bobrowski and Park 1989, Vig and Dooley 1991, Ahmed and Fisher 1992, Tsai et al 1997, Sabuncuoglu and Karapinar 2000.…”

A Simulated Annealing-Based Heuristic Algorithm for Job Shop Scheduling to Minimize Lateness

“…The job shop scheduling problem (JSSP) is one of the most frequently adopted models in the area of scheduling research [3][4][5][6]. However, most variants of JSSP are N P-hard in the strong sense and thus defy ordinary solution methods.…”