×

A disassembly line balancing problem with fixed number of workstations. (English) Zbl 1346.90614

Summary: In this study, a Disassembly Line Balancing Problem with a fixed number of workstations is considered. The product to be disassembled comprises various components, which are referred to as its parts. There is a specified finite supply of the product to be disassembled and specified minimum release quantities (possible zero) for each part of the product. All units of the product are identical, however different parts can be released from different units of the product. There is a finite number of identical workstations that perform the necessary disassembly operations, referred to as tasks. We present several upper and lower bounding procedures that assign the tasks to the workstations so as to maximize the total net revenue. The computational study has revealed that the procedures produce satisfactory results.

MSC:

90C10 Integer programming
90B30 Production models
90C59 Approximation methods and heuristics in mathematical programming
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Altekin, F. T.; Akkan, C., Task-failure-driven rebalancing of disassembly lines, International Journal of Production Research, 50, 4955-4976 (2012)
[2] Altekin, F. T.; Kandiller, L.; Özdemirel, N. E., Profit oriented disassembly line balancing, International Journal of Production Research, 46, 2675-2693 (2008) · Zbl 1160.90360
[3] Bentaha, M. L.; Battaïa, O.; Dolgui, A., A sample average approximation method for disassembly line balancing problem under uncertainty, Computers and Operations Research, 51, 111-122 (2014) · Zbl 1348.90219
[4] Bentaha, M. L.; Battaïa, O.; Dolgui, A., Disassembly line balancing and sequencing under uncertainty, Procedia CIRP, 15, 56-60 (2014)
[5] Bentaha, M. L.; Battaïa, O.; Dolgui, A., Lagrangian relaxation for stochastic disassembly line balancing problem, Procedia CIRP, 17, 239-244 (2014)
[6] Bentaha, M. L.; Battaïa, O.; Dolgui, A., “Disassembly line balancing problem with fixed number of workstations under uncertainty, (Proceedings of the 19th IFAC World Congress (2014))
[7] Bentaha, M. L.; Battaïa, O.; Dolgui, A., An exact solution approach for disassembly line balancing problem under uncertainty of the task processing times, International Journal of Production Research, 53, 1807-1818 (2015)
[8] Bourjault, A., Contribution to a systematic approach of automatic generation of task sequences, (PhD Dissertation, Universite de Franche-Comte, Besancon, France (1984))
[9] Brennan, L.; Gupta, S. M.; Taleb, K. N., Operations planning issues in an assembly/disassembly environment, International Journal of Operations and Production Management, 14, 57-67 (1994)
[10] Capraz, O.; Polat, O.; Güngör, A., Planning of waste electrical and electronic equipment (WEEE) recycling facilities: MILP modelling and case study investigation, Flexible Services and Manufacturing Journal (2015)
[11] Crowther, P., Designing for disassembly to extend service life and increase sustainability, (8th International Conference on Durability of Building Materials and Components. 8th International Conference on Durability of Building Materials and Components, Vancouver, Canada (1999))
[12] Ding, L. P.; Feng, Y. X.; Tan, J. R.; Gao, Y. C., A new multi objective and colony algorithm for solving the disassembly line balancing problem, The International Journal of Advanced Manufacturing Technology, 48, 761-771 (2010)
[13] Güngör, A.; Gupta, S. M., Disassembly sequence plan generation using a branch and bound algorithm, International Journal of Production Research, 39, 481-509 (2001)
[14] Güngör, A.; Gupta, S. M., A solution approach to the disassembly line balancing problem in the presence of task failures, International Journal of Production Research, 39, 1427-1467 (2001)
[15] Güngör, A.; Gupta, S. M., Disassembly line in product recovery, International Journal of Production Research, 40, 2569-2589 (2002) · Zbl 1023.90507
[16] Hezer, S.; Kara, Y., A network-based shortest route model for parallel disassembly line balancing problem, International Journal of Production Research, 53, 1849-1865 (2014)
[17] Koc, A.; Sabuncuoglu, I.; Erel, E., Two exact formulations for disassembly line balancing problems with precedence diagram construction using an AND/OR graph, IIE Transactions, 41, 866-881 (2009)
[18] Lambert, A. J.D., Optimal disassembly of complex products, International Journal of Production Research, 35, 2509-2523 (1997) · Zbl 0943.90536
[19] Lambert, A. J.D., Determining optimum disassembly sequences in electronic equipment, Computers and Industrial Engineering, 42, 553-575 (2002)
[20] Lambert, A. J.D., Disassembly sequencing: A survey, International Journal of Production Research, 41, 3721-3759 (2003) · Zbl 1059.90055
[21] McGovern, S. M.; Gupta, S., The disassembly line: Balancing and modeling (2011), McGraw Hill, New York: McGraw Hill, New York New York
[22] McGovern, S. M.; Gupta, S. M., A combinatorial optimization analysis of the unary NP-complete disassembly line balancing, International Journal of Production Research, 45, 1485-1551 (2007) · Zbl 1128.90412
[23] McGovern, S. M.; Gupta, S. M., A balancing method and genetic algorithm for disassembly line balancing, European Journal of Operational Research, 179, 692-708 (2007) · Zbl 1144.90371
[24] Navin-Chandra, D., The recovery problem in product design, Journal of Engineering Design, 5, 65-86 (1994)
[25] Paksoy, T.; Güngör, A.; Özceylan, E.; Hancilar, A., Mixed model disassembly line balancing problem with fuzzy goals, International Journal of Production Research, 51, 6082-6096 (2013)
[26] Patterson, J. H.; Albracht, J. J., Assembly line balancing: 0-1 programming with fibonacci search, Operations Research, 179, 166-174 (1975) · Zbl 0307.90057
[27] Ullerich, C., Advanced disassembly planning: Flexible, price-quantity dependent and multi-period planning approaches (2014), Springer Gabler: Springer Gabler Wiesbaden
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.