Decomposition of timed automata for solving scheduling problems

Tatsushi Nishi, Masato Wakatake

Research output: Contribution to journalArticlepeer-review

4 Citations (Scopus)

Abstract

A decomposition algorithm for scheduling problems based on timed automata (TA) model is proposed. The problem is represented as an optimal state transition problem for TA. The model comprises of the parallel composition of submodels such as jobs and resources. The procedure of the proposed methodology can be divided into two steps. The first step is to decompose the TA model into several submodels by using decomposable condition. The second step is to combine individual solution of subproblems for the decomposed submodels by the penalty function method. A feasible solution for the entire model is derived through the iterated computation of solving the subproblem for each submodel. The proposed methodology is applied to solve flowshop and jobshop scheduling problems. Computational experiments demonstrate the effectiveness of the proposed algorithm compared with a conventional TA scheduling algorithm without decomposition.

Original languageEnglish
Pages (from-to)472-486
Number of pages15
JournalInternational Journal of Systems Science
Volume45
Issue number3
DOIs
Publication statusPublished - Mar 1 2014
Externally publishedYes

Keywords

  • coordination
  • decomposition algorithm
  • jobshop scheduling
  • parallel composition
  • timed automata

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Theoretical Computer Science
  • Computer Science Applications

Fingerprint Dive into the research topics of 'Decomposition of timed automata for solving scheduling problems'. Together they form a unique fingerprint.

Cite this