Effect of load, processing time and due date variation on the effectiveness of scheduling rules

In real manufacturing environments, variations in production factors (i.e. processing time, demand, due-dates) are inevitable facts. All these dynamic changes, together with random disturbances (e.g. machine breakdowns) can seriously affect the system performance. In this paper we focus on load, processing time and due date variation and analyse their impacts on a scheduling system. Specifically, we investigate the impact of variation on dispatching policies in a job shop environment via simulation. The statistical analysis of the results leads to two major conclusions: first, the relative performance of rules is not threatened much by PV (processing time variation), LV (load variation) or DDV (due date variation) -- a result that can be a consolation for practitioners in the field. Secondly, the performance of the rules deteriorates, in particular at high levels of PV, LV and DDV -- a result that can provide new insights into the problem and produces useful information for researchers in their continuous effort to develop better dispatching rules.

[1]  R. D. Foley,et al.  On Pinedo's Conjecture for Scheduling in a Stochastic Flow Shop , 1985, Oper. Res..

[2]  Ihsan Sabuncuoglu,et al.  Rescheduling frequency in an FMS with uncertain processing times and unreliable machines , 1999 .

[3]  Ranga V. Ramasesh.  Dynamic job shop scheduling: A survey of simulation research , 1990 .

[4]  Michael Pinedo,et al.  The "Largest Variance First" Policy in Some Stochastic Scheduling Problems , 1987, Oper. Res..

[5]  John J. Kanet,et al.  Note-On Anomalies in Dynamic Ratio Type Scheduling Rules: A Clarifying Analysis , 1982 .

[6]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

[7]  Esther Frostig,et al.  A Stochastic Scheduling Problem with Intree Precedence Constraints , 1988, Oper. Res..

[8]  Donald C Carroll,et al.  Heuristic sequencing of single and multiple component jobs. , 1965 .

[9]  Michael P. Hottenstein,et al.  Expediting in Job-Order-Control Systems: A Simulation Study , 1970 .

[10]  Samuel Eilon,et al.  Due dates in job shop scheduling , 1976 .

[11]  Kenneth R. Baker,et al.  Sequencing Rules and Due-Date Assignments in a Job Shop , 1984 .

[12]  C. Jones.  An Economic Evaluation of Job Shop Dispatching Rules , 1973 .

[13]  Richard H. Deane,et al.  A Loading and Balancing Methodology for Job Shop Control , 1974 .

[14]  Edward C. Sewell,et al.  Heuristic, optimal, static, and dynamic schedules when processing times are uncertain , 1997 .

[15]  C. T. Baker,et al.  Simulation of a Simplified Job Shop , 1960 .

[16]  Larry R. Taube,et al.  Time completion for various dispatching rules in job shops , 1983 .

[17]  Richard Walter Conway,et al.  An Experimental Investigation of Priority Assignment in a Job Shop , 1964 .

[18]  Michael Pinedo,et al.  Minimizing the Expected Makespan in Stochastic Flow Shops , 1982, Oper. Res..

[19]  James K. Weeks,et al.  A Methodology for Assigning Minimum Cost Due-Dates , 1977 .

[20]  Ari P. J. Vepsalainen.  Priority rules for job shops with weighted tardiness costs , 1987 .