Analysis of material flow in a job shop with assembly operations

SUMMARY Facing competitive pressure from both domestic and foreign sources, today's manufacturers must strive to keep delivery promises and reduce inventory. This depends largely on a manufacturer's ability to predict job flowtimes reliably, hence allowing the assignment of accurate and attainable due-dates. An approximation method is presented to estimate the mean and standard deviation of job flowtimes in a dynamic job shop with assembly operations. The accuracy of the method for predicting the flowtimes of jobs with varying structural complexities is assessed through computer simulation. While in general it is more accurate for jobs with simpler structure, the simulation results indicate that, over a range of test conditions, the approximation method is both simple and effective for estimating job flowtimes in assembly shops.

[1]  W. Maxwell.  On Sequencing n Jobs on One Machine to Minimize the Number of Late Jobs , 1970 .

[2]  James K. Weeks.  A Simulation Study of Predictable Due-Dates , 1979 .

[3]  A. R. Jonckheere,et al.  A DISTRIBUTION-FREE k-SAMPLE TEST AGAINST ORDERED ALTERNATIVES , 1954 .

[4]  Kenneth R. Baker,et al.  Improved decision rules in a combined system for minimizing job tardiness , 1984 .

[5]  William L. Maxwell,et al.  Theory of scheduling , 1967 .

[6]  D. Sculli.  Priority dispatching rules in an assembly shop , 1987 .

[7]  Wayne E. Smith.  Various optimizers for single‐stage production , 1956 .

[8]  T.C.E. Cheng.  Simulation study of job shop scheduling with due dates , 1988 .

[9]  S. S. Panwalkar,et al.  Optimal assignment of due-dates for a single processor scheduling problem , 1981 .

[10]  T.C.E. Cheng,et al.  Survey of scheduling research involving due date determination decisions , 1989 .

[11]  Peter A. Lachenbruch,et al.  270 Note: Non-Parametric ANOVA in Small Samples: A Monte Carlo Study of the Adequacy of the Asymptotic Approximation , 1969 .

[12]  T.C.E. Cheng.  Optimal due-date assignment in a job shop† , 1986 .

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

[14]  Kenneth R. Baker,et al.  Job shop scheduling with modified due dates , 1983 .

[15]  Randall P. Sadowski,et al.  A statistical comparison of the performance of simple dispatching rules for a particular set of job shops , 1976 .

[16]  Philip Y. Huang,et al.  A comparative study of priority dispatching rules in a hybrid assembly/job shop , 1984 .

[17]  W. Kruskal,et al.  Use of Ranks in One-Criterion Variance Analysis , 1952 .

[18]  S. S. Panwalkar,et al.  A Survey of Scheduling Rules , 1977, Oper. Res..

[19]  J. M. Moore.  An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs , 1968 .

[20]  L. B. J. M. Sturm.  A Simple Optimality Proof of Moore's Sequencing Algorithm , 1970 .

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

[22]  Gerald Benjamin Siegel.  An investigation of job shop scheduling for jobs with assembly constraints , 1971 .

[23]  A. J. Clewett,et al.  Introduction to sequencing and scheduling , 1974 .

[24]  T. C. Edwin Cheng,et al.  An algorithm for the con due-date determination and sequencing problem , 1987, Comput. Oper. Res..

[25]  William L. Maxwell,et al.  Multiple‐factor rules for sequencing with assembly constraints , 1968 .

[26]  Gary L. Ragatz,et al.  A framework for the study of due date management in job shops , 1984 .

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

[28]  Thom J. Hodgson,et al.  Note---A Note on Single Machine Sequencing with Random Processing Times , 1977 .

[29]  Bernard W. Taylor,et al.  An evaluation of scheduling policies in a dual resource constrained assembly shop , 1985 .

[30]  B. J. Lageweg,et al.  Minimizing Total Costs in One-Machine Scheduling , 1975, Oper. Res..

[31]  Jwm Will Bertrand,et al.  Priority assignment procedures in multi-level assembly job shops , 1987 .

[32]  Jack S. Goodwin,et al.  Evaluating Scheduling Policies in a Multi-Level Assembly System , 1986 .

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

[34]  Bernard W. Taylor,et al.  AN EVALUATION OF SEQUENCING RULES FOR AN ASSEMBLY SHOP , 1985 .

[35]  James C. Goodwin,et al.  OPERATING POLICIES FOR SCHEDULING ASSEMBLED PRODUCTS , 1982 .

[36]  D Sculli.  Priority dispatching rules in job shops with assembly operations and random delays , 1980 .