Lagrangian relaxation technique for solving scheduling problems by decomposition of timed Petri nets

Tatsushi Nishi, Kenichi Shimatani, Masahiro Inuiguchi

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

2 Citations (Scopus)

Abstract

In this paper, we propose Lagrangian relaxation technique for solving scheduling problems by decomposition of timed Petri nets. The scheduling problem is represented by the transition firing sequence problem to minimize a given objective function. The timed Petri net is decomposed into several subnets so that the subproblem for each subnet can be easily solved by a shortest path algorithm. The optimality of solution can be evaluated by the duality gap derived by Lagrangian relaxation method. The performance of the proposed method is compared with the conventional optimization algorithm with penalty function method. The results show that the duality gap within 1.5% can be derived for AGVs routing problems. The effectiveness of the proposed method is demonstrated by comparing the performance between the conventional method.

Original languageEnglish
Title of host publicationProceedings of the 17th World Congress, International Federation of Automatic Control, IFAC
Edition1 PART 1
DOIs
Publication statusPublished - 2008
Externally publishedYes
Event17th World Congress, International Federation of Automatic Control, IFAC - Seoul, Korea, Republic of
Duration: Jul 6 2008Jul 11 2008

Publication series

NameIFAC Proceedings Volumes (IFAC-PapersOnline)
Number1 PART 1
Volume17
ISSN (Print)1474-6670

Other

Other17th World Congress, International Federation of Automatic Control, IFAC
CountryKorea, Republic of
CitySeoul
Period7/6/087/11/08

Keywords

  • Dependable manufacturing systems control
  • Discrete event systems in manufacturing
  • Job and activity scheduling

ASJC Scopus subject areas

  • Control and Systems Engineering

Fingerprint Dive into the research topics of 'Lagrangian relaxation technique for solving scheduling problems by decomposition of timed Petri nets'. Together they form a unique fingerprint.

Cite this