Show simple item record

dc.contributor.advisorHarhalakis, G.en_US
dc.contributor.advisorMinis, I.en_US
dc.contributor.advisorProth, J-Men_US
dc.contributor.authorLevantopoulos, Marios M.en_US
dc.date.accessioned2007-05-23T09:58:00Z
dc.date.available2007-05-23T09:58:00Z
dc.date.issued1994en_US
dc.identifier.urihttp://hdl.handle.net/1903/5580
dc.description.abstractThis work addresses the modeling, verification, planning and scheduling problems of non-cycle discrete systems with emphasis on Flexible Manufacturing Systems. We introduce a special type of Petri nets, the Conflict-Free nets with Input and Output transitions (CFIO nets) that provide a much needed platform on which all these problems can be tackled in a unified manner. It is shown that CFIO nets are live, reversible, if consistent, and can be kept bounded under certain conditions. We develop reduction rules which facilitate the detection of the above properties. We then take advantage of the qualitative properties of CFIO nets and use those models to develop a linear programming formulation of the production planning problem. Finally we use the CFIO nets, along with the production planning results, to develop the production schedule of the Flexible Manufacturing system.en_US
dc.format.extent2834759 bytes
dc.format.mimetypeapplication/pdf
dc.language.isoen_USen_US
dc.relation.ispartofseriesISR; MS 1994-10en_US
dc.subjectalgorithmsen_US
dc.subjectcomputational complexityen_US
dc.subjectgraph theoryen_US
dc.subjectautomationen_US
dc.subjectcomputer aided manufacturing en_US
dc.subjectcomputer integrated manufacturing en_US
dc.subjectflexible manufacturingen_US
dc.subjectmanufacturingen_US
dc.subjectIntelligent Control Systemsen_US
dc.titleA New Class of Petri Nets for Modeling, Planning and Scheduling of Flexible, Manufacturing Systemsen_US
dc.typeThesisen_US
dc.contributor.departmentISRen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record