554
Views
5
CrossRef citations to date
0
Altmetric
Articles

Service-oriented bi-objective robust collection-disassembly problem with equipment selection

, , ORCID Icon, &
Pages 1676-1690 | Received 18 Oct 2019, Accepted 20 Jan 2020, Published online: 11 Feb 2020

References

  • 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.
  • Battaïa, O., A. Dolgui, S. S. Heragu, S. M. Meerkov, and M. K Tiwari. 2018. “Design for Manufacturing and Assembly/disassembly: Joint Design of Products and Production Systems.” International Journal of Production Research 56 (24): 7181–7189.
  • Bentaha, M. L., O. Battaïa, and A Dolgui. 2014. “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. 2015. “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., 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 56 (24): 7220–7242.
  • Bérubé, J. F., M. Gendreau, and J.-Y Potvin. 2009. “An Exact ε-constraint Method for Bi-objective Combinatorial Optimization Problems: Application to the Traveling Salesman Problem with Profits.” European Journal of Operational Research 194 (1): 39–50.
  • Bijvank, M., and I. F. A Vis. 2012. “Lost-sales Inventory Systems with a Service Level Criterion.” European Journal of Operational Research 220 (3): 610–618.
  • Birge, J. R., and F. Louveaux2011. Introduction to Stochastic Programming. New York: Springer Science & Business Media.
  • Cardona-Valdés, Y., A. Álvarez, and D Ozdemir. 2011. “A Bi-objective Supply Chain Design Problem with Uncertainty.” Transportation Research Part C 19 (5): 821–832.
  • Cardona-Valdés, Y., A. Álvarez, and J Pacheco. 2014. “Metaheuristic Procedure for a Bi-objective Supply Chain Design Problem with Uncertainty.” Transportation Research Part B 60 (5): 66–84.
  • 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.
  • Cheng, J., A. Lisser, and M Letournel. 2013. “Distributionally Robust Stochastic Shortest Path Problem.” Electronic Notes in Discrete Mathematics 41 (41): 511–518.
  • Coello, C. A. C., and N. C Cortés. 2005. “Solving Multiobjective Optimization Problems Using An Artificial Immune System.” Genetic Programming and Evolvable Machines 6 (2): 163–190.
  • Delage, E., and Y Ye. 2010. “Distributionally Robust Optimization Under Moment Uncertainty with Application to Data-driven Problems.” Operations Research 58 (3): 595–612.
  • Govindan, K., H. Soleimani, and D Kannan. 2015. “Reverse Logistics and Closed-loop Supply Chain: A Comprehensive Review to Explore the Future.” European Journal of Operational Research 240 (3): 603–626.
  • 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. 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.
  • Habibi, M. K. K., O. Battaïa, V. D. Cung, A. Dolgui, and M. K Tiwari. 2019. “Sample Average Approximation for Multi-vehicle Collection-disassembly Problem Under Uncertainty.” International Journal of Production Research 57 (8): 2409–2428.
  • Ilgin, M. A., and S. M Gupta. 2010a. “Comparison of Economic Benefits of Sensor Embedded Products and Conventional Products in a Multi-product Disassembly Line.” Computers & Industrial Engineering59 (4): 748–763.
  • Ilgin, M. A., and S. M Gupta. 2010b. “Environmentally Conscious Manufacturing and Product Recovery (ECMPRO): A Review of the State of the Art.” Journal of Environmental Management 91 (3): 563–591.
  • Ivanov, D., A. Pavlov, D. Pavlov, and B Sokolov. 2017. “Minimization of Disruption-related Return Flows in the Supply Chain.” International Journal of Production Economics 183: 503–513.
  • Jebali, A., and A Diabat. 2017. “A Chance-constrained Operating Room Planning with Elective and Emergency Cases Under Downstream Capacity Constraints.” Computers & Industrial Engineering 114: 329–344.
  • Kazemi, N., N. M. Modak, and K Govindan. 2019. “A Review of Reverse Logistics and Closed Loop Supply Chain Management Studies Published in Ijpr: a Bibliometric and Content Analysis.” International Journal of Production Research 57 (15–16): 4937–4960.
  • Kleywegt, A. J., V. S. Nori, and M. W. P Savelsbergh. 2002. “The Stochastic Inventory Routing Problem with Direct Deliveries.” Transportation Science 36 (1): 94–118.
  • Li, J., C. Ren, J. Dong, and M He. 2011. “A Lagrangian-based heuristic for a two-stage facility location problem with handling costs.” IEEE International Conference on Service Operations, Logistics, and Informatics, 319–324.
  • Liu, M., C. Y. Lee, Z. Zhang, and C Chu. 2016. “Bi-objective Optimization for the Container Terminal Integrated Planning.” Transportation Research Part B 93: 720–749.
  • Liu, M., X. Liu, F. Chu, F. Zheng, and C Chu. 2019. “Distributionally Robust Inventory Routing Problem to Maximize the Service Level Under Limited Budget.” Transportation Research Part E 126: 190–211.
  • Liu, M., X. Yang, F. Chu, J. Zhang, and C. Chu. 2018. “Energy-oriented Bi-objective Optimization for the Tempered Glass Scheduling.” Omega. https://doi.org/10.1016/j.omega.2018.11.004
  • 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.
  • 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
  • Özceylan, E., and T Paksoy. 2014. “Fuzzy Mathematical Programming Approaches for Reverse Supply Chain Optimization with Disassembly Line Balancing Problem.” Journal of Intelligent & Fuzzy Systems26 (4): 1969–1985.
  • 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.
  • 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.
  • Tiwari, M., S. Agrawal, and S. K Goyal. 2010. “A Hybrid Taguchi-immune Approach to Optimize An Integrated Supply Chain Design Problem with Multiple Shipping.” European Journal of Operational Research 203 (1): 95–106.
  • T'kindt, V., and J. C Billaut. 2001. “Multicriteria Scheduling Problems: a Survey.” RAIRO-Operations Research 35 (2): 143–163.
  • Tuncel, E., A. Zeid, and S Kamarthi. 2014. “Solving Large Scale Disassembly Line Balancing Problem with Uncertainty Using Reinforcement Learning.” Journal of Intelligent Manufacturing 25 (4): 647–659.
  • Xie, W., and S Ahmed. 2018. “Distributionally Robust Simple Integer Recourse.” Computational Management Science 15: 351–367.
  • Zhang, Z., B. Denton, and X. Xie. 2015. “Branch and price for chance constrained bin packing.” Available at Optimization-Online. http://www.optimization-online.org/DB_HTML/2015/11/5217.html
  • 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.
  • Zitzler, E., K. Deb, and L Thiele. 2000. “Comparison of Multiobjective Evolutionary Algorithms: Empirical Results.” Evolutionary Computation 8 (2): 173–195.

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.