IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v316y2024i1p282-294.html
   My bibliography  Save this article

Scheduling of parallel continuous annealing lines with alternative processing modes to optimize efficiency under tardiness constraints

Author

Listed:
  • Wegel, Sebastian
  • Ivanov, Anton
  • Lenz, Ralf
  • Volling, Thomas

Abstract

Continuous annealing is a core process in steel cold-rolling facilities. It is used to set desired material properties by passing coils of flat steel through a high-temperature furnace in a precisely controlled manner. High efficiency is achieved by feeding the steel through the furnace in the form of a continuous strand. For this purpose, the coils are welded together before being fed into the furnace. Whenever two consecutive coils are incompatible, a special dummy coil called stringer is used to connect them, which reduces efficiency and adds costs and emissions. We consider the scheduling of coils with specific due dates and alternative order-specific processing modes on parallel heterogeneous lines. The problem is to simultaneously assign coils to lines and sequence them on these lines with a defined processing mode with adherence to tardiness constraints while minimizing the number of stringers needed. To address this problem, we formulate a mixed-integer linear program based on a model from the literature and propose a two-phase heuristic solution procedure. The procedure combines an opening phase using shortest path algorithms and local search with an improvement phase based on problem-specific decompositions according to the principles of an Fix-and-Optimize procedure. The results show that our heuristic outperforms a state-of-the-art commercial solver in finding good solutions in short computation time. Based on a sensitivity analysis for several industry-inspired data sets, we observe a trade-off between efficiency and tardiness which strongly depends on the operating conditions.

