IDEAS home Printed from https://ideas.repec.org/a/taf/tprsxx/v62y2024i1-2p380-403.html
   My bibliography  Save this article

Robust identical parallel machine scheduling with two-stage time-of-use tariff and not-all-machine option

Author

Listed:
  • Xin Feng
  • Hongjun Peng

Abstract

Time-of-use (TOU) tariff has been implemented in the manufacturing industry to improve energy efficiency by regulating the electricity imbalance between supply and demand. Besides, not-all-machine (NAM) option is another way of energy-saving by using only a subset of all the available machines. This study investigates a robust identical parallel machine scheduling problem with a two-stage TOU tariff and NAM option. Only interval bounds on job processing times are known. The problem is first formulated into a min–max regret model to maximise the robustness. Based on problem properties, both an iterative relaxation-based exact algorithm and a memetic differential evolution-based heuristic are developed to solve the problem. Computational experiments on 240 randomly generated instances with up to 20 jobs are conducted to evaluate the performance of the developed methods. Besides, 900 large-sized randomly generated instances with up to 150 jobs are tested for sensitivity analysis and to identify managerial insights for achieving energy-efficient schedules.

Suggested Citation

  • Xin Feng & Hongjun Peng, 2024. "Robust identical parallel machine scheduling with two-stage time-of-use tariff and not-all-machine option," International Journal of Production Research, Taylor & Francis Journals, vol. 62(1-2), pages 380-403, January.
    • Handle: RePEc:taf:tprsxx:v:62:y:2024:i:1-2:p:380-403
    DOI: 10.1080/00207543.2023.2228922
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2023.2228922
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/00207543.2023.2228922?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.

    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:62:y:2024:i:1-2:p:380-403. 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.