Chance constrained programming model for stochastic profit-oriented disassembly line balancing in the presence of hazardous parts

38Citations
Citations of this article
27Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

A Stochastic Partial profit-oriented Disassembly Line Balancing Problem (SP-DLBP) in the presence of hazardous parts is considered. The goal is to assign disassembly tasks of the best selected disassembly alternative to a sequence of workstations while respecting precedence and cycle time constraints. An AND/OR graph is used to model the disassembly alternatives and the precedence relations among tasks. Task times are assumed independent random variables with known normal probability distributions. Cycle time constraints are to be satisfied with at least a certain probability level fixed by the decision maker. The objective is to maximize the profit produced by the line. It is computed as the difference between the positive revenue generated by retrieved parts and the line operation cost considered as negative revenue. The line cost includes the workstations operation costs as well as additional costs of workstations handling hazardous parts of End of Life (EOL) product. To deal with uncertainties, a Chance Constrained Programming formulation is developed.

Cite

CITATION STYLE

APA

Bentaha, M. L., Battäıa, O., & Dolgui, A. (2013). Chance constrained programming model for stochastic profit-oriented disassembly line balancing in the presence of hazardous parts. In IFIP Advances in Information and Communication Technology (Vol. 414, pp. 103–110). Springer New York LLC. https://doi.org/10.1007/978-3-642-41266-0_13

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free