Job Shop Scheduling by Local Search

DOI Web Site 被引用文献5件
  • R. J. M. Vaessens
    Eindhoven University of Technology, Department of Mathematics and Computing Science, P.O. Box 513, 5600 MB Eindhoven
  • E. H. L. Aarts
    Eindhoven University of Technology, Department of Mathematics and Computing Science, Eindhoven, and Philips Research Laboratories, P.O. Box 80000, 5600 JA Eindhoven
  • J. K. Lenstra
    Eindhoven University of Technology, Department of Mathematics and Computing Science, Eindhoven, and CWI, P.O. Box 94079, 1090 GB Amsterdam

この論文をさがす

抄録

<jats:p> We survey solution methods for the job shop scheduling problem with an emphasis on local search. Both deterministic and randomized local search methods as well as the proposed neighborhoods are discussed. We compare the computational performance of the various methods in terms of their effectiveness and efficiency on a standard set of problem instances. </jats:p>

収録刊行物

  • INFORMS Journal on Computing

    INFORMS Journal on Computing 8 (3), 302-317, 1996-08

    Institute for Operations Research and the Management Sciences (INFORMS)

被引用文献 (5)*注記

もっと見る

キーワード

詳細情報 詳細情報について

問題の指摘

ページトップへ