検索結果 10 件

デジタル記事
越村, 三幸, Nabeshima, Hidetomo, Fujita, Hiroshi, Hasegawa, Ryuzo電子情報通信学会2010-08IEICE Transactions on Information and SystemsE93-D 8p.2316-2318
インターネットで読める全国の図書館
  • 件名Combinatorial problem Job-shop scheduling Makespan SAT encoding Scheduling
  • 関連情報...on and Systems || E93-D(8) || p2316-2318 http://www.ieice.o...
記事
2010IEICE TRANSACTIONS on Information and SystemsE93-D・8p.2316-2318
全国の図書館
記事
2010IEICE TRANSACTIONS on Information and SystemsE93-D・8p.2316-2318
全国の図書館
記事
2010Journal of IEICE Transactions on Information and SystemsE93.D(8)p.2316-2318
全国の図書館
デジタル記事
KOSHIMURA Miyuki, NABESHIMA Hidetomo, FUJITA Hiroshi, HASEGAWA Ryuzo2010IEICE Transactions on Information and SystemsE93-D 8p.2316-2318
インターネットで読める全国の図書館
  • 要約等This paper tries to solve open Job-Shop Scheduling Problems (JSSP) by translating th......m into Boolean Satisfiability Testing Problems (SAT). The encoding method is esse......e one proposed by Crawford and Baker. The open problems are ABZ8, ABZ9, YN1, YN2, YN3...
  • 件名makespan job-shop scheduling SAT encoding scheduling combinatorial problem
記事
2010IEICE TRANSACTIONS on Information and Systems (Letter)Vol.E93-Dp.2316-2318
全国の図書館
記事
2010IEICE Trans.on Information and Systems Vol.E93-Dp.2316-2318
全国の図書館
デジタル記事
2010IEICE Transactions on Information and SystemsE93-D 8p.2316-2318
インターネットで読める全国の図書館
  • 要約等This paper tries to solve open Job-Shop Scheduling Problems (JSSP) by translating th......m into Boolean Satisfiability Testing Problems (SAT). The encoding method is esse......e one proposed by Crawford and Baker. The open problems are ABZ8, ABZ9, YN1, YN2, YN3...
  • 件名combinatorial problem scheduling SAT encoding job-shop scheduling makespan
  • 参照Modeling and Solving Scheduling in Overloaded ......ted Partial MaxSAT Non-Crossover ......m for Flexible Job-Shop Scheduling Problem
記事
2010IEICE TRANSACTIONS on Information and Systems (Letter)Vol.E93-D, No.8p.2316-2318
全国の図書館
記事
2010IEICE TRANS. on Information and Systemsvol.E93-D-8p.2316-2318
全国の図書館

検索結果は以上です。