Decision diagrams for solving a job scheduling problem under precedence constraints

Kosuke Matsumoto, kohei hatano, Eiji Takimoto

研究成果: 著書/レポートタイプへの貢献会議での発言

1 引用 (Scopus)

抜粋

We consider a job scheduling problem under precedence constraints, a classical problem for a single processor and multiple jobs to be done. The goal is, given processing time of n fixed jobs and precedence constraints over jobs, to find a permutation of n jobs that minimizes the total flow time, i.e., the sum of total wait time and processing times of all jobs, while satisfying the precedence constraints. The problem is an integer program and is NP-hard in general. We propose a decision diagram π-MDD, for solving the scheduling problem exactly. Our diagram is suitable for solving linear optimization over permutations with precedence constraints. We show the e ectiveness of our approach on the experiments on large scale artificial scheduling problems.

元の言語英語
ホスト出版物のタイトル17th Symposium on Experimental Algorithms, SEA 2018
編集者Gianlorenzo D'Angelo
出版者Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN(電子版)9783959770705
DOI
出版物ステータス出版済み - 6 1 2018
イベント17th Symposium on Experimental Algorithms, SEA 2018 - L'Aquila, イタリア
継続期間: 6 27 20186 29 2018

出版物シリーズ

名前Leibniz International Proceedings in Informatics, LIPIcs
103
ISSN(印刷物)1868-8969

会議

会議17th Symposium on Experimental Algorithms, SEA 2018
イタリア
L'Aquila
期間6/27/186/29/18

    フィンガープリント

All Science Journal Classification (ASJC) codes

  • Software

これを引用

Matsumoto, K., hatano, K., & Takimoto, E. (2018). Decision diagrams for solving a job scheduling problem under precedence constraints. : G. D'Angelo (版), 17th Symposium on Experimental Algorithms, SEA 2018 (Leibniz International Proceedings in Informatics, LIPIcs; 巻数 103). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.SEA.2018.5