296
Views
0
CrossRef citations to date
0
Altmetric
Research Articles

Combinatorial Benders decomposition for melted material blending systems considering transportation and scheduling

&
Pages 3481-3503 | Received 01 Jun 2021, Accepted 29 May 2022, Published online: 10 Jun 2022

References

  • Angulo, G., and M. Van Vyve. 2017. “Fixed-charge Transportation Problems on Trees.” Operations Research Letters 45 (3): 275–281.
  • Atighehchian, A., M. Bijari, and H. Tarkesh. 2009. “A Novel Hybrid Algorithm for Scheduling Steel-Making Continuous Casting Production.” Computers & Operations Research 36 (8): 2450–2461.
  • Bai, L., and P. A. Rubin. 2009. “Combinatorial Benders Cuts for the Minimum Tollbooth Problem.” Operations Research 57 (6): 1510–1522.
  • Behnamian, J. 2014. “Decomposition Based Hybrid VNS-TS Algorithm for Distributed Parallel Factories Scheduling with Virtual Corporation.” Computers & Operations Research 52: 181–191.
  • Burdett, R. L., P. Corry, P. K. Yarlagadda, C. Eustace, and S. Smith. 2019. “A Flexible job Shop Scheduling Approach with Operators for Coal Export Terminals.” Computers & Operations Research 104: 15–36.
  • Castillo, P. A., P. M. Castro, and V. Mahalec. 2017. “Global Optimization of Nonlinear Blend-Scheduling Problems.” Engineering 3 (2): 188–201.
  • Cerdá, J., P. C. Pautasso, and D. C. Cafaro. 2016. “Optimizing Gasoline Recipes and Blending Operations Using Nonlinear Blend Models.” Industrial & Engineering Chemistry Research 55 (28): 7782–7800.
  • Chang, J. C., S. C. Graves, R. E. Kirchain, and E. A. Olivetti. 2019. “Integrated Planning for Design and Production in two-Stage Recycling Operations.” European Journal of Operational Research 273 (2): 535–547.
  • Chen, J. H., D. H. Lee, and J. X. Cao. 2012. “A Combinatorial Benders’ Cuts Algorithm for the Quayside Operation Problem at Container Terminals.” Transportation Research Part E: Logistics and Transportation Review 48 (1): 266–275.
  • Cheng, P., P. Garcia-Herreros, M. Lalpuria, and I. E. Grossmann. 2020. “Optimal Scheduling of Copper Concentrate Operations Under Uncertainty.” Computers & Chemical Engineering 140: 106919.
  • Cheng, Q., S. Ning, X. Xia, and F. Yang. 2016. “Modelling of Coal Trade Process for the Logistics Enterprise and its Optimisation with Stochastic Predictive Control.” International Journal of Production Research 54 (8): 2241–2259.
  • Chinneck, J. W. 2008. “International Series in Operations Research and Management Science.” International Series in Operations Research and Management Science 118: 93–157.
  • Codato, G., and M. Fischetti. 2006. “Combinatorial Benders’ Cuts for Mixed-Integer Linear Programming.” Operations Research 54 (4): 756–766.
  • Côté, J. F., M. Dell’Amico, and M. Iori. 2014. “Combinatorial Benders’ Cuts for the Strip Packing Problem.” Operations Research 62 (3): 643–661.
  • D’Ambrosio, C., A. Frangioni, L. Liberti, and A. Lodi. 2010. “On Interval-Subgradient and no-Good Cuts.” Operations Research Letters 38 (5): 341–345.
  • Dutta, G., and R. Fourer. 2001. “A Survey of Mathematical Programming Applications in Integrated Steel Plants.” Manufacturing & Service Operations Management 3 (4): 387–400.
  • Fröhling, M., F. Schwaderer, H. Bartusch, and O. Rentz. 2010. “Integrated Planning of Transportation and Recycling for Multiple Plants Based on Process Simulation.” European Journal of Operational Research 207 (2): 958–970.
  • Geiger, M. J., L. Kletzander, and N. Musliu. 2019. “Solving the Torpedo Scheduling Problem.” Journal of Artificial Intelligence Research 66: 1–32.
  • Gendron, B., M. G. Scutellà, R. G. Garroppo, G. Nencioni, and L. Tavanti. 2016. “A Branch-and-Benders-cut Method for Nonlinear Power Design in Green Wireless Local Area Networks.” European Journal of Operational Research 255 (1): 151–162.
  • Goldwaser, A., and A. Schutt. 2018. “Optimal Torpedo Scheduling.” Journal of Artificial Intelligence Research 63: 955–986.
  • Huang, D., Z. Mao, K. Fang, and B. Yuan. 2021. “Combinatorial Benders Decomposition for Mixed-model Two-sided Assembly Line Balancing Problem.” International Journal of Production Research 60 (8): 2598–2624.
  • Jia, Z., and M. Ierapetritou. 2003. “Mixed-integer Linear Programming Model for Gasoline Blending and Distribution Scheduling.” Industrial & Engineering Chemistry Research 42 (4): 825–835.
  • Jia, Z. H., X. X. Zhuo, J. Y. Leung, and K. Li. 2019. “Integrated Production and Transportation on Parallel Batch Machines to Minimize Total Weighted Delivery Time.” Computers & Operations Research 102: 39–51.
  • Karaoğlan, İ, and S. E. Kesen. 2017. “The Coordinated Production and Transportation Scheduling Problem with a Time-Sensitive Product: A Branch-and-cut Algorithm.” International Journal of Production Research 55 (2): 536–557.
  • Klotz, E., and A. M. Newman. 2013. “Practical Guidelines for Solving Difficult Mixed Integer Linear Programs.” Surveys in Operations Research and Management Science 18 (1-2): 18–32.
  • Leung, J. Y., and Z. L. Chen. 2013. “Integrated Production and Distribution with Fixed Delivery Departure Dates.” Operations Research Letters 41 (3): 290–293.
  • Missbauer, H., W. Hauber, and W. Stadler. 2009. “A Scheduling System for the Steelmaking-Continuous Casting Process. A Case Study from the Steel-Making Industry.” International Journal of Production Research 47 (15): 4147–4172.
  • Patterson, S. R., E. Kozan, and P. Hyland. 2016. “An Integrated Model of an Open-pit Coal Mine: Improving Energy Efficiency Decisions.” International Journal of Production Research 54 (14): 4213–4227.
  • Sbihi, A., A. Bellabdaoui, and J. Teghem. 2014. “Solving a Mixed Integer Linear Program with Times Setup for the Steel-Continuous Casting Planning and Scheduling Problem.” International Journal of Production Research 52 (24): 7276–7296.
  • Tang, L., P. B. Luh, J. Liu, and L. Fang. 2002. “Steel-making Process Scheduling Using Lagrangian Relaxation.” International Journal of Production Research 40 (1): 55–70.
  • Verderame, P. M., and C. A. Floudas. 2008. “Integrated Operational Planning and Medium-Term Scheduling for Large-Scale Industrial Batch Plants.” Industrial & Engineering Chemistry Research 47 (14): 4845–4860.
  • Verstichel, J., J. Kinable, P. De Causmaecker, and G. V. Berghe. 2015. “A Combinatorial Benders' Decomposition for the Lock Scheduling Problem.” Computers & Operations Research 54: 117–128.

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.