IDEAS home Printed from https://ideas.repec.org/a/taf/tprsxx/v58y2020i21p6532-6552.html
   My bibliography  Save this article

A fix-and-relax heuristic for the single-item lot-sizing problem with a flow-shop system and energy constraints

Author

Listed:
  • Melek Rodoplu
  • Taha Arbaoui
  • Alice Yalaoui

Abstract

This study addresses a new single-item lot-sizing problem for flow-shop configurations by integrating the capacity contract selection problem with multiple energy sources. To the best of our knowledge, this problem has never been tackled before. We introduce a mathematical model which defines optimum production plan and energy contract option regarding the objectives and constraints of the production system and energy supplier contract conditions. Since the problem is NP-Hard, a Fix-and-Relax heuristic is introduced to solve the problem. Two different relaxation procedures are applied and the performance of the solution approach is tested on randomly generated instances. It is seen that the obtained results are quite promising. The applied heuristic approach produces solutions with the optimality gap $0.2\% $0.2% in average for the small problem sizes such as (N5_T5,N5_T7). For the larger instances, it allows to reach better results than the results obtained by commercial solvers within a shorter time.

Suggested Citation

  • Melek Rodoplu & Taha Arbaoui & Alice Yalaoui, 2020. "A fix-and-relax heuristic for the single-item lot-sizing problem with a flow-shop system and energy constraints," International Journal of Production Research, Taylor & Francis Journals, vol. 58(21), pages 6532-6552, November.
  • Handle: RePEc:taf:tprsxx:v:58:y:2020:i:21:p:6532-6552
    DOI: 10.1080/00207543.2019.1683249
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2019.1683249
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/00207543.2019.1683249?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.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Rohaninejad, Mohammad & Hanzálek, Zdeněk, 2023. "Multi-level lot-sizing and job shop scheduling with lot-streaming: Reformulation and solution approaches," International Journal of Production Economics, Elsevier, vol. 263(C).
    2. Chargui, Kaoutar & Zouadi, Tarik & Sreedharan, V. Raja & El Fallahi, Abdellah & Reghioui, Mohamed, 2023. "A novel robust exact decomposition algorithm for berth and quay crane allocation and scheduling problem considering uncertainty and energy efficiency," Omega, Elsevier, vol. 118(C).

    More about this item

    Statistics

    Access and download statistics

    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:taf:tprsxx:v:58:y:2020:i:21:p:6532-6552. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/TPRS20 .

    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.