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

IFIP Advances in Information and Communication Technology

Volumn 414, Issue , 2013, Pages 103-110

  Bentaha, Mohand Lounes ^a   Battäıa, Olga ^a   Dolgui, Alexandre ^a  

^a Henri FAYOL Institute   (France)

Author keywords

Cone and chance constrained programming; Disassembly; Interior point algorithm; Line design; Product recovery; Sustainable manufacturing

Indexed keywords

COMPUTER PROGRAMMING; DECISION MAKING; HAZARDS; INDUSTRIAL MANAGEMENT; OPERATING COSTS; PROBABILITY DISTRIBUTIONS; PRODUCT DESIGN; PROFITABILITY; STOCHASTIC SYSTEMS; SUPPLY CHAINS; COSTS;

CHANCE-CONSTRAINED PROGRAMMING; DISASSEMBLY; INTERIOR POINT ALGORITHM; LINE DESIGN; PRODUCT RECOVERY; SUSTAINABLE MANUFACTURING;

STOCHASTIC MODELS;

EID: 84922236941     PISSN: 18684238     EISSN: 1868422X     Source Type: Book Series    
DOI: 10.1007/978-3-642-41266-0_13     Document Type: Conference Paper

References (14)

1. Agrawal, S., Tiwari, M.K.: A collaborative ant colony algorithm to stochastic mixed-model U-shaped disassembly line balancing and sequencing problem. International Journal of Production Research 46(6), 1405-1429 (2006)
2. Altekin, F.T., Akkan, C.: Task-failure-driven rebalancing of disassembly lines. International Journal of Production Research 50(18), 4955-4976 (2011)
3. Altekin, F.T., Kandiller, L., Ozdemirel, N.E.: Profit-oriented disassembly line balancing. International Journal of Production Research 46(10), 2675-2693 (2008)
4. Atamtürk, A., Narayanan, V.: Conic mixed-integer rounding cuts. Math. Program. 122, 1-20 (2010)
5. Bentaha, M.L., Battäıa, O., Dolgui, A.: A stochastic formulation of the disassembly line balancing problem. In: Emmanouilidis, C., Taisch, M., Kiritsis, D. (eds.) APMS 2012. IFIP AICT, vol. 397, pp. 397-404. Springer, Heidelberg (2013)
6. 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(7), 1427-1467 (2001)
7. Koc, A., Sabuncuoglu, I., Erel, E.: Two exact formulations for disassembly line balancing problems with task precedence diagram construction using an AND/OR graph. IIE Transactions 41(10), 866-881 (2009)
8. Lambert, A.J.D.: Linear programming in disassembly/clustering sequence generation. Computers & Industrial Engineering 36(4), 723-738 (1999)
9. Ma, Y.S., Jun, H.B., Kim, H.W., Lee, D.H.: Disassembly process planning algorithms for end-of-life product recovery and environmentally conscious disposal. International Journal of Production Research 49(23), 7007-7027 (2011)
10. Mcgovern, S.M., Gupta, S.M.: Combinatorial optimization analysis of the unary NP-complete disassembly line balancing problem. International Journal of Production Research 45(18-19), 4485-4511 (2007)
11. McGovern, S.M., Gupta, S.M.: Ant colony optimization for disassembly sequencing with multiple objectives. The International Journal of Advanced Manufacturing Technology 30(5-6), 481-496 (2006)
12. McGovern, S.M., Gupta, S.M.: A balancing method and genetic algorithm for disassembly line balancing. European Journal of Operational Research 179(3), 692-708 (2007)
13. McGovern, S.M., Gupta, S.M.: The Disassembly Line, Balancing and Modeling, 2011th edn. McGraw-Hill Companies, New York (2011)
14. Nesterov, Y.E., Nemirovski, A.S.: Interior-Point Polynomial Algorithms in Convex Programming. Society for Industrial and Applied Mathematics (1994)