Capacitated disassembly scheduling with parts commonality and start-up cost and its industrial application

References

• Adenso-Díaz, B., S. García-Carbajal, and S. M. Gupta. 2008. “A Path-relinking Approach for a Bi-criteria Disassembly Sequencing Problem.” Computers & Operations Research 35 (12): 3989–3997.
   Web of Science ®Google Scholar
• Ahn, H.-D., D.-H. Lee, and H.-J. Kim. 2011. “Solution Algorithms for Dynamic Lot-sizing in Remanufacturing Systems.” International Journal of Production Research 49 (22): 6729–6748.
   Web of Science ®Google Scholar
• Barba-Gutiérrez, Y., and B. Adenso-Díaz. 2009. “Reverse MRP under Uncertain and Imprecise Demand.” The International Journal of Advanced Manufacturing Technology 40 (3–4): 413–424.
   Web of Science ®Google Scholar
• Barba-Gutiérrez, Y., B. Adenso-Díaz, and S. M. Gupta. 2008. “Lot Sizing in Reverse MRP for Scheduling Disassembly.” International Journal of Production Economics 111 (2): 741–751.
   Web of Science ®Google Scholar
• 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: 111–122.
   Web of Science ®Google Scholar
• 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.
   Web of Science ®Google Scholar
• Brahimi, N., S. Dauzère-Pérès, and N. M. Najid. 2006. “Capacitated Multi-item Lot-sizing Problems with Time Windows.” Operations Research 54 (5): 951–967.
   Web of Science ®Google Scholar
• Fisher, M. L. 2004. “The Lagrangian Relaxation Method for Solving Integer Programming Problems.” Management Science 50 (12 supplement): 1861–1871.
   Google Scholar
• Gagnon, R. J., and S. D. Morgan. 2014. “Remanufacturing Scheduling Systems: An Exploratory Analysis Comparing Academic Research and Industry Practice.” International Journal of Rapid Manufacturing 4 (2): 179–198.
   Google Scholar
• Giri, R., and M. Kanthababu. 2015. “Generating Complete Disassembly Sequences by Utilising Two-dimensional Views.” International Journal of Production Research: 1–21. doi: 10.1080/00207543.2015.1005249.
   Web of Science ®Google Scholar
• Güngör, A., and S. M. Gupta. 1998. “Disassembly Sequence Planning for Products with Defective Parts in Product Recovery.” Computers & Industrial Engineering 35 (1): 161–164.
   Web of Science ®Google Scholar
• Güngör, A., and S. M. Gupta. 1999. “Issues in Environmentally Conscious Manufacturing and Product Recovery: A Survey.” Computers & Industrial Engineering 36 (4): 811–853.
   Web of Science ®Google Scholar
• Güngör, A., and S. M. Gupta. 2001a. “Disassembly Sequence Plan Generation Using a Branch-and-Bound Algorithm.” International Journal of Production Research 39 (3): 481–509.
   Web of Science ®Google Scholar
• Güngör, A., and S. M. Gupta. 2001b. “A Solution Approach to the Disassembly Line Balancing Problem in the Presence of Task Failures.” International Journal of Production Research 39 (7): 1427–1467.
   Web of Science ®Google Scholar
• Gupta, S. M., and K. N. Taleb. 1994. “Scheduling Disassembly.” International Journal of Production Research 32 (8): 1857–1866.
   Web of Science ®Google Scholar
• Hezer, S., and Y. Kara. 2015. “A Network-based Shortest Route Model for Parallel Disassembly Line Balancing Problem.” International Journal of Production Research 53 (6): 1849–1865.
   Web of Science ®Google Scholar
• Ilgin, M. A., and S. M. Gupta. 2010. “Environmentally Conscious Manufacturing and Product Recovery (ECMPRO): A Review of the State of the Art.” Journal of Environmental Management 91 (3): 563–591.
   PubMed Web of Science ®Google Scholar
• Kalayci, C. B., and S. M. Gupta. 2013. “A Particle Swarm Optimization Algorithm with Neighborhood-based Mutation for Sequence-dependent Disassembly Line Balancing Problem.” The International Journal of Advanced Manufacturing Technology 69 (1–4): 197–209.
   Web of Science ®Google Scholar
• Kalayci, C. B., and S. M. Gupta. 2014. “A Tabu Search Algorithm for Balancing a Sequence-dependent Disassembly Line.” Production Planning & Control 25 (2): 149–160.
   Web of Science ®Google Scholar
• Kalayci, C. B., O. Polat, and S. M. Gupta. 2014. “A Hybrid Genetic Algorithm for Sequence-dependent Disassembly Line Balancing Problem.” Annals of Operations Research 217: 1–34.
   Web of Science ®Google Scholar
