@inproceedings{b47a3111b96d40b5b9a91c46914c4623,
title = "Decomposition of timed automata for solving jobshop scheduling problems",
abstract = "We propose a decomposition algorithm for solving jobshop scheduling problems represented by timed automata (TA). Jobshop scheduling problem is formulated as an optimal state transition problem for the parallel composition of submodels such as jobs and machines. The entire model is decomposed into tractable submodels. The decomposable conditions are provided. In the proposed algorithm, a feasible solution for the entire model is derived through the repeated computation of solving subproblem for each decomposed element. Computational experiments demonstrate the effectiveness of the proposed algorithm for jobshop instances.",
keywords = "Decomposition, Jobshop scheduling, Optimal state transition problem, Timed automata",
author = "Masao Wakatake and Tatsushi Nishi and Masahiro Inuiguchi",
year = "2009",
language = "English",
isbn = "9784907764333",
series = "ICCAS-SICE 2009 - ICROS-SICE International Joint Conference 2009, Proceedings",
pages = "1722--1727",
booktitle = "ICCAS-SICE 2009 - ICROS-SICE International Joint Conference 2009, Proceedings",
note = "ICROS-SICE International Joint Conference 2009, ICCAS-SICE 2009 ; Conference date: 18-08-2009 Through 21-08-2009",
}