Twofold look-ahead search for multi-criterion job shop scheduling

References

• ANDERSON , E. J. ,NYIRENDA, J. C, 1990 , Two new rules to minimize tardiness in a job shop . International Journal of Production Research, | v28|v( 12 ), 2277 – 2292 .
   Web of Science ®Google Scholar
• ANDERSON , J. R. , 1980 , Cognitive Psychology and Its Implications ( San Francisco Freeman ),pp. 257 – 295 .
   Google Scholar
• BAKER , R. K. , 1974 , Introduction to Sequencing and Scheduling ( New York John Wiley & Sons ).
   Google Scholar
• BAKER , R. K. , 1984 , Sequencing rules and due-date assignments in a job shop . Management Science, | v30|v( 9 ), 1093 – 1104 .
   Web of Science ®Google Scholar
• BROOKS , G. H. and WHITE , C. R. , 1965 , An algorithm for finding to the production scheduling problem . Journal of Industrial Engineering, | v16|v( 1 ), 34 – 40 .
   Web of Science ®Google Scholar
• CHANG , Y. , MATSUO , H. and SULLIVAN , R. S. , 1989 , A bottleneck-based beam search for job scheduling in a flexible manufacturing system . International Journal of roduction Research, | v27|v( 11 ), 1949-1961 .
   Web of Science ®Google Scholar
• Fox , M. S. and SMITH , S. F. , 1984 , ISIS—a knowledge-based system for factory scheduling . Expert Systems, | v1|v( 1 ), 25 – 49 .
   Google Scholar
• HUANG , D. , ENKAWA , T. ,AKIBA, M, 1991 , Generation of a new dispatching rule for the mean tardiness job shop scheduling problem through the application of machine learning concepts (in Japanese) . Journal of Japan Industrial Management Association, | v41|v( 6 ), 383 – 389 .
   Google Scholar
• ITOH , K. , 1990 , Search technique and its applications to production control (in Japanese) . Journal of Japan Industrial Management Association, | v40|v( 6B ), pB88–B97 p.
   Google Scholar
• ITOH , K. , HUANG , D. and ENKAWA , T. , 1991 , Twofold look-ahead search and its application to job shop scheduling (in Japanese) . Journal of Japan Industrial Management Association, | v42|v( 5 ), 373 – 381 .
   Google Scholar
• KEMPF , K. G. , 1989 , Manufacturing planning and scheduling where we are and where we need to be . Proceedings of IEEE Fifth Conference on Artificial Intelligence Application, Miami, pp. 14 – 19 .
   Google Scholar
• Ow , P. S. and MORTON , T. E. , 1988 , Filtered beam search in scheduling . International Journal of Production Research, | v26|v( 1 ), 35 – 62 .
   Web of Science ®Google Scholar
• PANWALKER , S. S. and ISKANDER , W. , 1977 , A survey of scheduling rules . Operations Research, | v25|v( 1 ), 45 – 69 .
   Web of Science ®Google Scholar
• SCHULTZ , C. R. , 1989 , An expediting heuristic for the shortest processing time dispatching rule . International Journal of Production Research, | v27|v( 1 ), 31 – 41 .
   Web of Science ®Google Scholar
• SEN , T. and GUPTA , S. K. , 1982 , A branch and bound procedure to solve a bicriterion scheduling problem . HE Transactions, | v15|v( 1 ), 84 – 88 .
   Google Scholar
• SEN , T. , RAISZADEH , F. M. E. and DILEEPAN , P. , 1988 , A branch-and-bound approach to the bicriterion scheduling problem involving total flowtime and range of lateness . Management Science, | v34|v( 2 ), 254 – 260 .
   Web of Science ®Google Scholar
• STEFFEN , M. S. , 1986 , A survey of artificial intelligence-based scheduling systems . Industrial Engineering Conference Proceedings, Boston , Fall , pp. 141 – 144 .
   Google Scholar
• VAN WASSENHOVE , L. N. and BAKER , K. R. , 1982 , Abicriterion approach to time/cost trade-offs in sequencing . European Journal of Operational Research, | v11|v, 48 – 54 .
   Google Scholar
• VAN WASSENHOVE , L. K. , and GELDERS , L. F. , 1980 , Solving a bicriterion scheduling problem . European Journal of Operational Research, 4 , 42 – 48 .
   Web of Science ®Google Scholar