Chance Constrained Programming Model for Stochastic Profit-Oriented Disassembly Line Balancing in the Presence of Hazardous Parts

被引:0
作者
Bentaha, Mohand Lounes [1 ]
Battaia, Olga [1 ]
Dolgui, Alexandre [1 ]
机构
[1] Ecole Natl Super Mines, EMSE FAYOL, LIMOS, CNRS,UMR6158, F-42023 St Etienne, France
来源
ADVANCES IN PRODUCTION MANAGEMENT SYSTEMS: SUSTAINABLE PRODUCTION AND SERVICE SUPPLY CHAINS, PT 1 | 2013年 / 414卷
关键词
Sustainable Manufacturing; Product Recovery; Disassembly; Line Design; Cone and Chance Constrained Programming; Interior-point Algorithm; OPTIMIZATION;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
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.
引用
收藏
页码:103 / 110
页数:8
相关论文
共 14 条
[1]   A collaborative ant colony algorithm to stochastic mixed-model U-shaped disassembly line balancing and sequencing problem [J].
Agrawal, S. ;
Tiwari, M. K. .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2008, 46 (06) :1405-1429
[2]   Profit-oriented disassembly-line balancing [J].
Altekin, F. Tevhide ;
Kandiller, Levent ;
Ozdemirel, Nur Evin .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2008, 46 (10) :2675-2693
[3]   Task-failure-driven rebalancing of disassembly lines [J].
Altekin, F. Tevhide ;
Akkan, Can .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2012, 50 (18) :4955-4976
[4]   Conic mixed-integer rounding cuts [J].
Atamtuerk, Alper ;
Narayanan, Vishnu .
MATHEMATICAL PROGRAMMING, 2010, 122 (01) :1-20
[5]  
Bentaha ML, 2013, IFIP ADV INF COMM TE, V397, P397
[6]   A solution approach to the disassembly line balancing problem in the presence of task failures [J].
Güngör, A ;
Gupta, SM .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2001, 39 (07) :1427-1467
[7]   Two exact formulations for disassembly line balancing problems with task precedence diagram construction using an AND/OR graph [J].
Koc, Ali ;
Sabuncuoglu, Ihsan ;
Erel, Erdal .
IIE TRANSACTIONS, 2009, 41 (10) :866-881
[8]   Linear programming in disassembly/clustering sequence generation [J].
Lambert, AJD .
COMPUTERS & INDUSTRIAL ENGINEERING, 1999, 36 (04) :723-738
[9]   Disassembly process planning algorithms for end-of-life product recovery and environmentally conscious disposal [J].
Ma, Yoen-Seok ;
Jun, Hong-Bae ;
Kim, Hyung-Won ;
Lee, Dong-Ho .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2011, 49 (23) :7007-7027
[10]   Combinatorial optimization analysis of the unary NP-complete disassembly line balancing problem [J].
Mcgovern, S. M. ;
Gupta, S. M. .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2007, 45 (18-19) :4485-4511