Filtered beam search in scheduling†

References

• AGGARWAL , S. C. and MCCARL , B. A. , 1974 , The development and evaluation of cost-based composite scheduling rule . Naval Research Logistics Quarterly , 21 , 155 – 169 .
   Google Scholar
• BERLINER , H. , 1974 , Chess as problem solving The development of a tactics analyzer . Ph.D. thesis , Carnegie-Mellon University , U.S.A. , March .
   Google Scholar
• CLIFFE , R. W. , and MACMANUS , B. R. , 1980 , An approach to optimization with heuristic methods of scheduling . International Journal of Production Research , 18 , 479 – 490 .
   Web of Science ®Google Scholar
• EMERY , J. C. , 1969 , Job shop scheduling by means of simulation and an optimum-seeking search . In Proceedings of the 3rd Conference on Applications of Simulations , 363 – 372 , Los Angeles , U.S.A. , December .
   Google Scholar
• FISHER , M. L. , 1973 , Optimal solution of scheduling problems using Lagrange multipliers Part I . Operations Research , 21 , 1114 – 1127 .
   Web of Science ®Google Scholar
• FOX , M. S. , 1983 , Constraint-directed search A case study of job-shop scheduling . Ph.D. thesis , Carnegie-Mellon University , U.S.A.
   Google Scholar
• GASCHNIG , J. , 1979 , Performance measurement and analysis of certain search algorithms . Ph.D. thesis , Carnegie-Mellon University , U.S.A. , May .
   Google Scholar
• GELPERIN , D. , 1977 , On the optimality of A⋆ . Artificial Intelligence , 8 , 69 – 76 .
   Web of Science ®Google Scholar
• HARRIS , L. R. , 1973 , The bandwidth heuristic search . In Int. Conf. on Artificial Intelligence , pp. 23 – 29 .
   Google Scholar
• HART , P. , NILSSON , N. J. , and RAPHAEL , B. , 1968 , A formal basis for the heuristic determination of minimum cost paths . IEEE Transaction System Science and Cybernetics , 4 , 100 – 107 .
   Web of Science ®Google Scholar
• HERSHAUER , J. C. and EBBRT , R. J. , 1975 , Search and simulation of a job-shop sequencing rule . Management Science , 21 , 833 – 843 .
   Web of Science ®Google Scholar
• LAWLER , E. L. , and WOODS , D. E. , 1966 , Branch-and-bound methods A survey . Operations Research , 14 , 699 – 719 .
   Web of Science ®Google Scholar
• LOWERRE , B. T. , 1976 , The HARPY speech recognition system . Ph.D. thesis , Carnegie-Mellon University , U.S.A. , April .
   Google Scholar
• MCMAHON , G. B. , and BURTON , P. G. , 1967 , Flow-ship scheduling with the branch-and-bound method . Operations Research , 15 , 473 – 481 .
   Web of Science ®Google Scholar
• MONTAGNE , E. R. , Jr, 1969 , Sequencing with time delay costs . Research Bulletin, Arizona State University , Dept of Industrial Engineering , January .
   Google Scholar
• NILSSON , N. J. , 1971 , Problem-solving methods in artificial intelligence ( New York McGraw-Hill ).
   Google Scholar
• OW , P. S. , 1984 , Heuristic knowledge and search for scheduling . Ph.D. thesis, Graduate School of Industrial Administration , Carnegie-Mellon University , U.S.A.
   Google Scholar
• OW , P. S. , 1985 , Focused scheduling in proportionate flowshops . Management Science , 31 , 852 – 869 .
   Web of Science ®Google Scholar
• PANWALKAR , S. S. , DUDEK , R. A. , and SMITH , M. L. , 1973 , Sequencing research and the industrial scheduling problem . In Symposium on the Theory of Scheduling and its Applications , edited by S. E. Elmaghraby ( Springer-Verlag ), pp. 29 – 37 .
   Google Scholar
• RACHAMADUGU , R. V. , and MORTON , T. E. , 1982 , Myopic heuristic for the single machine weighted tardiness problem . Working Paper 28-81-82, Graduate School of Industrial Administration , Carnegie-Mellon University , U.S.A. , February .
   Google Scholar
• ROSENBLOOM , P. , 1981 , A world championship level Othello program . Technical Report CMU- CS-81-I37 , Carnegie-Mellon University , U.S.A. , August .
   Google Scholar
• RUBIN , S. , 1978 , The ARGOS image understanding system . Ph.D. thesis , Carnegie-Mellon University , U.S.A. , April .
   Google Scholar
• SIDNEY , J. B. , 1977 , Optimal single-machine scheduling with earliness and tardiness penalties . Operations Research , 25 , 62 – 69 .
   Web of Science ®Google Scholar
• STINSON , J. P. , and SMITH , A. W. , 1982 , A heuristic programming procedure for sequencing the static flowshop . International Journal of Production Research , 20 , 753 – 764 .
   Web of Science ®Google Scholar
• VEFSALEINEN , A. , 1984 , State dependent priority rules for scheduling . Ph.D. thesis , Carnegie-Mellon University , U.S.A. , April .
   Google Scholar
• VEPSALFJNEN , A. , RACHAMADUGU , R. V. , and MORTON , T. E. , 1982 , Lead time iteration in flow shop scheduling . Working Paper, Graduate School of Ind. Admin. , Carnegie-Mellon University , U.S.A.
   Google Scholar
• †This research was supported in part by grants from IBM 1-05960 (PATRIARCH), Air Force Office of Scientific Research (F49620-82-K0017), and NL Industry.
   Google Scholar