Solving open job-shop scheduling problems by SAT encoding

Miyuki Koshimura, Hidetomo Nabeshima, Hiroshi Fujita, Ryuzo Hasegawa

研究成果: ジャーナルへの寄稿記事

7 引用 (Scopus)

抜粋

This paper tries to solve open Job-Shop Scheduling Problems (JSSP) by translating them into Boolean Satisfiability Testing Problems (SAT). The encoding method is essentially the same as the one proposed by Crawford and Baker. The open problems are ABZ8, ABZ9, YN1, YN2, YN3, and YN4. We proved that the best known upper bounds 678 of ABZ9 and 884 of YN1 are indeed optimal. We also improved the upper bound of YN2 and lower bounds of ABZ8, YN2, YN3 and YN4.

元の言語英語
ページ(範囲)2316-2318
ページ数3
ジャーナルIEICE Transactions on Information and Systems
E93-D
発行部数8
DOI
出版物ステータス出版済み - 8 2010

    フィンガープリント

All Science Journal Classification (ASJC) codes

  • Software
  • Hardware and Architecture
  • Computer Vision and Pattern Recognition
  • Electrical and Electronic Engineering
  • Artificial Intelligence

これを引用