Suggested Citation

  • Wegel, Sebastian & Ivanov, Anton & Lenz, Ralf & Volling, Thomas, 2024. "Scheduling of parallel continuous annealing lines with alternative processing modes to optimize efficiency under tardiness constraints," European Journal of Operational Research, Elsevier, vol. 316(1), pages 282-294.
  • Handle: RePEc:eee:ejores:v:316:y:2024:i:1:p:282-294
    DOI: 10.1016/j.ejor.2023.12.032
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221723009815
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.ejor.2023.12.032?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. Allahverdi, Ali, 2015. "The third comprehensive survey on scheduling problems with setup times/costs," European Journal of Operational Research, Elsevier, vol. 246(2), pages 345-378.
    2. L Tang & X Wang, 2008. "An iterated local search heuristic for the capacitated prize-collecting travelling salesman problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(5), pages 590-599, May.
    3. C N Potts & V A Strusevich, 2009. "Fifty years of scheduling: a survey of milestones," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(1), pages 41-68, May.
    4. Mujawar, Sachin & Huang, Simin & Nagi, Rakesh, 2012. "Scheduling to minimize stringer utilization for continuous annealing operations," Omega, Elsevier, vol. 40(4), pages 437-444.
    5. Kalyanmoy Deb & Kalyanmoy Deb, 2014. "Multi-objective Optimization," Springer Books, in: Edmund K. Burke & Graham Kendall (ed.), Search Methodologies, edition 2, chapter 0, pages 403-449, Springer.
    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. Dušan Knop & Martin Koutecký, 2018. "Scheduling meets n-fold integer programming," Journal of Scheduling, Springer, vol. 21(5), pages 493-503, October.
    2. Jianxin Fang & Brenda Cheang & Andrew Lim, 2023. "Problems and Solution Methods of Machine Scheduling in Semiconductor Manufacturing Operations: A Survey," Sustainability, MDPI, vol. 15(17), pages 1-44, August.
    3. Ullrich, Christian A., 2013. "Integrated machine scheduling and vehicle routing with time windows," European Journal of Operational Research, Elsevier, vol. 227(1), pages 152-165.
    4. Shahvari, Omid & Logendran, Rasaratnam, 2016. "Hybrid flow shop batching and scheduling with a bi-criteria objective," International Journal of Production Economics, Elsevier, vol. 179(C), pages 239-258.
    5. Ravindran Vijayalakshmi, Vipin & Schröder, Marc & Tamir, Tami, 2024. "Minimizing total completion time with machine-dependent priority lists," European Journal of Operational Research, Elsevier, vol. 315(3), pages 844-854.
    6. Hongjun Wei & Jinjiang Yuan & Yuan Gao, 2019. "Transportation and Batching Scheduling for Minimizing Total Weighted Completion Time," Mathematics, MDPI, vol. 7(9), pages 1-10, September.
    7. Nondy, J. & Gogoi, T.K., 2021. "Performance comparison of multi-objective evolutionary algorithms for exergetic and exergoenvironomic optimization of a benchmark combined heat and power system," Energy, Elsevier, vol. 233(C).
    8. Dirk Briskorn & Konrad Stephan & Nils Boysen, 2022. "Minimizing the makespan on a single machine subject to modular setups," Journal of Scheduling, Springer, vol. 25(1), pages 125-137, February.
    9. Zigao Wu & Shaohua Yu & Tiancheng Li, 2019. "A Meta-Model-Based Multi-Objective Evolutionary Approach to Robust Job Shop Scheduling," Mathematics, MDPI, vol. 7(6), pages 1-19, June.
    10. Jin Xu & Natarajan Gautam, 2020. "On competitive analysis for polling systems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 67(6), pages 404-419, September.
    11. Calmels, Dorothea, 2022. "An iterated local search procedure for the job sequencing and tool switching problem with non-identical parallel machines," European Journal of Operational Research, Elsevier, vol. 297(1), pages 66-85.
    12. Timo Gschwind & Stefan Irnich & Christian Tilk & Simon Emde, 2020. "Branch-cut-and-price for scheduling deliveries with time windows in a direct shipping network," Journal of Scheduling, Springer, vol. 23(3), pages 363-377, June.
    13. Yepes-Borrero, Juan C. & Perea, Federico & Ruiz, Rubén & Villa, Fulgencia, 2021. "Bi-objective parallel machine scheduling with additional resources during setups," European Journal of Operational Research, Elsevier, vol. 292(2), pages 443-455.
    14. Devansh Jalota & Dario Paccagnan & Maximilian Schiffer & Marco Pavone, 2023. "Online Routing Over Parallel Networks: Deterministic Limits and Data-driven Enhancements," INFORMS Journal on Computing, INFORMS, vol. 35(3), pages 560-577, May.
    15. Manuel Ostermeier & Andreas Holzapfel & Heinrich Kuhn & Daniel Schubert, 2022. "Integrated zone picking and vehicle routing operations with restricted intermediate storage," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 44(3), pages 795-832, September.
    16. Mohammad Reza Hosseinzadeh & Mehdi Heydari & Mohammad Mahdavi Mazdeh, 2022. "Mathematical modeling and two metaheuristic algorithms for integrated process planning and group scheduling with sequence-dependent setup time," Operational Research, Springer, vol. 22(5), pages 5055-5105, November.
    17. Fátima Pilar & Eliana Costa e Silva & Ana Borges, 2023. "Optimizing Vehicle Repairs Scheduling Using Mixed Integer Linear Programming: A Case Study in the Portuguese Automobile Sector," Mathematics, MDPI, vol. 11(11), pages 1-23, June.
    18. Sheikh, Shaya & Komaki, G.M. & Kayvanfar, Vahid & Teymourian, Ehsan, 2019. "Multi-Stage assembly flow shop with setup time and release time," Operations Research Perspectives, Elsevier, vol. 6(C).
    19. Sioud, A. & Gagné, C., 2018. "Enhanced migrating birds optimization algorithm for the permutation flow shop problem with sequence dependent setup times," European Journal of Operational Research, Elsevier, vol. 264(1), pages 66-73.
    20. Smedberg, Henrik & Bandaru, Sunith, 2023. "Interactive knowledge discovery and knowledge visualization for decision support in multi-objective optimization," European Journal of Operational Research, Elsevier, vol. 306(3), pages 1311-1329.

    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:ejores:v:316:y:2024:i:1:p:282-294. 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: http://www.elsevier.com/locate/eor .

    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.