• Kang, K.-W., H.-H. Doh, J.-H. Park, and D.-H. Lee. 2012. “Disassembly Leveling and Lot Sizing for Multiple Product Types: A Basic Model and its Extension.” The International Journal of Advanced Manufacturing Technology 62: 1–11.
   Web of Science ®Google Scholar
• Kim, J.-G., H.-B. Jeon, H.-J. Kim, D.-H. Lee, and P. Xirouchakis. 2006. “Disassembly Scheduling with Capacity Constraints: Minimizing the Number of Products Disassembled.” Proceedings of the Institution of Mechanical Engineers, Part B: Journal of Engineering Manufacture 220 (9): 1473–1481.
   Web of Science ®Google Scholar
• Kim, D.-H., and D.-H. Lee. 2011. “A Heuristic for Multi-period Disassembly Leveling and Scheduling.” In 2011 IEEE/SICE International Symposium on System Integration (SII-2011), 762–767. Kyoto: IEEE.
   Google Scholar
• Kim, H.-J., D.-H. Lee, and P. Xirouchakis. 2005. “A Lagrangean heuristic Algorithm for Disassembly Scheduling with Capacity Constraints.” Journal of the Operational Research Society 57 (10): 1231–1240.
   Web of Science ®Google Scholar
• Kim, H.-J., D.-H. Lee, and P. Xirouchakis. 2006. “Two-phase Heuristic for Disassembly Scheduling with Multiple Product Types and Parts Commonality.” International Journal of Production Research 44 (1): 195–212.
   Web of Science ®Google Scholar
• Kim, H.-J., D.-H. Lee, and P. Xirouchakis. 2007. “Disassembly Scheduling: Literature Review and Future Research Directions.” International Journal of Production Research 45 (18–19): 4465–4484.
   Web of Science ®Google Scholar
• Kim, H.-J., D.-H. Lee, P. Xirouchakis, and O.-K. Kwon. 2008. “A Branch and Bound Algorithm for Disassembly Scheduling with Assembly Product Structure.” Journal of the Operational Research Society 60 (3): 419–430.
   Web of Science ®Google Scholar
• Kim, H.-J., D.-H. Lee, P. Xirouchakis, and R. Züst. 2003. “Disassembly Scheduling with Multiple Product Types.” CIRP Annals-Manufacturing Technology 52 (1): 403–406.
   Web of Science ®Google Scholar
• Kim, H.-J., and P. Xirouchakis. 2010. “Capacitated Disassembly Scheduling with Random Demand.” International Journal of Production Research 48 (23): 7177–7194.
   Web of Science ®Google Scholar
• Kongar, E., and S. M. Gupta. 2002. “A Multi-criteria Decision Making Approach for Disassembly-to-Order Systems.” Journal of Electronics Manufacturing 11 (02): 171–183.
   Google Scholar
• Kongar, E., and S. M. Gupta. 2006. “Disassembly to Order System under Uncertainty.” Omega 34 (6): 550–561.
   Web of Science ®Google Scholar
• Lambert, A. J. D. 1999. “Linear Programming in Disassembly/Clustering Sequence Generation.” Computers & Industrial Engineering 36 (4): 723–738.
   Web of Science ®Google Scholar
• Lambert, A. J. D., and S. M. Gupta. 2002. “Demand-driven Disassembly Optimization for Electronic Products Package Reliability.” Journal of Electronics Manufacturing 11 (02): 121–135.
   Google Scholar
• Lambert, A. J. D., and S. M. Gupta. 2008. “Methods for Optimum and Near Optimum Disassembly Sequencing.” International Journal of Production Research 46 (11): 2845–2865.
   Web of Science ®Google Scholar
• Langella, I. M. 2007. “Heuristics for Demand-driven Disassembly Planning.” Computers & Operations Research 34 (2): 552–577.
   Web of Science ®Google Scholar
• Lee, D.-H., J.-G. Kang, and P. Xirouchakis. 2001. “Disassembly Planning and Scheduling: Review and Further Research.” Proceedings of the Institution of Mechanical Engineers, Part B: Journal of Engineering Manufacture 215 (5): 695–709.
   Web of Science ®Google Scholar
• Lee, D.-H., H.-J. Kim, G. Choi, and P. Xirouchakis. 2004. “Disassembly Scheduling: Integer Programming Models.” Proceedings of the Institution of Mechanical Engineers, Part B: Journal of Engineering Manufacture 218 (10): 1357–1372.
   Web of Science ®Google Scholar
• Lee, D.-H., and P. Xirouchakis. 2004. “A Two-stage Heuristic for Disassembly Scheduling with Assembly Product Structure.” Journal of the Operational Research Society 55 (3): 287–297.
   Web of Science ®Google Scholar
