A scheduling model for the refurbishing process in recycling management

International Journal of Production Research

Volumn 51, Issue 23-24, 2013, Pages 7120-7139

  Cheng, T C E ^a   Lin, B M T ^b   Tian, Y ^b  

^a HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

^b NATIONAL CHIAO TUNG UNIVERSITY   (Taiwan)

Author keywords

Approximation algorithm; Operation based performance measure; Refurbishing flowshop; Weighted total completion time

Indexed keywords

ANT COLONY OPTIMISATION; COMPUTATIONAL EXPERIMENT; DISAGGREGATION TECHNIQUES; FLOW-SHOPS; META HEURISTIC ALGORITHM; PERFORMANCE MEASURE; TOTAL COMPLETION TIME; WEIGHTED SHORTEST PROCESSING TIME;

APPROXIMATION ALGORITHMS; HEURISTIC METHODS;

SCHEDULING;

EID: 84890552164     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/00207543.2013.842024     Document Type: Review

References (90)

1. Ahmadi, R. H., and U. Bagchi. 1990. "Improved Lower Bounds forMinimizing the Sum of Completion Times of n Jobs Over m Machines in a Flow Shop." European Journal of Operational Research 44 (3): 331-336. (Pubitemid 20705769)
2. Alcalay, J. A., and E. S. Buffa. 1963. "A Proposal for a General Model of a Production System." International Journal of Production Research 2 (1): 73-88.
3. Andrew-Munot, M., and R. N. Ibrahim. 2012. "Development and Analysis of Mathematical and Simulation Models of Decision-making Tools for Remanufacturing." Production Planning and Control. doi:10.1080/09537287. 2012.654667.
4. Atasu, A., and S. Centinkaya. 2006. "Lot Sizing for Optimal Collection and Use of Remanufacturable Returns Over a Finite Life-cycle." Production and Operations Management 15 (4): 473-487.
5. Baum, E. B. 1986. Iterated descent: A better algorithm for local search in combinatorial optimization problems. Manuscript.
6. Brah, S.A., and L. L. Loo. 1999. "Heuristics for Scheduling in a Flow Shop with Multiple Processors." European Journal of Operational Research 113 (1): 113-122.
7. Campbell, H.G., R.A.Dudek, and M. L. Smith. 1970. " AHeuristicAlgorithm for the n-Jobm-Machine Sequencing Problem." Management Science 16 (10): 630-637.
8. Charlton, J. M., and C. C. Death. 1968. "A General Method for Machine Scheduling." International Journal of Production Research 7 (3): 207-217.
9. Cheng, T. C. E., M. Y. Kovalyov, and B. M. T. Lin. 1997. "Single Machine Scheduling to Minimize the Batch Delivery and Job Earliness Penalty." SIAM Journal on Optimization 7 (2): 547-559.
10. Cheng, T. C. E., and B. M. T. Lin. 2009. "Johnson's Rule, Composite Jobs and the Relocation Problem." European Journal of Operational Research 192 (3): 1008-1013.
11. Cheng, T. C. E., B. M. T. Lin, and Y. Tian. 2009. "Scheduling of a Two-stage Differentiation Flowshop to Minimize Weighted Sum of Machine Completion Times." Computers and Operations Research. 36 (11): 3031-3040.
12. Cheng, T. C. E., B. M. T. Lin, and A. Toker. 2000. "Flowshop Batching and Scheduling to Minimize the Makespan." Naval Research Logistics 47 (2): 128-144. (Pubitemid 30563277)
13. Colorni, A., M. Dorigo, and V. Maniezzo. 1991. The Ant System: An Autocatatlytic Process. Technical Report 91-016, Italy: Politecnico di Milano.
14. Conway, R.W., W. L. Maxwell, and L.W. Miller. 1967. Theory of Scheduling. Reading, MA: Addison-Wesley.
15. Correa, J. R. and A. S. Schulz. 2005. "Single-Machine Scheduling with Precedence Constraints." Operations Research 30 (4): 1005-1021. (Pubitemid 43134188)
16. Della Croce, F., M. Ghirardi, and R. Tadei. 2002. "An Improved Branch-and-bound Algorithm for the Two Machine Total Completion Time Flow Shop Problem." European Journal of Operational Research 139 (2): 293-301. (Pubitemid 34201240)
17. Della Croce, F., V. Narayan, and R. Tadei. 1996. "The Two-machine Total Completion Time Flow Shop Problem." European Journal of Operational Research 90 (2): 227-237. (Pubitemid 126652211)
18. Dong, X., H. Huang, and P. Chen. 2009. "An Iterated Local Search Algorithm for the Permutation Flowshop Problem with Total Flowtime Criterion." Computers and Operations Research 36 (5): 664-1669.
19. Dorigo, M., 1992. "Optimization, Learning and Natural Algorithms." PhD Thesis, Politecnico di Milano, Italy.
20. Environmental Leader. 2011. "Dell Closing in on Recycling Goal." Accessed September 10, 2012. http://www.environmentalleader.com/ 2011/04/19/dell-closing-in-on-recycling-goal
21. Ferguson, M. E., and L. B. Toktay. 2006. "The Effect of Competition on Recovery Strategies." Production and Operations Management 15 (3): 351-368.
22. Ferrer, G., and J. M. Swaminathan. 2006. "Managing New and Remanufactured Products." Management Science 52 (1): 15-26.
23. Ferrer, G., and J. M. Swaminathan. 2010. "Managing New and Differentiated Remanufactured Products." European Journal of Operational Research 203 (2): 370-379.
24. Framinan, J.M., R. Leistenb, and R. Ruiz-Usanoa. 2002. "Efficient Heuristics for Flowshop Sequencing with the Objectives of Makespan and Flowtime Minimisation." European Journal of Operational Research 141 (3): 559-569.
25. Gajpal, Y., and C. Rajendran. 2006. "An Ant-colony Optimization Algorithm for Minimizing the Completion-time Variance of Jobs in Flowshops." International Journal of Production Economics 101 (2): 259-272. (Pubitemid 43177614)
26. Galbreth, M. R., and J. D. Blackburn. 2006. "Optimal Acquisition and Sorting Policies for Remanufacturing." Production and Operations Management 15 (3): 384-392.
27. Gantt, H. L. 1919. "Efficiency and Democracy." Transactions of the American Society of Mechanical Engineers 40: 799-808.
28. Garey, M. R., and D. S. Johnson. 1979. Computers and Intractability: A Guide to the Theory of NP-completeness. San Francisco, CA: Freedman.
29. Garey, M. R., D. S. Johnson, and R. Sethi. 1976. "The Complexity of Flowshop and Jobshop Scheduling." Mathematics of Operations Research 1 (2): 117-129.
30. Georgiadis, P., D. Vlachos, and G. Tagaras. 2006. "The Impact of Product Lifecycle on Capacity Planning of Closed-loop Supply Chains with Remanufacturing." Production and Operations Management 15 (4): 514-527.
31. Gonzalez, T., and S. Sahni. 1978. "Flowshop and Jobshop Schedules: Complexity and Approximation." Operations Research 26 (1): 36-52. (Pubitemid 8576420)
32. Gupta, J. N. D. 1968. "A General Method for the n × M Flowshop Scheduling Problem." International Journal of Production Research 7 (3): 241-247.
33. Gupta, J. N. D., and J. E. Schaller. 2006. "Minimizing Flow Time in a Flow-line Manufacturing Cell with Family Setup Times." Journal of the Operational Research Society 57 (2): 163-176. (Pubitemid 43149282)
34. Hall, L. A. 1996. "Approximation Algorithms for Scheduling." In Approximation Algorithms for NP-hard Problems, edited by Dorit S. Hochbaum, 1-45. Boston, MA: PWS.
35. Herrmann, J.W. and C.Y. Lee. 1992. Three-Machine Look-ahead Scheduling Problems. Research Report 92-93, Department of Industrial Engineering, University of Florida, Florida.
36. Hoogeveen, J.A., and T. Kawaguchi. 1999. "Minimizing Total Completion Time in a Two-machine Flowshop: Analysis of Special Cases." Mathematics of Operations Research 24 (4): 887-913.
37. Hoogeveen, H., L. van Norden, and S. L. van de Velde. 2006. "Lower Bounds for Minimizing Total Completion Time in a Two-machine Flow Shop." Journal of Scheduling 9 (6): 559-568. (Pubitemid 44127396)
38. Hoogeveen, J.A., and S. L. van deVelde. 1995. "Stronger Lagrangian Bounds by Use of SlackVariables:Application toMachine Scheduling Problems." Mathematical Programming 70 (1-3): 173-190.
39. Hall, L. A., A. S. Schulz, D. B. Shmoys, and J. Wein. 1997. "Scheduling to Minimize Average Completion Time: Off-line and On-line Approximation Algorithms." Mathematics of Operations Research 22 (3): 513-544. (Pubitemid 127653350)
40. HP Environmental History. 2012. "Milestones." Accessed September 10, 2012. http://www8.hp.com/us/en/hp-information/environment/our- history.html
41. Huang, T. C., and B. M. T. Lin. 2013. "Batch Scheduling in Differentiation Flow Shops forMakespanMinimisation." International Journal of Production Research. 51 (17): 5073-5082.
42. Hwang, C.-L., F.A. Tillman, and L. T. Fan. 1967. "Optimization of Production Scheduling." International Journal of Production Research 5 (4): 341-346.
43. Ignall, E., and L. E. Schrage. 1965. "Application of the Branch-and-boundTechnique to Some Flow-shop Scheduling Problems." Operations Research 13: 400-412.
44. Johnson, S. M. 1954. "Optimal Two- and Three-stage Production Schedules with Setup Times Included." Naval Research Logistics Quarterly 1 (1): 61-67.
45. Karamouzian, A., E. Teimoury, and M. Modarres. 2011. "A Model for Admission Control of Returned Products in a Remanufacturing Facility Using Queuing Theory." International Journal of Advanced Manufacturing Technology 54 (1-4): 403-412.
46. Ketzenberg, M. E., and G. C. Souza. 2003. "Mixed Assembly and Disassembly Operations for Remanufacturing." Production and Operations Management 12 (3): 320-335. (Pubitemid 39374573)
47. Lanna, A., G. Mosheiov, and Y. Rinott. 1998. "Asymptotic Optimality in Probability of a Heuristic Schedule for Open Shops with Job Overlaps." Operations Research Letters 22 (2-3): 63-68. (Pubitemid 128458159)
48. Lee, C. Y., T. C. E. Cheng, and B. M. T. Lin. 1993. "Minimizing the Makespan in Three-machine Assembly Type Flow Shop Problem." Management Science 39 (5): 616-625.
49. Lenstra, J. K., and A. H. G. Rinnooy Kan. 1977. "Complexity of Machine Scheduling Problems." Annals of Discrete Mathematics 1: 343-362.
50. Lenstra, J. K., D. B. Shmoys, and E.Tardos. 1990. " ApproximationAlgorithms for SchedulingUnrelated Parallel Machines." Mathematical Programming 46 (1-3): 259-271.
51. Leung, J. Y.-T., H. Li, and M. Pinedo. 2007. "Scheduling Orders for Multiple Product Types to Minimize Total Weighted Completion Time." Discrete Applied Mathematics 155 (8): 945-970. (Pubitemid 46436154)
52. Lin, B. M. T., and T. C. E. Cheng. 2011. "Concurrent Open Shop Scheduling with Centralized and Decentralized Batching Policies." Naval Research Logistics 58 (1): 17-27.
53. Lin, B. M. T., and F. J. Hwang. 2011. "Total Completion Time Minimization in a 2-Stage Differentiation Flowshop with Fixed Sequences Per Job Type." Information Processing Letters 111 (5): 208-212.
54. Lin, B. M. T., and A. V. Kononov. 2007. "Customer Order Scheduling to Minimize the Number of Late Jobs." European Journal of Operational Research 183 (2): 944-948. (Pubitemid 46891142)
55. Lin, B. M. T., C. Y. Lu, S. J. Shyu, and C. Y. Tsai. 2008. "Development of New Features of Ant Colony Optimization for Flowshop Scheduling." International Journal of Production Economics 112 (2): 742-755. (Pubitemid 351289068)
56. Lin, B. M. T., and J. M.Wu. 2005. "A Simple Lower Bound for Two Machine Flowshop Scheduling toMinimize Total Completion Time." Asia Pacific Journal of Operational Research 22 (3): 391-408.
57. Lin, B. M. T., and J. M.Wu. 2006. "Bicriteria Scheduling in a Two-machine Permutation Flowshop." International Journal of Production Research 44 (12): 2299-2312.
58. Liu, Y. C., K. T. Fang, and B. M. T. Lin. 2013. "A branch-and-bound Algorithm for Makespan Minimization in Differentiation Flow Shops." Engineering Optimization. doi:10.1080/0305215X.2012.737783.
59. Lourenço, H. R., O. C. Martin, and T. Stützle. 2010. "Iterated Local Search: Framework and Applications." In Handbook of Metaheuristics, edited by M. Gendreau, J.-Y. Potvin, 321-354. New York: Springer.
60. Martin, O. C., and S.W. Otto. 1996. "Combining Simulated Annealing with Local Search Heuristics." Annals of Operations Research 63 (1): 57-75. (Pubitemid 126729235)
61. Mastrolilli, M., M. Queyranne, A. S. Schulz, O. Svensson, and N. A. Uhan. 2010. "Minimizing the Sum of Weighted Completion Times in a Concurrent Open Shop." Operations Research Letters 38 (5): 390-395.
62. Maxwell, W. L. 1964. "The Scheduling of Single Machine Systems: A Review." International Journal of Production Research 3 (3): 177-198.
63. Minner, S., and G. P. Kiesmller. 2011. "Dynamic Product Acquisition in Closed Loop Supply Chains." International Journal of Production Research 50 (11): 2836-2851.
64. Nawaz, M., E. E. Enscore, and I. Ham. 1983. "A Heuristic Algorithm for the m-Machine, n-Job Flowshop Sequencing Problem." Omega 11 (1): 91-95. (Pubitemid 13193807)
65. Neumytov, Y. D., and S. V. Sevastianov. 1993. "Approximation Algorithm with Tight Bound for Three-machine Counter-routes Problem (in Russian)." Upravlyaemye Sistemy 31: 53-65.
66. Oguz, C., B. M. T. Lin, and T. C. E. Cheng. 1997. "Two-stage Flowshop Scheduling Problem with a Common Second-stage Machine." Computers and Operations Research 24 (12): 1169-1174.
67. Ovchinnikov, A. 2011. "Revenue and Cost Management for Remanufactured Products." Production and Operations Management 20 (6): 824-840.
68. Pinedo, M. 2012. Scheduling: Theory, Algorithms, and Systems. New York: Springer.
69. Potts, C.N., S.V. Sevast'janov, V.A. Strusevich, L. N.VanWassenhove, and C. M. Zwaneveld. 1995. "TheTwo-stageAssembly Scheduling Problem: Complexity and Approximation." Operations Research 43 (2): 346-355.
70. Queyranne, M. 1993. "Structure of a Simple Scheduling Problem." Mathematical Programming 58 (1-3): 263-285.
71. Rajendran, C., and H. Ziegler. 2004. "Ant-colonyAlgorithms for Permutation Flowshop Scheduling toMinimizeMakespan/Total Flowtime of Jobs." European Journal of Operational Research 155 (2): 426-438.
72. Roemer, T. A. 2006. "A Note on the Complexity of the Concurrent Open Shop Problem." Journal of Scheduling 9 (4): 389-396. (Pubitemid 43742243)
73. Roy, S., and N. Geetha. 2006. "eWaste." Express Channel Business, 2006. Accessed February 04, 2008. http://www.channelbusiness.in/index. php?option=com-content&task=view&id=302&Itemid=78
74. Schulz, A. S. 1996. "Scheduling to Minimize Total Weighted Completion Time: Performance Guarantees of LP-based Heuristics and Lower Bounds." In Integer Programming and Combinatorial Optimization, Lecture Notes in Artificial Intelligence 1084, edited byW. H. Cunningham and M. Queyranne, Berlin, Heidelberg: Springer.
75. Schwarzer, S., A. De One, P. Peduzzi, G. Giuliani, and S. Kluser. 2005. "E-waste, the hidden side of IT equipment's manufacturing and use. Envirenment Alert Bulletin, UNEP." AccessedApril 08, 2007. http://www.grid.unep.ch/product/publication/download/ew-ewaste.en.pdf
76. Stoner, F., and C.Wankel. 2008. Global Sustainability Initiatives:New Models and NewApproaches.Charlotte, North Carolina: Information Age Publishing.
77. Shmoys, D. B., and E. Tardos. 1993. "AnApproximationAlgorithm for the GeneralizedAssignment Problem." Mathematical Programming 62 (1-3): 461-474.
78. Stützle, T., 1998. Applying Iterated Local Search to the Permutation Flow Shop Problem. Technical Report AIDA-98-04, FG Intellektik, TU: Darmstadt.
79. Tang, O., and R. Teunter. 2006. "Economic Lot Scheduling Problem with Returns." Production and Operations Management 15 (4): 488-496.
80. T'kindt, V., N. Monmarché, F. Tercinet, and D. Laügt. 2002. "An Ant Colony Optimization Algorithm to Solve a 2-Machine Bicriteria Flowshop Scheduling Problem." European Journal of Operational Research 142 (2): 250-257. (Pubitemid 34803131)
81. UNEP. 2007. "E-Waste: Inventory Assessment Manual." United Nations Environment Programme. http://www.unep.org/ietc/Portals/136/ Publications/Waste%20Management/Ewaste%20Manual%203.pdf
82. UNEP. 2010. Urgent Need to Prepare Developing Countries for Surge in E-Wastes. Bali, Indonesia: United Nations Environment Programme press release.
83. US EPA. 2007a. "Management of ElectronicWaste in the United States: Approach One. U.S. Environmental ProtectionAgency, eCycling, EPA 530-R-07-004a." Accessed September 11, 2012. http://www.epa.gov/osw/ conserve/materials/ecycling/docs/app-1.pdf
84. US EPA. 2007b. "Management of ElectronicWaste in the United States: Approach two. U.S. Environmental ProtectionAgency, eCycling, EPA530-R-07-004b." Accessed September 11, 2012. http://www.epa.gov/osw/ conserve/materials/ecycling/docs/app-2.pdf
85. US EPA. 2007c. "Management of Electronic Waste in the United States: Fact Sheet. U.S. Environmental Protection Agency, eCycling." Accessed September 11, 2012. http://www.epa.gov/osw/conserve/materials/ecycling/docs/ fact7-08.pdf
86. van de Velde, S. L. 1990. "Minimizing the Sum of Job Completion Times in the Two-machine Flow-shop by Lagrangean Relaxation." Annals of Operations Research 26 (1-4): 257-268.
87. Vorasayan, J., and S. M. Ryan. 2006. "Optimal Price and Quantity of Refurbished Products." Production and Operations Management 15 (3): 369-383.
88. Wang, G., and T. C. E. Cheng. 2007. "Customer Order Scheduling toMinimize TotalWeighted Completion Time." Omega 35 (5): 623-626. (Pubitemid 44835391)
89. Yang, J. 2010."ANewComplexity Proof for theTwo-stageHybrid Flow Shop Scheduling Problem with Dedicated Machines." International Journal of Production Research 48 (5): 1531-1538.
90. Yang, Y., S. Kreipl, and M. Pinedo. 2000. "Heuristics for Minimizing Total Weighted Tardiness in Flexible Flow Shops." Journal of Scheduling 3 (2): 89-108.