A practical approach to production scheduling

REFERENCES

• ASHOUR , S. , and HIBEMATH , S. , 1973 , A branch and bound approach to the job shop scheduling problem , Int. J. Prod. Res. , 11 , 47 .
   Google Scholar
• BALAS , E. , 1968 , Machine sequencing via disjunctive graphs an implicit enumeration algorithm , Management Science Research Report 125 , Carnegie-Mellon. University .
   Google Scholar
• BERRY , W. L. , 1972 , Priority scheduling and inventory control in job lot manufacturing systems , A.I.I.E. Trans. , 4 , 267 .
   Google Scholar
• BESTWICK , P. F. , 1976 , Production scheduling by branch and bound , Ph.D. Thesis , University of Bradford .
   Google Scholar
• BESTWICK , P. F. , and HASTINGS , N. A. J. , 1976 , A new bound in machine scheduling , Opl. Res. Q 27 , 479 .
   Google Scholar
• BESTWICK , P. F. , and LOCKYER , K. G. , 1976 , A practical scheduling system for batch production , Proceedings 5th International Seminar on Algorithms for Production Control and Scheduling , Karlovy Vary , Czechoslovakia , pp. 70 – 78 .
   Google Scholar
• BBATLEY , P. , FLORIAK , M. , and ROBILLARD , P. , 1973 , On sequencing with earliest start and due date with application to computing bounds for the (n/m/G/F/ max) problem , Nav. Res. Log. Q. , 20 , 57 .
   Google Scholar
• BROOKS , G. H. , and WHITE , C. R. , 1965 , An algorithm for finding optimal or near optimal solutions to the production scheduling problem , J. Ind. Engng. , 16 , 34 .
   Web of Science ®Google Scholar
• BROWN , A. P. G. , and LOMNICKI , Z. A. , 1966 , Some applications of the branch and bound algorithm to the machine scheduling problem , Opl, Res. Q. , 17 , 173 .
   Google Scholar
• CAMPBELL , H. G. , DUDEK , R. A. , and SMITH , M. L. , 1970 , A heuristic algorithm for the n job m machine sequencing problem , Mgmt. Sci. , 16 , B630 .
   Google Scholar
• CHARLTOK , J. M. , and DEATH , C. C. , 1970 , A method of solution for general machine scheduling problems , Opns. Res. , 18 , 689 .
   Google Scholar
• CONWAY , R. W. , 1965 , Priority dispatching and job lateness in a job shop , J. Ind. Engng. 16 , 228 .
   Web of Science ®Google Scholar
• CONWAY , R. W. , JOHNSON , B. M. , and MAXWELL , W. L. , 1960 , An experimental investigation of priority dispatching , J. Ind. Engng , 11 , 221 .
   Google Scholar
• CONWAY , R. W. , and MAXWELL , W. L. , 1962 , Network dispatching by the shortest operation discipline , Ops Res. , 10 , 51 .
   Web of Science ®Google Scholar
• DEAN , R. H. , and MOODIE , C. L. , 1972 , A dispatching methodology for balancing work load assignments in a job shop production facility , A J.I.E. Trans , 4 , 277 .
   Google Scholar
• EILON , S. , and HORSON , R. M. , 1967 , Job shop scheduling with due dates , Int. J. Prod. Res. , 6 , 1 .
   Web of Science ®Google Scholar
• EILON , S. , and COTTERILL , D. J. , 1968 , A modified SI rule in job shop scheduling , Int. J. Prod. Res. , 7 , 135 .
   Google Scholar
• FLORIAN , M. , TILQUTN , C. , and TILQUIN , G. , 1975 , An implicit enumeration algorithm for complex scheduling problems , Int. J. Prod Res. , 13 , 25 .
   Google Scholar
• FLORIAN , M. , TREPANT , P. , and MCMAHON , G. , 1971 , An implicit enumeration algorithm for the machine scheduling problem , Mgmt Sci. , 17 , B782 .
   Google Scholar
• GERE , W. S. , 1966 , Heuristics in job shop scheduling , Mgmt Sci. , 13 , 167 .
   Google Scholar
• GUPTA , J. N. D. , 1969 , A general algorithm for the nxM flow shop scheduling problem , Int. J. Prod. Res. , 7 , 241 .
   Google Scholar
• HERSHAUER , J. C. , and EBEKT , R. J. , 1975 , Search and simulation selection of a job shop sequencing rul e, Mgmt Sci. , 21 , 833 .
   Web of Science ®Google Scholar
• HOLLOWAY , C. A. , and NELSON , R. T. , 1973 , Alternative formulation of the job shop problem with due dates , Mgmt Sci. , 20 , 65 .
   Web of Science ®Google Scholar
• IGNALL , E. , and SCHRAGE , L. , 1965 , Application of branch and bound techniques to some flow shop scheduling problems , Ops Res. , 13 , 400 .
   Web of Science ®Google Scholar
• JACKSON , R. J. , 1956 , An extension of Johnson's rule on job lot scheduling , Nav. Res. Log. Q. , 3 , 201 .
   Google Scholar
• JOHNSON , S. M. , 1954 , Optimal two and three stage production schedules with set up times included , Nav. Res. Log. Q. , 1 , 61 .
   Google Scholar
• LOMNICKI , Z. A. , 1965 , A branch and bound algorithm for the exact solution of the three machine scheduling problem , Opl. Res. Q. , 16 , 89 .
   Google Scholar
• MCMAHON , G. B. , and BURTON , P. G. , 1967 , Flow shop scheduling with the branch and bound method , Ops Res. , 15 , 473 .
   Web of Science ®Google Scholar
• NABESHIMA , I. , 1967 , Some extensions of the Af-machine scheduling problem , J. Ops. Res. soc. Japan , 10 , 1 .
   Web of Science ®Google Scholar
• NANOT , Y. R. , 1963 , Experimental investigation and comparative evaluation of priority discipline in job shop like queueing networks , Ph.D. Thesis, U.C.L.A; Management Science Research Project, Research Report No. 87, U.C.L.A.
   Google Scholar
• ORAL , M. , and MALOUIN , J. L. , 1973 , Evaluation of the shortest processing time scheduling rule with truncation process , A.I.E.E. Trans. , 5 , 357 .
   Google Scholar
• PALMER , D. S. , 1965 , Sequenceng jobs through multistage process in the minimum total time , Opl Res. Q. , 16 , 101 .
   Google Scholar
• POTTS , C. N. , 1974 , The job-machine scheduling problem , Ph.D. Thesis , University of Birmingham .
   Google Scholar
• REEVES , T. K. , and TURNER , B. A. , 1972 , A theory of organisation and behaviour in batch production factories , Admin. Sci. Q. , 17 , 81 .
   Web of Science ®Google Scholar
• ROY , B. , 1962 , Cheminement et connexite dans les graphes applications aux problémes d'ordonnancement , METRA Série Spéciale No, 1, Société d'économie et de mathématiques appliquées , ( Paris ).
   Google Scholar