Disassembly Scheduling with Parts Commonality Using Petri Nets with Timestamps

• Autorzy: Neuendorf K-P. , Lee D-H. , Kiritsis D. , Xirouchakis P.
• Języki publikacji: EN

Abstrakty

EN

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.

Słowa kluczowe

EN

disassembly; scheduling; Time Petri Net

• Wydawca: IOS Press
• Czasopismo: Fundamenta Informaticae
• Rocznik: 2001
• Tom: Vol. 47, nr 3,4
• Strony: 295--306
• Opis fizyczny: tab., wykr., bibliogr. 10 poz.

Twórcy

autor

Neuendorf K-P.

autor

Lee D-H.

autor

Kiritsis D.

autor

Xirouchakis P.

• Computer Science Department Humboldt University Berlin Berlin, Germany,