663
Views
21
CrossRef citations to date
0
Altmetric
Articles

Robust disassembly line balancing with ambiguous task processing times

, , , &
Pages 5806-5835 | Received 10 Oct 2018, Accepted 12 Aug 2019, Published online: 29 Aug 2019

References

  • Agrawal, S., Y. Ding, A. Saberi, and Y. Ye. 2012. “Price of Correlations in Stochastic Optimization.” Operations Research 60 (1): 150–162.
  • Agrawal, S., and M. K. Tiwari. 2008. “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.
  • Alizadeh, F., and D. Goldfarb. 2003. “Second-order Cone Programming.” Mathematical Programming95 (1): 3–51.
  • Altekin, F. T.. 2017. “A Comparison of Piecewise Linear Programming Formulations for Stochastic Disassembly Line Balancing.” International Journal of Production Research 55 (24): 7412–7434.
  • Altekin, F. T., Z. P. Bayındır, and V. Gümüşkaya. 2016. “Remedial Actions for Disassembly Lines with Stochastic Task Times.” Computers & Industrial Engineering 99: 78–96.
  • Altekin, F. T., L. Kandiller, and N. E. Ozdemirel. 2008. “Profit-oriented Disassembly-line Balancing.” International Journal of Production Research 46 (10): 2675–2693.
  • Aydemir-Karadag, A., and O. Turkbey. 2013. “Multi-objective Optimization of Stochastic Disassembly Line Balancing with Station Paralleling.” Computers & Industrial Engineering 65 (3): 413–425.
  • Battaïa, O., and A. Dolgui. 2013. “A Taxonomy of Line Balancing Problems and Their Solution Approaches.” International Journal of Production Economics 142 (2): 259–277.
  • Bentaha, M. L., O. Battaïa, and A Dolgui. 2012. “A Stochastic Formulation of the Disassembly Line Balancing Problem.” IFIP International Conference on Advances in Production Management Systems, 397–404. Berlin, Heidelberg: Springer.
  • Bentaha, M. L., O. Battaïa, and A Dolgui. 2013a. “Chance Constrained Programming Model for Stochastic Profit Oriented Disassembly Line Balancing in the Presence of Hazardous Parts.” IFIP International Conference on Advances in Producti Management Systems, 103–110. Berlin, Heidelberg: Springer.
  • Bentaha, M. L., O. Battaïa, and A. Dolgui. 2013b. “L-shaped Algorithm for Stochastic Disassembly Line Balancing Problem.” IFAC Proceedings Volumes 46 (9): 407–411.
  • Bentaha, M. L., O. Battaïa, and A. Dolgui. 2014a. “Lagrangian Relaxation for Stochastic Disassembly Line Balancing Problem.” Procedia CIRP 17 (17): 56–60.
  • Bentaha, M. L., O. Battaïa, and A. Dolgui. 2014b. “A Sample Average Approximation Method for Disassembly Line Balancing Problem Under Uncertainty.” Computers & Operations Research 51 (3): 111–122.
  • Bentaha, M. L., O. Battaïa, and A. Dolgui. 2015a. “An Exact Solution Approach for Disassembly Line Balancing Problem Under Uncertainty of the Task Processing Times.” International Journal of Production Research 53 (6): 1807–1818.
  • Bentaha, M. L., O. Battaïa, A. Dolgui, and S. J. Hu. 2014c. “Dealing with Uncertainty in Disassembly Line Design.” CIRP Annals -- Manufacturing Technology 63 (1): 21–24.
  • Bentaha, M. L., O. Battaïa, A. Dolgui, and S. J. Hu. 2015b. “Second Order Conic Approximation for Disassembly Line Design with Joint Probabilistic Constraints.” European Journal of Operational Research 247 (3): 957–967.
  • Bentaha, M. L., A. Dolgui, and O. Battaïa. 2015c. “A Bibliographic Review of Production Line Design and Balancing Under Uncertainty.” IFAC PapersOnLine 48 (3): 70–75.
  • Bentaha, M. L., A. Dolgui, and O. Battaïa. 2015d. “Problem Instances I Have Used in the Numerical Experiments of the Work on Disassembly Line Design and Balancing Under Uncertainty.” Procedia CIRP 15. doi:10.13140/RG.2.1.5163.5043.
  • Bentaha, M. L., A. Dolgui, O. Battaïa, R. J. Riggs, and J. Hu. 2018. “Profit-oriented Partial Disassembly Line Design: Dealing with Hazardous Parts and Task Processing Times Uncertainty.” International Journal of Production Research. doi:10.1080/00207543.2017.1418987.
  • Bonnans, J. F., and R. C. Héctor. 2005. “Perturbation Analysis of Second-order Cone Programming Problems.” Mathematical Programming 104 (2–3): 205–227.
  • Chen, W., M. Sim, J. Sun, and C. P. Teo. 2010. “From Cvar to Uncertainty Set: Implications in Joint Chance-constrained Optimization.” Operations Research 58 (2): 470–485.
  • Chica, M., J. Bautista, Ó. Cordón, and S. Damas. 2016. “A Multiobjective Model and Evolutionary Algorithms for Robust Time and Space Assembly Line Balancing Under Uncertain Demand.” Omega 58: 55–68.
  • Chica, M., Ó. Cordón, S. Damas, and J. Bautista. 2013. “A Robustness Information and Visualization Model for Time and Space Assembly Line Balancing Under Uncertain Demand.” International Journal of Production Economics 145 (2): 761–772.
  • Chung, B. D., T. Yao, and B. Zhang. 2012. “Dynamic Traffic Assignment Under Uncertainty: A Distributional Robust Chance-constrained Approach.” Networks & Spatial Economics 12 (1): 167–181.
  • Delage, E., and Y. Ye. 2010. “Distributionally Robust Optimization Under Moment Uncertainty with Application to Data-driven Problems.” Operations Research 58 (3): 595–612.
  • Dolgui, A., and S. Kovalev. 2012. “Scenario Based Robust Line Balancing: Computational Complexity.” Discrete Applied Mathematics 160 (13–14): 1955–1963.
  • Fang, Y., H. Ming, M. Li, Q. Liu, and D. T. Pham. 2019. “Multi-objective Evolutionary Simulated Annealing Optimisation for Mixed-model Multi-robotic Disassembly Line Balancing with Interval Processing Time.” International Journal of Production Research 1–17. doi: 10.1080/00207543.2019.1602290.
  • Güngör, A., and S. M. Gupta. 2001. “A Solution Approach to the Disassembly Line Balancing Problem in the Presence of Task Failures.” International Journal of Production Research 39 (7): 1427–1467.
  • Güngör, A., and S. M. Gupta. 2002. “Disassembly Line in Product Recovery.” International Journal of Production Research 40 (11): 2569–2589.
  • Gupta, S. M., and A Güngör. 1999. “Disassembly Line Balancing.” Proceedings of the Annual Meeting of the Northeast Decision Sciences Institute, 193–195.
  • Habibi, M. K. K., O. Battaïa, V. D. Cung, and A. Dolgui. 2016. “Collection-disassembly Problem in Reverse Supply Chain.” International Journal of Production Economics 183: 334–344.
  • Habibi, M. K., O. Battaïa, V. D. Cung, and A. Dolgui. 2017a. “Collection-disassembly Problem in Reverse Supply Chain.” International Journal of Production Economics 183: 334–344.
  • Habibi, M. K., O. Battaïa, V. D. Cung, and A. Dolgui. 2017b. “An Efficient Two-phase Iterative Heuristic for Collection-disassembly Problem.” Computers & Industrial Engineering 110: 505–514.
  • Hanasusanto, G. A., V. Roitch, D. Kuhn, and W. Wiesemann. 2015. “A Distributionally Robust Perspective on Uncertainty Quantification and Chance Constrained Programming.” Mathematical Programming 151 (1): 35–62.
  • HazıR, Ö., and A. Dolgui. 2013. “Assembly Line Balancing Under Uncertainty: Robust Optimization Models and Exact Solution Method.” Computers & Industrial Engineering 65 (2): 261–267.
  • Ilgin, M. A., H. Akçay, and C. Araz. 2017. “Disassembly Line Balancing Using Linear Physical Programming.” International Journal of Production Research 55 (20): 6108–6119.
  • Ilgin, M. A., and S. M. Gupta. 2010. “Comparison of Economic Benefits of Sensor Embedded Products and Conventional Products in a Multi-product Disassembly Line.” Computers & Industrial Engineering59 (4): 748–763.
  • Jiang, R., and Y. Guan. 2016. “Data-driven Chance Constrained Stochastic Program.” Mathematical Programming 158 (1–2): 291–327.
  • Koc, A., I. Sabuncuoglu, and E. Erel. 2009. “Two Exact Formulations for Disassembly Line Balancing Problems with Task Precedence Diagram Construction Using An and/or Graph.” IIE Transactions 41 (10): 866–881.
  • Lambert, A. J. D.. 1999. “Linear Programming in Disassembly/clustering Sequence Generation.” Computers & Industrial Engineering 36 (4): 723–738.
  • Li, Z., Z. A. Çil, S. Mete, and I. Kucukkoc. 2019. “A Fast Branch, Bound and Remember Algorithm for Disassembly Line Balancing Problem.” International Journal of Production Research 1–15. doi:10.1080/00207543.2019.1630774.
  • Ma, Y.S., B. Jun, H.W. Kim, and D.H Lee. 2011. “Disassembly process planning algorithms for end-of-life product recovery and environmentally conscious disposal.” International Journal of Production Research 49 (23): 7007–7027.
  • Mcgovern, S. M., and S. M. Gupta. 2007. “A Balancing Method and Genetic Algorithm for Disassembly Line Balancing.” European Journal of Operational Research 179 (3): 692–708.
  • Mete, S., Z. A. Çil, E. Özceylan, K. Ağpak, and O. Battaïa. 2018. “An Optimisation Support for the Design of Hybrid Production Lines Including Assembly and Disassembly Tasks.” International Journal of Production Research. DOI:10.1080/00207543.2018.1428774.
  • Moore, K. E., A. Güngör, and S. M. Gupta. 2001. “Petri Net Approach to Disassembly Process Planning for Products with Complex and/or Precedence Relationships.” European Journal of Operational Research 135 (2): 428–449.
  • Moreira, M. C. O., J. -F. Cordeau, A. M. Costa, and G. Laporte. 2015. “Robust Assembly Line Balancing with Heterogeneous Workers.” Computers & Industrial Engineering 88: 254–263.
  • Nemirovski, A., and A. Shapiro. 2006. “Convex Approximations of Chance Constrained Programs.” SIAM Journal on Optimization 17 (4): 969–996.
  • Özceylan, E., C. B. Kalayci, A. Güngör, and S. M. Gupta. 2018. “Disassembly Line Balancing Problem: A Review of the State of the Art and Future Directions.” International Journal of Production Research. DOI:10.1080/00207543.2018.1428775.
  • Pagnoncelli, B. K., S. Ahmed, and A. Shapiro. 2009. “Sample Average Approximation Method for Chance Constrained Programming: Theory and Applications.” Journal of Optimization Theory & Applications142 (2): 399–416.
  • Ren, Y., D. Yu, C. Zhang, G. Tian, L. Meng, and X. Zhou. 2017. “An Improved Gravitational Search Algorithm for Profit-oriented Partial Disassembly Line Balancing Problem.” International Journal of Production Research 55 (24): 7302–7316.
  • Sun, H., Z. Gao, W. Y. Szeto, J. Long, and F. Zhao. 2014. “A Distributionally Robust Joint Chance Constrained Optimization Model for the Dynamic Network Design Problem Under Demand Uncertainty.” Networks & Spatial Economics 14 (3–4): 409–433.
  • Tian, G., Y. Ren, Y. Feng, M. Zhou, H. Zhang, and J. Tan. 2018a. “Modeling and Planning for Dual-objective Selective Disassembly Using and/or Graph and Discrete Artificial Bee Colony.” IEEE Transactions on Industrial Informatics 15 (4): 2456–2468.
  • Tian, G., H. Zhang, Y. Feng, H. Jia, C. Zhang, Z. Jiang, Z. Li, and P. Li. 2017. “Operation Patterns Analysis of Automotive Components Remanufacturing Industry Development in China.” Journal of Cleaner Production 164: 1363–1375.
  • Tian, G., M. Zhou, and P. Li. 2018b. “Disassembly Sequence Planning Considering Fuzzy Component Quality and Varying Operational Cost.” IEEE Transactions on Automation Science and Engineering15 (2): 748–760.
  • Wagner, M. R.. 2008. “Stochastic 0–1 Linear Programming Under Limited Distributional Information.” Operations Research Letters 36 (2): 150–156.
  • Xie, W., and S. Ahmed. 2018a. “Distributionally Robust Simple Integer Recourse.” Computational Management Science 15: 351–367.
  • Xie, W., and S. Ahmed. 2018b. “On Deterministic Reformulations of Distributionally Robust Joint Chance Constrained Optimization Problems.” SIAM Journal on Optimization 28 (2): 1151–1182.
  • Xu, W., and T. Xiao. 2009. “Robust Balancing of Mixed Model Assembly Line.” COMPEL – The International Journal for Computation and Mathematics in Electrical and Electronic Engineering 28 (6): 1489–1502.
  • Xu, W., and T. Xiao. 2011. “Strategic Robust Mixed Model Assembly Line Balancing Based on Scenario Planning.” Tsinghua Science and Technology 16 (3): 308–314.
  • Zhang, Y., R. Jiang, and S Shen. 2016. Distributionally robust chance-constrained bin packing. Available at http://www.optimizationonline.org/DBFILE/2016/09/5662.pdf.
  • Zhang, Y., R. Jiang, and S. Shen. 2018. “Ambiguous Chance-constrained Binary Programs Under Mean-covariance Information.” SIAM Journal on Optimization 28 (4): 2922–2944.
  • Zhang, Y., S. Shen, and S. A. Erdogan. 2017. “Solving 0–1 Semidefinite Programs for Distributionally Robust Allocation of Surgery Blocks.” Optimization Letters 12 (7): 1503–1521.
  • Zheng, F., J. He, F. Chu, and M. Liu. 2018. “A New Distribution-free Model for Disassembly Line Balancing Problem with Stochastic Task Processing Times.” International Journal of Production Research. DOI:10.1080/00207543.2018.1430909.
  • Zymler, S., D. Kuhn, and B. Rustem. 2013. “Distributionally Robust Joint Chance Constraints with Second-order Moment Information.” Mathematical Programming 137 (1–2): 167–198.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.