File Download
There are no files associated with this item.
SFX Link
- Find it @ UNIST can give you direct access to the published full text of this article. (UNISTARs only)
- Jung, Mooyoung
Views & Downloads
Detailed Information
Cited time in 
Cited time in 
Cited time in
Metadata Downloads
Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.citation.endPage | 508 | - |
| dc.citation.number | 1-4 | - |
| dc.citation.startPage | 505 | - |
| dc.citation.title | COMPUTERS & INDUSTRIAL ENGINEERING | - |
| dc.citation.volume | 27 | - |
| dc.contributor.author | Lee, K | - |
| dc.contributor.author | Jung, Mooyoung | - |
| dc.date.accessioned | 2023-12-22T13:05:45Z | - |
| dc.date.available | 2023-12-22T13:05:45Z | - |
| dc.date.created | 2014-09-04 | - |
| dc.date.issued | 1994-09 | - |
| dc.description.abstract | This paper presents a new methodology for flexible operation planning using the Petri net approach. A Petri net is used as a unified framework for both operation planning and plan representation. The methodology comprises: 1. (1) Modeling operation selection and sequencing knowledge using the Petri net framework; 2. (2) Representing a flexible sequence of operations using the Petri net framework. | - |
| dc.identifier.bibliographicCitation | COMPUTERS & INDUSTRIAL ENGINEERING, v.27, no.1-4, pp.505 - 508 | - |
| dc.identifier.doi | 10.1016/0360-8352(94)90345-X | - |
| dc.identifier.issn | 0360-8352 | - |
| dc.identifier.scopusid | 2-s2.0-0006936978 | - |
| dc.identifier.uri | https://scholarworks.unist.ac.kr/handle/201301/5837 | - |
| dc.identifier.url | http://www.scopus.com/inward/record.url?partnerID=HzOxMe3b&scp=0006936978 | - |
| dc.identifier.wosid | A1994QL18400124 | - |
| dc.language | 영어 | - |
| dc.publisher | PERGAMON-ELSEVIER SCIENCE LTD | - |
| dc.title | PETRI-NET APPLICATION IN FLEXIBLE PROCESS PLANNING | - |
| dc.type | Article | - |
| dc.description.journalRegisteredClass | scie | - |
| dc.description.journalRegisteredClass | scopus | - |
Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.