195 0

A heuristic algorithm to minimise the control places of a Petri net for the control of shared machines

Title
A heuristic algorithm to minimise the control places of a Petri net for the control of shared machines
Author
정인재
Keywords
Gantt chart control; Petri net design; shared machine
Issue Date
2011-03
Publisher
TAYLOR & FRANCIS LTD
Citation
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, v. 49, NO 6, Page. 1713-1730
Abstract
This paper proposes a design methodology of a controller based on a Petri net for the shared machines of manufacturing systems. A conflict occurs when several manufacturing systems require the same shared machines at the same time. In this case, we have two issues; the scheduling of jobs on shared machines and the construction of a control procedure for scheduling. The scheduling of production on machines has been extensively studied over the past years by researchers. In this paper, our concern is not the scheduling problem but the construction of a control procedure for the production schedule. We propose a design of a Petri net based controller for the shared machines of manufacturing systems such that the number of control places in the Petri net is minimised. The experimental results show that the proposed algorithm performs better than an upper bound in terms of optimality. Also, the proposed algorithm is computationally more efficient than the optimal algorithm. Finally, we present the application of the proposed algorithm to a realistic batch process system shown in the literature.
URI
https://www.tandfonline.com/doi/abs/10.1080/00207540903575377
ISSN
0020-7543
DOI
10.1080/00207540903575377
Appears in Collections:
COLLEGE OF ENGINEERING[S](공과대학) > INDUSTRIAL ENGINEERING(산업공학과) > Articles
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

BROWSE