Solving open job-shop scheduling problems by SAT encoding

Miyuki Koshimura, Hidetomo Nabeshima, Hiroshi Fujita, Ryuzo Hasegawa

Research output: Contribution to journalArticle

7 Citations (Scopus)

Abstract

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
VolumeE93-D
Issue number8
DOIs
Publication statusPublished - Aug 2010

Fingerprint

Testing
Job shop scheduling

All Science Journal Classification (ASJC) codes

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

Cite this

Solving open job-shop scheduling problems by SAT encoding. / Koshimura, Miyuki; Nabeshima, Hidetomo; Fujita, Hiroshi; Hasegawa, Ryuzo.

In: IEICE Transactions on Information and Systems, Vol. E93-D, No. 8, 08.2010, p. 2316-2318.

Research output: Contribution to journalArticle

Koshimura, Miyuki ; Nabeshima, Hidetomo ; Fujita, Hiroshi ; Hasegawa, Ryuzo. / Solving open job-shop scheduling problems by SAT encoding. In: IEICE Transactions on Information and Systems. 2010 ; Vol. E93-D, No. 8. pp. 2316-2318.
@article{7ea8d1057a3c483ba003bb51e6ffdcd7,
title = "Solving open job-shop scheduling problems by SAT encoding",
abstract = "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.",
author = "Miyuki Koshimura and Hidetomo Nabeshima and Hiroshi Fujita and Ryuzo Hasegawa",
year = "2010",
month = "8",
doi = "10.1587/transinf.E93.D.2316",
language = "English",
volume = "E93-D",
pages = "2316--2318",
journal = "IEICE Transactions on Information and Systems",
issn = "0916-8532",
publisher = "一般社団法人電子情報通信学会",
number = "8",

}

TY - JOUR

T1 - Solving open job-shop scheduling problems by SAT encoding

AU - Koshimura, Miyuki

AU - Nabeshima, Hidetomo

AU - Fujita, Hiroshi

AU - Hasegawa, Ryuzo

PY - 2010/8

Y1 - 2010/8

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

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

UR - http://www.scopus.com/inward/record.url?scp=77956054477&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77956054477&partnerID=8YFLogxK

U2 - 10.1587/transinf.E93.D.2316

DO - 10.1587/transinf.E93.D.2316

M3 - Article

AN - SCOPUS:77956054477

VL - E93-D

SP - 2316

EP - 2318

JO - IEICE Transactions on Information and Systems

JF - IEICE Transactions on Information and Systems

SN - 0916-8532

IS - 8

ER -