Decomposition of timed automata for solving jobshop scheduling problems

Masao Wakatake, Tatsushi Nishi, Masahiro Inuiguchi

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

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.

Original languageEnglish
Title of host publicationICCAS-SICE 2009 - ICROS-SICE International Joint Conference 2009, Proceedings
Pages1722-1727
Number of pages6
Publication statusPublished - 2009
Externally publishedYes
EventICROS-SICE International Joint Conference 2009, ICCAS-SICE 2009 - Fukuoka, Japan
Duration: Aug 18 2009Aug 21 2009

Publication series

NameICCAS-SICE 2009 - ICROS-SICE International Joint Conference 2009, Proceedings

Other

OtherICROS-SICE International Joint Conference 2009, ICCAS-SICE 2009
Country/TerritoryJapan
CityFukuoka
Period8/18/098/21/09

Keywords

  • Decomposition
  • Jobshop scheduling
  • Optimal state transition problem
  • Timed automata

ASJC Scopus subject areas

  • Information Systems
  • Control and Systems Engineering
  • Industrial and Manufacturing Engineering

Fingerprint

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

Cite this