Disassembly Scheduling with Parts Commonality Using Petri Nets with Timestamps

Issue title: Concurrency Specification and Programming (CS&P'2000)

Article type: Research Article

Authors: Neuendorf, Klaus-Peter | Lee, Dong-Ho | Kiritsis, Dimitris | Xirouchakis, Paul

Affiliations: Computer Science Department, Humboldt-University Berlin, Unter den Linden 6, 10099 Berlin, Germany | Mechanical Engineering Department, Swiss Federal Institute of Technology, Lausanne, Switzerland

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.

Keywords: Disassembly, scheduling, time Petri nets

Journal: Fundamenta Informaticae, vol. 47, no. 3-4, pp. 295-306, 2001