Succinct representation of linear extensions via MDDs and its application to scheduling under precedence constraints

Fumito Miyake, Eiji Takimoto, kohei hatano

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

抄録

We consider a single machine scheduling problem to minimize total flow time under precedence constraints, which is NP-hard. Matsumoto et al. proposed an exact algorithm that consists of two phases: first construct a Multi-valued Decision Diagram (MDD) to represent feasible permutations of jobs, and then find the shortest path in the MDD which corresponds to the optimal solution. Although their algorithm performs significantly better than standard IP solvers for problems with dense constraints, the performance rapidly diminishes when the number of constraints decreases, which is due to the exponential growth of MDDs. In this paper, we introduce an equivalence relation among feasible permutations and show that it suffices to construct an MDD that maintains only one representative for each equivalence class. Experimental results show that our algorithm outperforms Matsumoto et al.’s algorithm for problems with sparse constraints, while keeping good performance for dense constraints. Moreover, we show that Matsumoto et al.’s algorithm can be extended for solving a more general problem of minimizing weighted total flow time.

元の言語英語
ホスト出版物のタイトルCombinatorial Algorithms - 30th International Workshop, IWOCA 2019, Proceedings
編集者Charles J. Colbourn, Roberto Grossi, Nadia Pisanti
出版者Springer Verlag
ページ365-377
ページ数13
ISBN(印刷物)9783030250041
DOI
出版物ステータス出版済み - 1 1 2019
イベント30th International Workshop on Combinatorial Algorithms, IWOCA 2019 - Pisa, イタリア
継続期間: 7 23 20197 25 2019

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
11638 LNCS
ISSN(印刷物)0302-9743
ISSN(電子版)1611-3349

会議

会議30th International Workshop on Combinatorial Algorithms, IWOCA 2019
イタリア
Pisa
期間7/23/197/25/19

Fingerprint

Linear Extension
Precedence Constraints
Decision Diagrams
Scheduling
Flow Time
Permutation
Single Machine Scheduling
Exponential Growth
Exact Algorithms
Equivalence relation
Equivalence classes
Equivalence class
Shortest path
Scheduling Problem
NP-complete problem
Optimal Solution
Minimise
Decrease
Experimental Results

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

これを引用

Miyake, F., Takimoto, E., & hatano, K. (2019). Succinct representation of linear extensions via MDDs and its application to scheduling under precedence constraints. : C. J. Colbourn, R. Grossi, & N. Pisanti (版), Combinatorial Algorithms - 30th International Workshop, IWOCA 2019, Proceedings (pp. 365-377). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 11638 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-030-25005-8_30

Succinct representation of linear extensions via MDDs and its application to scheduling under precedence constraints. / Miyake, Fumito; Takimoto, Eiji; hatano, kohei.

Combinatorial Algorithms - 30th International Workshop, IWOCA 2019, Proceedings. 版 / Charles J. Colbourn; Roberto Grossi; Nadia Pisanti. Springer Verlag, 2019. p. 365-377 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻 11638 LNCS).

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

