Decision diagrams for solving a job scheduling problem under precedence constraints

Kosuke Matsumoto, kohei hatano, Eiji Takimoto

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

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.

Original languageEnglish
Title of host publication17th Symposium on Experimental Algorithms, SEA 2018
EditorsGianlorenzo D'Angelo
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN (Electronic)9783959770705
DOIs
Publication statusPublished - Jun 1 2018
Event17th Symposium on Experimental Algorithms, SEA 2018 - L'Aquila, Italy
Duration: Jun 27 2018Jun 29 2018

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
Volume103
ISSN (Print)1868-8969

Conference

Conference17th Symposium on Experimental Algorithms, SEA 2018
CountryItaly
CityL'Aquila
Period6/27/186/29/18

Fingerprint

Scheduling
Processing
Experiments

All Science Journal Classification (ASJC) codes

  • Software

Cite this

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

Decision diagrams for solving a job scheduling problem under precedence constraints. / Matsumoto, Kosuke; hatano, kohei; Takimoto, Eiji.

17th Symposium on Experimental Algorithms, SEA 2018. ed. / Gianlorenzo D'Angelo. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2018. (Leibniz International Proceedings in Informatics, LIPIcs; Vol. 103).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Matsumoto, K, hatano, K & Takimoto, E 2018, Decision diagrams for solving a job scheduling problem under precedence constraints. in G D'Angelo (ed.), 17th Symposium on Experimental Algorithms, SEA 2018. Leibniz International Proceedings in Informatics, LIPIcs, vol. 103, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 17th Symposium on Experimental Algorithms, SEA 2018, L'Aquila, Italy, 6/27/18. https://doi.org/10.4230/LIPIcs.SEA.2018.5
Matsumoto K, hatano K, Takimoto E. Decision diagrams for solving a job scheduling problem under precedence constraints. In D'Angelo G, editor, 17th Symposium on Experimental Algorithms, SEA 2018. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. 2018. (Leibniz International Proceedings in Informatics, LIPIcs). https://doi.org/10.4230/LIPIcs.SEA.2018.5
Matsumoto, Kosuke ; hatano, kohei ; Takimoto, Eiji. / Decision diagrams for solving a job scheduling problem under precedence constraints. 17th Symposium on Experimental Algorithms, SEA 2018. editor / Gianlorenzo D'Angelo. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2018. (Leibniz International Proceedings in Informatics, LIPIcs).
@inproceedings{5fd72bc9873e4fb7bde7082e7dddb7cd,
title = "Decision diagrams for solving a job scheduling problem under precedence constraints",
abstract = "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.",
author = "Kosuke Matsumoto and kohei hatano and Eiji Takimoto",
year = "2018",
month = "6",
day = "1",
doi = "10.4230/LIPIcs.SEA.2018.5",
language = "English",
series = "Leibniz International Proceedings in Informatics, LIPIcs",
publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",
editor = "Gianlorenzo D'Angelo",
booktitle = "17th Symposium on Experimental Algorithms, SEA 2018",

}

TY - GEN

T1 - Decision diagrams for solving a job scheduling problem under precedence constraints

AU - Matsumoto, Kosuke

AU - hatano, kohei

AU - Takimoto, Eiji

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

BT - 17th Symposium on Experimental Algorithms, SEA 2018

A2 - D'Angelo, Gianlorenzo

PB - Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing

ER -