IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v407y2021ics0096300321004227.html
   My bibliography  Save this article

Modeling and application for rolling scheduling problem based on TSP

Author

Listed:
  • Su, Fuyong
  • Kong, Linglu
  • Wang, Hui
  • Wen, Zhi

Abstract

In the process of steel production, rolling scheduling is a complex problem in hot rolling production. In this paper, according to the hot rolling production process and product constraints of iron and steel enterprises, the problem of rolling plan formulation is attributed to asymmetric traveling salesman problem, and the mathematical model of rolling plan formulation is established.The simulation results show that the model and algorithm are effective and feasible.

Suggested Citation

  • Su, Fuyong & Kong, Linglu & Wang, Hui & Wen, Zhi, 2021. "Modeling and application for rolling scheduling problem based on TSP," Applied Mathematics and Computation, Elsevier, vol. 407(C).
    • Handle: RePEc:eee:apmaco:v:407:y:2021:i:c:s0096300321004227
    DOI: 10.1016/j.amc.2021.126333
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300321004227
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2021.126333?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Tang, Lixin & Liu, Jiyin & Rong, Aiying & Yang, Zihou, 2000. "A multiple traveling salesman problem model for hot rolling scheduling in Shanghai Baoshan Iron & Steel Complex," European Journal of Operational Research, Elsevier, vol. 124(2), pages 267-282, July.
    2. Lopez, Leo & Carter, Michael W. & Gendreau, Michel, 1998. "The hot strip mill production scheduling problem: A tabu search approach," European Journal of Operational Research, Elsevier, vol. 106(2-3), pages 317-335, April.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. D de Ladurantaye & M Gendreau & J-Y Potvin, 2007. "Scheduling a hot rolling mill," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(3), pages 288-300, March.
    2. Mujawar, Sachin & Huang, Simin & Nagi, Rakesh, 2012. "Scheduling to minimize stringer utilization for continuous annealing operations," Omega, Elsevier, vol. 40(4), pages 437-444.
    3. Torres, Nelson & Greivel, Gus & Betz, Joshua & Moreno, Eduardo & Newman, Alexandra & Thomas, Brian, 2024. "Optimizing steel coil production schedules under continuous casting and hot rolling," European Journal of Operational Research, Elsevier, vol. 314(2), pages 496-508.
    4. Karen Puttkammer & Matthias G. Wichmann & Thomas S. Spengler, 2016. "A GRASP heuristic for the hot strip mill scheduling problem under consideration of energy consumption," Journal of Business Economics, Springer, vol. 86(5), pages 537-573, July.
    5. Tang, Lixin & Wang, Xianpeng, 2009. "Simultaneously scheduling multiple turns for steel color-coating production," European Journal of Operational Research, Elsevier, vol. 198(3), pages 715-725, November.
    6. Tang, Lixin & Liu, Jiyin & Rong, Aiying & Yang, Zihou, 2001. "A review of planning and scheduling systems and methods for integrated steel production," European Journal of Operational Research, Elsevier, vol. 133(1), pages 1-20, August.
    7. Yuan, Shuai & Skinner, Bradley & Huang, Shoudong & Liu, Dikai, 2013. "A new crossover approach for solving the multiple travelling salesmen problem using genetic algorithms," European Journal of Operational Research, Elsevier, vol. 228(1), pages 72-82.
    8. Vo[ss], Stefan & Witt, Andreas, 2007. "Hybrid flow shop scheduling as a multi-mode multi-project scheduling problem with batching requirements: A real-world application," International Journal of Production Economics, Elsevier, vol. 105(2), pages 445-458, February.
    9. Lixin Tang & Gongshu Wang & Zhi-Long Chen, 2014. "Integrated Charge Batching and Casting Width Selection at Baosteel," Operations Research, INFORMS, vol. 62(4), pages 772-787, August.
    10. Antonio Jiménez-Martín & Alfonso Mateos & Josefa Z. Hernández, 2021. "Aluminium Parts Casting Scheduling Based on Simulated Annealing," Mathematics, MDPI, vol. 9(7), pages 1-18, March.
    11. Dominique Feillet & Pierre Dejax & Michel Gendreau, 2005. "Traveling Salesman Problems with Profits," Transportation Science, INFORMS, vol. 39(2), pages 188-205, May.
    12. Bellabdaoui, A. & Teghem, J., 2006. "A mixed-integer linear programming model for the continuous casting planning," International Journal of Production Economics, Elsevier, vol. 104(2), pages 260-270, December.
    13. Wang, John & Yan, Ruiliang & Hollister, Kimberly & Zhu, Dan, 2008. "A historic review of management science research in China," Omega, Elsevier, vol. 36(6), pages 919-932, December.
    14. Haluk Yapicioglu, 2018. "Multiperiod Multi Traveling Salesmen Problem Considering Time Window Constraints with an Application to a Real World Case," Networks and Spatial Economics, Springer, vol. 18(4), pages 773-801, December.
    15. Nikolakopoulos, Athanassios & Sarimveis, Haralambos, 2007. "A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 177(3), pages 1911-1929, March.
    16. Kara, Imdat & Bektas, Tolga, 2006. "Integer linear programming formulations of multiple salesman problems and its variations," European Journal of Operational Research, Elsevier, vol. 174(3), pages 1449-1458, November.
    17. Tamás Kalmár-Nagy & Giovanni Giardini & Bendegúz Dezső Bak, 2017. "The Multiagent Planning Problem," Complexity, Hindawi, vol. 2017, pages 1-12, February.
    18. Tang, Lixin & Wang, Gongshu, 2008. "Decision support system for the batching problems of steelmaking and continuous-casting production," Omega, Elsevier, vol. 36(6), pages 976-991, December.
    19. Liu, Ying & Dong, Haibo & Lohse, Niels & Petrovic, Sanja, 2016. "A multi-objective genetic algorithm for optimisation of energy consumption and shop floor production performance," International Journal of Production Economics, Elsevier, vol. 179(C), pages 259-272.
    20. Ferretti, Ivan & Zanoni, Simone & Zavanella, Lucio, 2006. "Production-inventory scheduling using Ant System metaheuristic," International Journal of Production Economics, Elsevier, vol. 104(2), pages 317-326, December.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:apmaco:v:407:y:2021:i:c:s0096300321004227. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.