Analysis of material flow in a job shop with assembly operations

REFERENCES

• ADAM , N. R. , BERTRAND , J. W. M. , and SURKIS , J. , 1987 , Priority assignment procedures in multilevel assembly job shops . HE Transactions , 19 , 317 – 328 .
   Google Scholar
• BAKER , K. R. , 1974 , Introduction to Sequencing and Scheduling ( New York John Wiley and Sons ).
   Google Scholar
• BAKBR , K. R. , and KANET , J. J. , 1983 , Job shop scheduling with modified due-dates . Journal of Operations Management , 4 , 11 – 19 .
   Google Scholar
• BAKER , K. R. , and KANET , J. J. , 1984 , Improved decision rules in a combined system for minimizing job tardiness . International Journal of Production Research , 22 , 917 – 921 .
   Web of Science ®Google Scholar
• CARROLL , D. C. , 1965 , Heuristic sequencing of single and multiple component jobs . Unpublished Ph.D. Dissertation , Sloan School of Management, M.I.T.
   Google Scholar
• CHENG , T. C. E. , 1986 , Optimal due-date assignment in a job shop . International Journal of Production Research , 24 , 503 – 515 .
   Web of Science ®Google Scholar
• CHENG , T. C. E. , 1987 , An algorithm for the CON due-date determination and sequencing problem . Computers and Operations Research , 14 , 537 – 542 .
   Web of Science ®Google Scholar
• CHENG , T. C. E. , 1988 , Simulation study of job shop scheduling with due-dates . International Journal of Systems Science , 19 , 383 – 390 .
   Web of Science ®Google Scholar
• CHENG , T. C. E. , and GUPTA , M. C. , 1989 , Survey of scheduling research involving due-date determination decisions . European Journal of Operational Research , 38 , 156 – 166 .
   Web of Science ®Google Scholar
• CONWAY , R. W. , 1965 , Priority dispatching and job lateness in a job shop . Journal of Industrial Engineering , 16 , 228 – 237 .
   Web of Science ®Google Scholar
• CONWAY , R. W. , MAXWELL , W. L. , and MILLER , L. M. , 1967 , Theory of Scheduling ( Reading : Addison-Wesley ).
   Google Scholar
• EILON , S. , and CHOWDHURY , I. G. , 1976 , Due-date in job shop sheduling . international Journal of Production Research , 14 , 223 – 238 .
   Google Scholar
• GABRIEL , K. R. , and LACHENBRUCH , P. A. , 1969 , Non-parametric ANOVA in small samples a Monte Carlo study of the adequacy of the asymptotic approximation . Biometrics , 25 , 593 – 596 .
   Web of Science ®Google Scholar
• GOODWIN , J. S. , and GOODWIN , J. C. , 1982 , Operating policies for scheduling assembled products . Decision Sciences , 13 , 585 – 603 .
   Google Scholar
• GOODWIN , J. S. , and WEEKS , J. K. , 1986 , Evaluating scheduling policies in a multi-level assembly system . International Journal of Production Research , 24 , 247 – 257 .
   Web of Science ®Google Scholar
• HUANG , P. Y. , 1984 , A comparative study of priority dispatching rules in a hybrid assembly job shop . International Journal of Production Research , 22 , 375 – 387 .
   Web of Science ®Google Scholar
• HODGSON , T. J. , 1977 , A note on a single machine sequencing with random processing times . Management Science , 23 , 1144 – 1146 .
   Web of Science ®Google Scholar
• JACKSON , J. R. , 1955 , Scheduling a production line to minimize maximum tardiness . Management Science Research Report , UCLA , California .
   Google Scholar
• JONCKHEERE , A. R. , 1954 , A distibution-free k-sample test against ordered alternatives . Biometrika , 41 , 133 – 145 .
   Web of Science ®Google Scholar
• JONES , C. H. , 1973 , An economic evaluation of job shop dispatching rules . Management Science , 20 , 293 – 299 .
   Web of Science ®Google Scholar
• KRUSKAL , W. H. , and WALLIS , W. A. , 1952 , Use of ranks in one-criterion variance analysis . Journal of the American Statistical Association , 47 , 583 – 621 .
   Web of Science ®Google Scholar