• Lee, D.-H., P. Xirouchakis, and R. Zust. 2002. “Disassembly Scheduling with Capacity Constraints.” CIRP Annals-Manufacturing Technology 51 (1): 387–390.
   Web of Science ®Google Scholar
• Lu, L., and X. Qi. 2011. “Dynamic Lot Sizing for Multiple Products with a New Joint Replenishment Model.” European Journal of Operational Research 212 (1): 74–80.
   Web of Science ®Google Scholar
• 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.
   Web of Science ®Google Scholar
• 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.
   Web of Science ®Google Scholar
• Morgan, S. D., and R. J. Gagnon. 2013. “A Systematic Literature Review of Remanufacturing Scheduling.” International Journal of Production Research 51 (16): 1–27.
   Web of Science ®Google Scholar
• Neuendorf, K. P., D.-H. Lee, D. Kiritsis, and P. Xirouchakis. 2001. “Disassembly Scheduling with Parts Commonality Using Petri Nets with Timestamps.” Fundamenta Informaticae 47 (3): 295–306.
   Web of Science ®Google Scholar
• Pan, M., and W. Wu. 2014. “Performance Analysis of Scheduling Rules in Remanufacturing Operations Using Stochastic Petri Nets.” In 2014 IEEE 11th International Conference on Networking, Sensing and Control (ICNSC), 120–125. Miami: IEEE.
   Google Scholar
• Prakash, P. K. S., D. Ceglarek, and M. K. Tiwari. 2012. “Constraint-based Simulated Annealing (CBSA) Approach to Solve the Disassembly Scheduling Problem.” The International Journal of Advanced Manufacturing Technology 60 (9–12): 1125–1137.
   Web of Science ®Google Scholar
• Rickli, J. L., and J. A. Camelio. 2014. “Partial Disassembly Sequencing Considering Acquired End-of-Life Product Age Distributions.” International Journal of Production Research 52 (24): 7496–7512.
   Web of Science ®Google Scholar
• Rios, P. J., and J. A. Stuart. 2004. “Scheduling Selective Disassembly for Plastics Recovery in an Electronics Recycling Center.” IEEE Transactions on Electronics Packaging Manufacturing 27 (3): 187–197.
   Web of Science ®Google Scholar
• Stuart, J. A., and V. Christina. 2003. “New Metrics and Scheduling Rules for Disassembly and Bulk Recycling.” IEEE Transactions on Electronics Packaging Manufacturing 26 (2): 133–140.
   Web of Science ®Google Scholar
• Sung, J., and B. Jeong. 2014. “A Heuristic for Disassembly Planning in Remanufacturing System.” The Scientific World Journal. doi: 10.1155/2014/949527.
   Web of Science ®Google Scholar
• Taleb, K. N., and S. M. Gupta. 1997. “Disassembly of Multiple Product Structures.” Computers & Industrial Engineering 32 (4): 949–961.
   Web of Science ®Google Scholar
• Taleb, K. N., S. M. Gupta, and L. Brennan. 1997. “Disassembly of Complex Product Structures with Parts and Materials Commonality.” Production Planning & Control 8 (3): 255–269.
   Web of Science ®Google Scholar
• Trigeiro, W. W., L. J. Thomas, and J. O. McClain. 1989. “Capacitated Lot Sizing with Setup Times.” Management Science 35 (3): 353–366.
   Web of Science ®Google Scholar
• Ullerich, C. 2014. Advanced Disassembly Planning: Flexible, Price-quantity Dependent, and Multi-period Planning Approaches. Dresden: Springer Gabler.
   Google Scholar
• Ullerich, C., and U. Buscher. 2013. “Flexible Disassembly Planning Considering Product Conditions.” International Journal of Production Research 51 (20): 6209–6228.
   Web of Science ®Google Scholar
• Vanderbeck, F. 1998. “Lot-sizing with Start-up Times.” Management Science 44 (10): 1409–1425.
   Web of Science ®Google Scholar
• Wang, H.-F., and Y.-S. Huang. 2013. “A Two-stage Robust Programming Approach to Demand-driven Disassembly Planning for a Closed-loop Supply Chain System.” International Journal of Production Research 51 (8): 2414–2432.
   Web of Science ®Google Scholar
• Wolsey, L. A. 1989. “Uncapacitated Lot-sizing Problems with Start-up Costs.” Operations Research 37 (5): 741–747.
   Web of Science ®Google Scholar
• Wolsey, L. A. 1998. Integer Programming. Series in Discrete Mathematics and Optimization. New York: Wiley.
   Google Scholar
• Zhang, Z.-H., H. Jiang, and X. Pan. 2012. “A Lagrangian Relaxation Based Approach for the Capacitated Lot Sizing Problem in Closed-loop Supply Chain.” International Journal of Production Economics 140 (1): 249–255.
   Web of Science ®Google Scholar