Miyake, F, Takimoto, E & hatano, K 2019, Succinct representation of linear extensions via MDDs and its application to scheduling under precedence constraints. : CJ Colbourn, R Grossi & N Pisanti (版), Combinatorial Algorithms - 30th International Workshop, IWOCA 2019, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 巻. 11638 LNCS, Springer Verlag, pp. 365-377, 30th International Workshop on Combinatorial Algorithms, IWOCA 2019, Pisa, イタリア, 7/23/19. https://doi.org/10.1007/978-3-030-25005-8_30
Miyake F, Takimoto E, hatano K. Succinct representation of linear extensions via MDDs and its application to scheduling under precedence constraints. : Colbourn CJ, Grossi R, Pisanti N, 編集者, Combinatorial Algorithms - 30th International Workshop, IWOCA 2019, Proceedings. Springer Verlag. 2019. p. 365-377. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-030-25005-8_30
Miyake, Fumito ; Takimoto, Eiji ; hatano, kohei. / Succinct representation of linear extensions via MDDs and its application to scheduling under precedence constraints. Combinatorial Algorithms - 30th International Workshop, IWOCA 2019, Proceedings. 編集者 / Charles J. Colbourn ; Roberto Grossi ; Nadia Pisanti. Springer Verlag, 2019. pp. 365-377 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{31a45a13700041e6b52ed2f6af80fe73,
title = "Succinct representation of linear extensions via MDDs and its application to scheduling under precedence constraints",
abstract = "We consider a single machine scheduling problem to minimize total flow time under precedence constraints, which is NP-hard. Matsumoto et al. proposed an exact algorithm that consists of two phases: first construct a Multi-valued Decision Diagram (MDD) to represent feasible permutations of jobs, and then find the shortest path in the MDD which corresponds to the optimal solution. Although their algorithm performs significantly better than standard IP solvers for problems with dense constraints, the performance rapidly diminishes when the number of constraints decreases, which is due to the exponential growth of MDDs. In this paper, we introduce an equivalence relation among feasible permutations and show that it suffices to construct an MDD that maintains only one representative for each equivalence class. Experimental results show that our algorithm outperforms Matsumoto et al.’s algorithm for problems with sparse constraints, while keeping good performance for dense constraints. Moreover, we show that Matsumoto et al.’s algorithm can be extended for solving a more general problem of minimizing weighted total flow time.",
author = "Fumito Miyake and Eiji Takimoto and kohei hatano",
year = "2019",
month = "1",
day = "1",
doi = "10.1007/978-3-030-25005-8_30",
language = "English",
isbn = "9783030250041",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "365--377",
editor = "Colbourn, {Charles J.} and Roberto Grossi and Nadia Pisanti",
booktitle = "Combinatorial Algorithms - 30th International Workshop, IWOCA 2019, Proceedings",
address = "Germany",

}

TY - GEN

T1 - Succinct representation of linear extensions via MDDs and its application to scheduling under precedence constraints

AU - Miyake, Fumito

AU - Takimoto, Eiji

AU - hatano, kohei

PY - 2019/1/1

Y1 - 2019/1/1

N2 - We consider a single machine scheduling problem to minimize total flow time under precedence constraints, which is NP-hard. Matsumoto et al. proposed an exact algorithm that consists of two phases: first construct a Multi-valued Decision Diagram (MDD) to represent feasible permutations of jobs, and then find the shortest path in the MDD which corresponds to the optimal solution. Although their algorithm performs significantly better than standard IP solvers for problems with dense constraints, the performance rapidly diminishes when the number of constraints decreases, which is due to the exponential growth of MDDs. In this paper, we introduce an equivalence relation among feasible permutations and show that it suffices to construct an MDD that maintains only one representative for each equivalence class. Experimental results show that our algorithm outperforms Matsumoto et al.’s algorithm for problems with sparse constraints, while keeping good performance for dense constraints. Moreover, we show that Matsumoto et al.’s algorithm can be extended for solving a more general problem of minimizing weighted total flow time.

AB - We consider a single machine scheduling problem to minimize total flow time under precedence constraints, which is NP-hard. Matsumoto et al. proposed an exact algorithm that consists of two phases: first construct a Multi-valued Decision Diagram (MDD) to represent feasible permutations of jobs, and then find the shortest path in the MDD which corresponds to the optimal solution. Although their algorithm performs significantly better than standard IP solvers for problems with dense constraints, the performance rapidly diminishes when the number of constraints decreases, which is due to the exponential growth of MDDs. In this paper, we introduce an equivalence relation among feasible permutations and show that it suffices to construct an MDD that maintains only one representative for each equivalence class. Experimental results show that our algorithm outperforms Matsumoto et al.’s algorithm for problems with sparse constraints, while keeping good performance for dense constraints. Moreover, we show that Matsumoto et al.’s algorithm can be extended for solving a more general problem of minimizing weighted total flow time.

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

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

U2 - 10.1007/978-3-030-25005-8_30

DO - 10.1007/978-3-030-25005-8_30

M3 - Conference contribution

AN - SCOPUS:85069725088

SN - 9783030250041

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 365

EP - 377

BT - Combinatorial Algorithms - 30th International Workshop, IWOCA 2019, Proceedings

A2 - Colbourn, Charles J.

A2 - Grossi, Roberto

A2 - Pisanti, Nadia

PB - Springer Verlag

ER -