A Heuristic based on Petri Nets modeling for FMS Scheduling problem of makespan minimization

Author

Morandin, O., Jr. ; Kato, E.R.R. ; Maggio, E.G.R. ; Sanches, D.S. ; Deriz, A.C.

Author_Institution

Fed. Univ. of Sao Carlos, Sao Carlos

fYear

2007

fDate

5-8 Nov. 2007

Firstpage

2683

Lastpage

2688

Abstract

The Petri net based search has been shown as a promising way to solve flexible manufacturing systems (FMS) scheduling problem. However, the response time is critical since it´s a system with high computational complexity. Focusing the reduction of response time, this work proposes a heuristic for Petri net based search to solve FMS scheduling problem of makespan minimization. experiments showed improvements on response time reduction comparing with prior works.

Keywords

Petri nets; computational complexity; flexible manufacturing systems; scheduling; FMS scheduling problem; Petri nets modeling; computational complexity; flexible manufacturing systems; makespan minimization; Computational complexity; Context modeling; Delay; Flexible manufacturing systems; Job shop scheduling; Manufacturing automation; Manufacturing industries; Petri nets; Processor scheduling; Production systems; FMS; Flexible Manufacturing System; Heuristic Search; Scheduling; Virtual Petri Net;

fLanguage

English

Publisher

ieee

Conference_Titel

Industrial Electronics Society, 2007. IECON 2007. 33rd Annual Conference of the IEEE

Conference_Location

Taipei

ISSN

1553-572X

Print_ISBN

1-4244-0783-4

Type

conf

DOI

10.1109/IECON.2007.4459987

Filename

4459987