Solving open job-shop scheduling problems by SAT encoding

Miyuki Koshimura, Hidetomo Nabeshima, Hiroshi Fujita, Ryuzo Hasegawa

Research output: Contribution to journalArticlepeer-review

13 Citations (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.

Original languageEnglish
Pages (from-to)2316-2318
Number of pages3
JournalIEICE Transactions on Information and Systems
Issue number8
Publication statusPublished - Aug 2010

All Science Journal Classification (ASJC) codes

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


Dive into the research topics of 'Solving open job-shop scheduling problems by SAT encoding'. Together they form a unique fingerprint.

Cite this