Coil Batching to Improve Productivity and Energy Utilization in Steel Production

References

• Aho AV, Garey MR, Ullman JD (1972) The transitive reduction of a directed graph. SIAM J. Comput. 1(2):131–137.Crossref, Google Scholar
• Avella P, Vasil’ev I (2005) A computational study of a cutting plane algorithm for university course timetabling. J. Scheduling 8(6):497–514.Crossref, Google Scholar
• Balakrishnan A, Geunes J (2003) Production planning with flexible product specifications: An application to specialty steel manufacturing. Oper. Res. 51(1):94–112.Link, Google Scholar
• Baldacci R, Christofides N, Mingozzi A (2008) An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts. Math. Programming 115(2):351–385.Crossref, Google Scholar
• Barnhart C, Johnson EL, Nemhauser GL, Savelsbergh MWP, Vance PH (1998) Branch-and-price: Column generation for solving huge integer programs. Oper. Res. 46(3):316–329.Link, Google Scholar
• Bianco L, Mingozzi A, Ricciardelli S (1994) A set partitioning approach to the multiple depot vehicle scheduling problem. Optim. Methods Software 3(1–3):163–194.Crossref, Google Scholar
• Chekuri C, Khanna S (2006) A PTAS for the multiple Knapsack problem. SIAM J. Comput. 35(3):713–728.Crossref, Google Scholar
• Chu CB, Antonio J (1999) Approximation algorithms to solve real-life multicriteria cutting stock problems. Oper. Res. 47(4):495–508.Link, Google Scholar
• Dawande M, Kalagnanam J, Keskinocak P, Ravi P, Salman F (2000) Approximation algorithms for the multiple knapsack problem with assignment restrictions. J. Combinatorial Optim. 4(2):171–186.Crossref, Google Scholar
• Dutta G, Fourer R (2001) A survey of mathematical programming applications in integrated steel plants. Manufacturing Service Oper. Management 3(4):387–400.Link, Google Scholar
• Glover F (1998) A template for scatter search and path relinking. Hao JK, Lutton E, Ronald E, Schoenauer M, Snyers D, eds. Artificial Evolution, Lecture Notes in Computer Science, Vol. 1363 (Springer, Heidelberg, Germany), 13–54.Crossref, Google Scholar
• Hadjar A, Marcotte O, Soumis F (2006) A branch-and-cut algorithm for the depot vehicle scheduling problem. Oper. Res. 54(1):130–149.Link, Google Scholar
• Höhn W, Jacobs T, Megow N (2012) On Eulerian extension and their application to no-wait flowshop scheduling. J. Scheduling 15(3):295–309.Crossref, Google Scholar
• Höhn W, König FG, Möhring RH (2011) Integrated sequencing and scheduling in coil coating. Management Sci. 57(4):647–666.Link, Google Scholar
• Kalagnanam JR, Dawande MW, Trumbo M, Lee HS (2000) The surplus inventory matching problem in the process industry. Oper. Res. 48(4):505–516.Link, Google Scholar
• Kellerer H, Pferschy U, Pisinger D (2004) Knapsack Problems (Springer, Berlin).Crossref, Google Scholar
• König FG, Lübbecke M, Möhring R, Schäfer G, Spenke I (2007) Solutions to real-world instances of PSPACE-complete stacking. Arge L, Hoffman M, Welzl E, eds. Algorithms: ESA 2007, Vol. 4698 (Springer, New York), 729–740.Crossref, Google Scholar
• Lee C-Y, Uzsoy R, Martin-Vega LA (1992) Efficient algorithms for scheduling semiconductor burn-in operations. Oper. Res. 40(4):764–775.Link, Google Scholar
• Lin J-H, Vitter JS (1992) ε-approximations with minimum packing constraint violation. Proc. 24th Annual ACM Sympos. Theory Comput. (ACM, New York), 771–782.Google Scholar
• Lübbecke ME, Desrosiers J (2005) Selected topics in column generation. Oper. Res. 53(6):1007–1023.Link, Google Scholar
• Martello S, Toth P (1990) Knapsack Problems: Algorithms and Computer Implementations (John Wiley & Sons, Hoboken, NJ).Google Scholar
• Megiddo N, Supowit J (1984) On the complexity of some common geometric location problems. SIAM J. Comput. 13(1):182–196.Crossref, Google Scholar
• Möhring RH, Andreas SS, Stork F, Uetz M (2003) Solving project scheduling problems by minimum cut computations. Management Sci. 49(3):330–350.Link, Google Scholar
• Moon S, Hrymak AN (1999) Scheduling of the batch annealing process-deterministic case. Comput. Chemical Engrg. 23(9):1193–1208.Crossref, Google Scholar
• Naphade KS, Wu SD, Storer RH, Doshi BJ (2001) Melt scheduling to trade off material waste and shipping performance. Oper. Res. 49(5):629–645.Link, Google Scholar
• Nemhauser GL, Wolsey LA (1988) Integer and Combinatorial Optimization (John Wiley & Sons, Hoboken, NJ).Crossref, Google Scholar
• Prasad P, Maravelias T (2008) Batch selection, assignment and sequencing in multi-stage multi-product processes. Comput. Chemical Engrg. 32(6):1106–1119.Crossref, Google Scholar
• Ranjbar M (2008) Solving the resource-constrained project scheduling problem using filter-and-fan approach. Appl. Math. Comput. 201(1–2):313–318.Crossref, Google Scholar
• Rego C, Duarte R (2009) A filter-and-fan approach to the job shop scheduling problem. Eur. J. Oper. Res. 194(3):650–662.Crossref, Google Scholar
• Rego C, Li H, Glover F (2011) A filter-and-fan approach to the 2D HP model of the protein folding problem. Ann. Oper. Res. 188(1):389–414.Crossref, Google Scholar
• Tang LX, Jiang SJ (2009) The charge batching planning problem in steelmaking process using Lagrangian relaxation algorithm. Indust. Engrg. Chem. Res. 48(16):7780–7787.Crossref, Google Scholar
• Tang LX, Wang G (2008) Decision support system for the batching problems of steelmaking and continuous-casting production. Omega 36(6):976–991.Crossref, Google Scholar
• Tang LX, Wang G, Chen Z-L (2014) Integrated charge batching and casting width selection at Baosteel. Oper. Res. 62(4):772–787.Link, Google Scholar
• Tang LX, Wang G, Liu JY (2011) A combination of Lagrangian relaxation and column generation for order batching in steelmaking and continuous-casting production. Naval Res. Logist. 58(4):370–388.Crossref, Google Scholar
• Tang LX, Xie X, Liu JY (2009) Scheduling of a single crane in batch annealing process. Comput. Oper. Res. 36(10):2853–2865.Crossref, Google Scholar
• Tang LX, Liu JY, Rong AY, Yang ZH (2000) A multiple traveling salesman problem model for hot rolling scheduling in Shanghai Baoshan Iron and Steel Complex. Eur. J. Oper. Res. 124(2):267–282.Crossref, Google Scholar
• Tang LX, Liu JY, Rong AY, Yang ZH (2001) A review of planning and scheduling systems and methods for integrated steel production. Eur. J. Oper. Res. 133(1):1–20.Crossref, Google Scholar
• Vonderembse MA, Haessler RW (1982) A mathematical programming approach to schedule master slab casters in the steel industry. Management Sci. 28(12):1450–1461.Link, Google Scholar