TY - GEN
T1 - Decision diagrams for solving a job scheduling problem under precedence constraints
AU - Matsumoto, Kosuke
AU - Hatano, Kohei
AU - Takimoto, Eiji
N1 - Funding Information:
Funding This work is supported in part by JSPS KAKENHI Grant Number JP16K00305 and JSPS KAKENHI Grant Number JP15H02667, respectively.
PY - 2018/6/1
Y1 - 2018/6/1
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=85063735643&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85063735643&partnerID=8YFLogxK
U2 - 10.4230/LIPIcs.SEA.2018.5
DO - 10.4230/LIPIcs.SEA.2018.5
M3 - Conference contribution
AN - SCOPUS:85063735643
T3 - Leibniz International Proceedings in Informatics, LIPIcs
SP - 5:1-5:12
BT - 17th Symposium on Experimental Algorithms, SEA 2018
A2 - D'Angelo, Gianlorenzo
PB - Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
T2 - 17th Symposium on Experimental Algorithms, SEA 2018
Y2 - 27 June 2018 through 29 June 2018
ER -