Solving Open Job-Shop Scheduling Problems by SAT Encoding

スポンサーリンク

概要

• 論文の詳細を見る

• 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.

著者

• KOSHIMURA Miyuki

  Kyushu University

• NABESHIMA Hidetomo

  University of Yamanashi

• FUJITA Hiroshi

  Kyushu University

• HASEGAWA Ryuzo

  Kyushu University

関連論文

• Solving Open Job-Shop Scheduling Problems by SAT Encoding
• Model Generation with Boolean Constraints
• Solving Open Job-Shop Scheduling Problems by SAT Encoding
• Remarks on Traces of $H^1$-functions Defined in a Domain with Corners
• The Effect of Specimen Diameter on Tensile Behaviors of Aluminum Thin Wires
• Discovery of Solid Deuterium Nuclear Fusion of Pycnodeuterium-Lumps Solidified Locally Within Nano-Pd Particles
• Feature and Sentiment Based Opinion Mining and Summarizing on Twitter
• Feature and Sentiment Based Opinion Mining and Summarizing on Twitter
• ATOM CLUSTERS AND CRYSTAL NUCLEATION

スポンサーリンク