Integrated stochastic disassembly line balancing and planning problem with machine specificity
- 12 January 2021
- journal article
- research article
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 60 (5) , 1688-1708
Abstract
The disassembly is a fundamental basis in converting End-of-Life (EOL) products into useful components. Related research becomes popular recently due to the increasing awareness of environmental protection and energy conservation. Yet, there are many opening questions needed to be investigated, especially the efficient coordination of different-level decisions under uncertainty is a big challenge. In this paper, a novel integrated stochastic disassembly line balancing and planning problem is studied to minimise the system cost, where component yield ratios and demands are assumed to be uncertain. In this work, machine specificities are considered for task processing, such as price, ability, and capacity. For the problem, a two-stage non-linear stochastic programming model is first constructed. Then, it is further transformed into a linear formulation. Based on problem property analysis, a valid inequality is proposed to reduce the search space of optimal solutions. Finally, a sample average approximation (SAA) and an L-shaped algorithm are adopted to solve the problem. Numerical experiments on randomly generated instances demonstrate that the valid inequality can save around 11% of average computation time, and the L-shaped algorithm can save around 64% of average computation time compared with the SAA algorithm without a big sacrifice of the solution quality.Keywords
Funding Information
- National Natural Science Foundation of China (71832001, 71771048, 71571134)
This publication has 51 references indexed in Scilit:
- Assembly line balancing: general resource-constrained caseInternational Journal of Production Research, 2010
- Capacitated disassembly scheduling with random demandInternational Journal of Production Research, 2010
- Disassembly scheduling: literature review and future research directionsInternational Journal of Production Research, 2007
- Ant algorithms for a time and space constrained assembly line balancing problemEuropean Journal of Operational Research, 2007
- A Lagrangean heuristic algorithm for disassembly scheduling with capacity constraintsJournal of the Operational Research Society, 2006
- Disassembly scheduling with capacity constraints: Minimizing the number of products disassembledProceedings of the Institution of Mechanical Engineers, Part B: Journal of Engineering Manufacture, 2006
- Assembly line balancing: Two resource constrained casesInternational Journal of Production Economics, 2005
- Process planning for product disassemblyInternational Journal of Production Research, 2002
- Disassembly planning and scheduling: Review and further researchProceedings of the Institution of Mechanical Engineers, Part B: Journal of Engineering Manufacture, 2001
- Optimal disassembly of complex productsInternational Journal of Production Research, 1997