Show simple item record

dc.contributor.authorLi, L.en
dc.contributor.authorHadjicostis, Christoforos N.en
dc.creatorLi, L.en
dc.creatorHadjicostis, Christoforos N.en
dc.description.abstractThis paper develops a recursive algorithm for estimating the least-cost planning sequence in a manufacturing system that is modelled by a labelled Petri net. We consider a setting where we are given a sequence of labels that represents a sequence of tasks that need to be executed during a manufacturing process, and we assume that each label (task) can potentially be accomplished by a number of different transitions, which represent alternative ways of accomplishing a specific task. The processes via which individual tasks can be accomplished and the interactions among these processes in the given manufacturing system are captured by the structure of the labelled Petri net. Moreover, each transition in this net is associated with a non-negative cost that captures its execution cost (eg, in terms of the amount of workload or power required to execute the transition). Given the sequence of labels (ie, the sequence of tasks that has to be accomplished), we need to identify the transition firing sequence(s) (ie, the sequence(s) of activities) that has (have) the least total cost and accomplishes (accomplish) the desired sequence of tasks while, of course, obeying the constraints imposed by the manufacturing system (ie, the dynamics and structure of the Petri net). We develop a recursive algorithm that finds the least-cost transition firing sequence(s) with complexity that is polynomial in the length of the given sequence of labels (tasks). An example of two parallel working machines is also provided to illustrate how the algorithm can be used to estimate least-cost planning sequences. © 2009 The Institute of Measurement and Control.en
dc.sourceTransactions of the Institute of Measurement and Controlen
dc.subjectPetri netsen
dc.subjectRecursive algorithmsen
dc.subjectCost benefit analysisen
dc.subjectFiring sequencesen
dc.subjectLabelled petri netsen
dc.subjectLeast-cost firing sequencesen
dc.subjectLeast-cost planningen
dc.subjectManufacturing processen
dc.subjectManufacturing systemen
dc.subjectPlanning sequence estimationen
dc.subjectSequence estimationen
dc.subjectSpecific tasksen
dc.subjectTotal costsen
dc.subjectTransition firingsen
dc.titleLeast-cost planning sequence estimation in labelled Petri netsen
dc.description.endingpage331Πολυτεχνική Σχολή / Faculty of EngineeringΤμήμα Ηλεκτρολόγων Μηχανικών και Μηχανικών Υπολογιστών / Department of Electrical and Computer Engineering
dc.source.abbreviationTrans Inst Meas Controlen
dc.contributor.orcidHadjicostis, Christoforos N. [0000-0002-1706-708X]

Files in this item


There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record