Disassembly Scheduling with Parts Commonality Using Petri Nets with Timestamps

Authors:
Klaus-Peter Neuendorf;Dong-Ho Lee;Dimitris Kiritsis;Paul Xirouchakis
Affiliations:
Computer Science Department, Humboldt-University Berlin, Unter den Linden 6, 10099 Berlin, Germany;Mechanical Engineering Department, Swiss Federal Institute of Technology, Lausanne, Switzerland;Mechanical Engineering Department, Swiss Federal Institute of Technology, Lausanne, Switzerland;Mechanical Engineering Department, Swiss Federal Institute of Technology, Lausanne, Switzerland
Venue:
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P'2000)
Year:
2001

Citing 3
Cited 0

A Unified High-Level Petri Net Formalism for Time-Critical Systems

IEEE Transactions on Software Engineering
Disassembly of multiple product structures

Computers and Industrial Engineering - Special issue: new advances in analysis of manufacturing systems
A petri net approach to disassembly process planning

Proceedings of the 23rd international conference on on Computers and industrial engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper considers the application of Petri nets with timestamps to the problem of disassembly scheduling with parts commonality, which is the problem of determining time and quantity of ordering the used product to fulfill the demands of individual disassembled parts. Unlike the simple case, parts commonality creates dependencies of components and makes them difficult to solve. A comparison of methods using an example problem from a previous research shows that the method suggested in this paper is much simpler and more extendable than the previous one. Also, we show that the solutions obtained from the previous algorithm are not optimal in general.