• LITTLE , J. D. C. , 1961 , A proof of the queueing formula L=λW . Operations Research , 9 , 135 – 141 .
   Web of Science ®Google Scholar
• MAXWELL , W. L. , 1969 , Priority dispatching and assembly operations via job shop . Report Rm- 5370-PR , Rand Corporation , California .
   Google Scholar
• MAXWELL , W. L. , 1970 , On sequencing n jobs on one machine to minimize the number of late jobs . Management Science , 16 , 295 – 297 .
   Web of Science ®Google Scholar
• WAXWELL , W. L. , and MEKRA , M. , 1968 , Multiple-factor rules for sequencing with assembly constraints . Naval Research Logistics Quarterly , 15 , 241 – 254 .
   Google Scholar
• MILLER , L. W. , GINSBERG , A. S. , and MAXWELL , W. L. , 1975 , An experimental investigation of priority dispatching in a simple assembly shop . Logistics , edited by M. A. Geisler ( Amsterdam : North-Holland ), pp. 161 – 184 .
   Google Scholar
• MOORE , J. M. , 1968 , An n job one machine sequencing algorithm for minimizing the number of late jobs . Management Science , 15 , 102 – 109 .
   Web of Science ®Google Scholar
• PAN WALKER , S. S. , and ISKANDER , W. , 1977 , A survey of scheduling rules . Operations Research , 25 , 45 – 61 .
   Web of Science ®Google Scholar
• RAGATZ , G. L. , and MABERT , V. A. , 1984 , A framework for the study of due-date management in job shops . International Journal of Production Research , 22 , 685 – 695 .
   Web of Science ®Google Scholar
• RINNOOY KAN , A. H. G. , LAGEWEG , B. J. , and LENSTRA , J. K. , 1975 , Minimizing total costs in one-machine scheduling . Operations Research , 23 , 908 – 927 .
   Web of Science ®Google Scholar
• ROCHETTE , R. , and SADOWSKI , R. P. , 1976 , A statistical comparison of the performance of some simple dispatching rules for a particular set of job shops . International Journal of Production Research , 14 , 63 – 75 .
   Google Scholar
• RUSSELL , R. S. , and TAYLOR , B. W. , III, 1985 a , An evaluation of sequencing rules for an assembly shop . Decision Sciences , 16 , 196 – 212 .
   Web of Science ®Google Scholar
• RUSSELL , R. S. , and TAYLOR , B. W. , III, 1985 b , An evaluation of scheduling policies in a dual resource constrained assembly shop . IIE Transactions , 17 , 219 – 232 .
   Web of Science ®Google Scholar
• SCULLI , D. , 1980 , Priority dispatching rules in job shops with assembly operations and random delays . Omega , 8 , 227 – 234 .
   Web of Science ®Google Scholar
• SCULLI , D. , 1987 , Priority dispatching rule in an assembly shop . Omega , 15 , 49 – 57 .
   Web of Science ®Google Scholar
• SEIDMANN , A. , PANWALKER , S. S. , and SMITH , M. L. , 1981 , Optimal assignment of due-dates for a single processor scheduling problem . International Journal of Production Research , 19 , 393 – 399 .
   Web of Science ®Google Scholar
• SIEGEL , G. B. , 1971 , An investigation of job shop scheduling for jobs with assembly constraints . Unpublished Ph.D. dissertation , Cornell University .
   Google Scholar
• SMITH , W. E. , 1956 , Various optimizers for single-state production . Naval Research Logistics Quarterly , 3 , 59 – 66 .
   Google Scholar
• STURM , L. B. J. M. , 1970 , A simple optimality proof of Moore's sequencing algorithm . Management Science , 17 , 116 – 118 .
   Web of Science ®Google Scholar
• TRILLING , D. R. , 1967 , Job shop simulation of orders that are networks . Journal of Industrial Engineering , 17 , 59 – 68 .
   Google Scholar
• WEEKS , J. K. , 1979 , A simulation study of predictable due-dates . Management Science , 25 , 363 – 373 .
   Web of Science ®Google Scholar
• WEEKS , J. K. , and FRYER , J. S. , 1977 , A methodology of assigning minimum cost due-dates . Management Science , 23 , 1362 – 1371 .
   Web of Science ®Google Scholar