IDEAS home Printed from https://ideas.repec.org/a/eee/proeco/v143y2013i1p13-23.html
   My bibliography  Save this article

The energy scheduling problem: Industrial case-study and constraint propagation techniques

Author

Listed:
  • Artigues, Christian
  • Lopez, Pierre
  • Haït, Alain

Abstract

This paper deals with production scheduling involving energy constraints, typically electrical energy. We start by an industrial case-study for which we propose a two-step integer/constraint programming method. From the industrial problem we derive a generic problem, the Energy Scheduling Problem (EnSP). We propose an extension of specific resource constraint propagation techniques to efficiently prune the search space for EnSP solving. We also present a branching scheme to solve the problem via tree search. Finally, computational results are provided.

Suggested Citation

  • Artigues, Christian & Lopez, Pierre & Haït, Alain, 2013. "The energy scheduling problem: Industrial case-study and constraint propagation techniques," International Journal of Production Economics, Elsevier, vol. 143(1), pages 13-23.
    • Handle: RePEc:eee:proeco:v:143:y:2013:i:1:p:13-23
    DOI: 10.1016/j.ijpe.2010.09.030
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0925527310003683
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ijpe.2010.09.030?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. SubaI, Corinne & Baptiste, Pierre & Niel, Eric, 2006. "Scheduling issues for environmentally responsible manufacturing: The case of hoist scheduling in an electroplating line," International Journal of Production Economics, Elsevier, vol. 99(1-2), pages 74-87, February.
    2. Cheng, T. C. E. & Sin, C. C. S., 1990. "A state-of-the-art review of parallel-machine scheduling research," European Journal of Operational Research, Elsevier, vol. 47(3), pages 271-292, August.
    3. SADYKOV, Ruslan & WOLSEY, Laurence A., 2006. "Integer programming and constraint programming in solving a multimachine assignment scheduling problem with deadlines and release dates," LIDAM Reprints CORE 1854, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    4. Poder, Emmanuel & Beldiceanu, Nicolas & Sanlaville, Eric, 2004. "Computing a lower approximation of the compulsory part of a task with varying duration and varying resource consumption," European Journal of Operational Research, Elsevier, vol. 153(1), pages 239-254, February.
    5. Ruslan Sadykov & Laurence A. Wolsey, 2006. "Integer Programming and Constraint Programming in Solving a Multimachine Assignment Scheduling Problem with Deadlines and Release Dates," INFORMS Journal on Computing, INFORMS, vol. 18(2), pages 209-217, May.
    6. Jacek Błażewicz & Maciej Machowiak & Jan Węglarz & Mikhail Kovalyov & Denis Trystram, 2004. "Scheduling Malleable Tasks on Parallel Processors to Minimize the Makespan," Annals of Operations Research, Springer, vol. 129(1), pages 65-80, July.
    7. Zhi-Long Chen & Warren B. Powell, 1999. "Solving Parallel Machine Scheduling Problems by Column Generation," INFORMS Journal on Computing, INFORMS, vol. 11(1), pages 78-94, February.
    8. Ranjbar, Mohammad & De Reyck, Bert & Kianfar, Fereydoon, 2009. "A hybrid scatter search for the discrete time/resource trade-off problem in project scheduling," European Journal of Operational Research, Elsevier, vol. 193(1), pages 35-48, February.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Sven Schulz & Udo Buscher & Liji Shen, 2020. "Multi-objective hybrid flow shop scheduling with variable discrete production speed levels and time-of-use energy prices," Journal of Business Economics, Springer, vol. 90(9), pages 1315-1343, November.
    2. Zanoni, Simone & Bettoni, Laura & Glock, Christoph H., 2014. "Energy implications in a two-stage production system with controllable production rates," International Journal of Production Economics, Elsevier, vol. 149(C), pages 164-171.
    3. Gahm, Christian & Denz, Florian & Dirr, Martin & Tuma, Axel, 2016. "Energy-efficient scheduling in manufacturing companies: A review and research framework," European Journal of Operational Research, Elsevier, vol. 248(3), pages 744-757.
    4. 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.
    5. Otashu, Joannah I. & Baldea, Michael, 2018. "Grid-level “battery” operation of chemical processes and demand-side participation in short-term electricity markets," Applied Energy, Elsevier, vol. 220(C), pages 562-575.
    6. Aghelinejad, MohammadMohsen & Ouazene, Yassine & Yalaoui, Alice, 2019. "Complexity analysis of energy-efficient single machine scheduling problems," Operations Research Perspectives, Elsevier, vol. 6(C).
    7. Margaux Nattaf & Christian Artigues & Pierre Lopez & David Rivreau, 2016. "Energetic reasoning and mixed-integer linear programming for scheduling with a continuous resource and linear efficiency functions," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 38(2), pages 459-492, March.
    8. Lee, Cheng-Hsiung & Liao, Ching-Jong & Chung, Tsui-Ping, 2014. "Scheduling with multi-attribute setup times on two identical parallel machines," International Journal of Production Economics, Elsevier, vol. 153(C), pages 130-138.
    9. Xiangxin An & Guojin Si & Tangbin Xia & Qinming Liu & Yaping Li & Rui Miao, 2022. "Operation and Maintenance Optimization for Manufacturing Systems with Energy Management," Energies, MDPI, vol. 15(19), pages 1-19, October.
    10. Rapine, Christophe & Goisque, Guillaume & Akbalik, Ayse, 2018. "Energy-aware lot sizing problem: Complexity analysis and exact algorithms," International Journal of Production Economics, Elsevier, vol. 203(C), pages 254-263.
    11. Masmoudi, Oussama & Delorme, Xavier & Gianessi, Paolo, 2019. "Job-shop scheduling problem with energy consideration," International Journal of Production Economics, Elsevier, vol. 216(C), pages 12-22.
    12. Hajo Terbrack & Thorsten Claus & Frank Herrmann, 2021. "Energy-Oriented Production Planning in Industry: A Systematic Literature Review and Classification Scheme," Sustainability, MDPI, vol. 13(23), pages 1-32, December.
    13. Roland Braune, 2022. "Packing-based branch-and-bound for discrete malleable task scheduling," Journal of Scheduling, Springer, vol. 25(6), pages 675-704, December.
    14. Beck, Fabian G. & Biel, Konstantin & Glock, Christoph H., 2019. "Integration of energy aspects into the economic lot scheduling problem," International Journal of Production Economics, Elsevier, vol. 209(C), pages 399-410.
    15. Rapine, Christophe & Penz, Bernard & Gicquel, Céline & Akbalik, Ayse, 2018. "Capacity acquisition for the single-item lot sizing problem under energy constraints," Omega, Elsevier, vol. 81(C), pages 112-122.
    16. Stefan Bugow & Carolin Kellenbrink, 2023. "The parcel hub scheduling problem with limited conveyor capacity and controllable unloading speeds," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 45(2), pages 325-357, June.
    17. Ramin, D. & Spinelli, S. & Brusaferri, A., 2018. "Demand-side management via optimal production scheduling in power-intensive industries: The case of metal casting process," Applied Energy, Elsevier, vol. 225(C), pages 622-636.

    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. Lotte Berghman & Roel Leus & Frits Spieksma, 2014. "Optimal solutions for a dock assignment problem with trailer transportation," Annals of Operations Research, Springer, vol. 213(1), pages 3-25, February.
    2. Luca Benini & Michele Lombardi & Michela Milano & Martino Ruggiero, 2011. "Optimal resource allocation and scheduling for the CELL BE platform," Annals of Operations Research, Springer, vol. 184(1), pages 51-77, April.
    3. Berghman, Lotte & Leus, Roel, 2015. "Practical solutions for a dock assignment problem with trailer transportation," European Journal of Operational Research, Elsevier, vol. 246(3), pages 787-799.
    4. Roshanaei, Vahid & Luong, Curtiss & Aleman, Dionne M. & Urbach, David, 2017. "Propagating logic-based Benders’ decomposition approaches for distributed operating room scheduling," European Journal of Operational Research, Elsevier, vol. 257(2), pages 439-455.
    5. Daniel Reich & Yuhui Shi & Marina Epelman & Amy Cohn & Ellen Barnes & Kirk Arthurs & Erica Klampfl, 2016. "Scheduling Crash Tests at Ford Motor Company," Interfaces, INFORMS, vol. 46(5), pages 409-423, October.
    6. Elvin Coban & J. Hooker, 2013. "Single-facility scheduling by logic-based Benders decomposition," Annals of Operations Research, Springer, vol. 210(1), pages 245-272, November.
    7. Gedik, Ridvan & Rainwater, Chase & Nachtmann, Heather & Pohl, Ed A., 2016. "Analysis of a parallel machine scheduling problem with sequence dependent setup times and job availability intervals," European Journal of Operational Research, Elsevier, vol. 251(2), pages 640-650.
    8. Stefano Gualandi & Federico Malucelli, 2013. "Constraint Programming-based Column Generation," Annals of Operations Research, Springer, vol. 204(1), pages 11-32, April.
    9. Wang, Haibo & Alidaee, Bahram, 2019. "Effective heuristic for large-scale unrelated parallel machines scheduling problems," Omega, Elsevier, vol. 83(C), pages 261-274.
    10. F. Rodriguez & C. Blum & C. García-Martínez & M. Lozano, 2012. "GRASP with path-relinking for the non-identical parallel machine scheduling problem with minimising total weighted completion times," Annals of Operations Research, Springer, vol. 201(1), pages 383-401, December.
    11. Yanıkoğlu, İhsan & Yavuz, Tonguc, 2022. "Branch-and-price approach for robust parallel machine scheduling with sequence-dependent setup times," European Journal of Operational Research, Elsevier, vol. 301(3), pages 875-895.
    12. Detienne, Boris, 2014. "A mixed integer linear programming approach to minimize the number of late jobs with and without machine availability constraints," European Journal of Operational Research, Elsevier, vol. 235(3), pages 540-552.
    13. Raf Jans, 2009. "Solving Lot-Sizing Problems on Parallel Identical Machines Using Symmetry-Breaking Constraints," INFORMS Journal on Computing, INFORMS, vol. 21(1), pages 123-136, February.
    14. Stefano Gualandi & Federico Malucelli, 2012. "Exact Solution of Graph Coloring Problems via Constraint Programming and Column Generation," INFORMS Journal on Computing, INFORMS, vol. 24(1), pages 81-100, February.
    15. Kerem Bülbül & Halil Şen, 2017. "An exact extended formulation for the unrelated parallel machine total weighted completion time problem," Journal of Scheduling, Springer, vol. 20(4), pages 373-389, August.
    16. Sadykov, Ruslan, 2008. "A branch-and-check algorithm for minimizing the weighted number of late jobs on a single machine with release dates," European Journal of Operational Research, Elsevier, vol. 189(3), pages 1284-1304, September.
    17. Yantong Li & Jean-François Côté & Leandro Callegari-Coelho & Peng Wu, 2022. "Novel Formulations and Logic-Based Benders Decomposition for the Integrated Parallel Machine Scheduling and Location Problem," INFORMS Journal on Computing, INFORMS, vol. 34(2), pages 1048-1069, March.
    18. Halil Şen & Kerem Bülbül, 2015. "A Strong Preemptive Relaxation for Weighted Tardiness and Earliness/Tardiness Problems on Unrelated Parallel Machines," INFORMS Journal on Computing, INFORMS, vol. 27(1), pages 135-150, February.
    19. Wendi Tian & Erik Demeulemeester, 2014. "Railway scheduling reduces the expected project makespan over roadrunner scheduling in a multi-mode project scheduling environment," Annals of Operations Research, Springer, vol. 213(1), pages 271-291, February.
    20. Yalaoui, F. & Chu, C., 2006. "New exact method to solve the Pm/rj/[summation operator]Cj schedule problem," International Journal of Production Economics, Elsevier, vol. 100(1), pages 168-179, March.

    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:proeco:v:143:y:2013:i:1:p:13-23. 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/ijpe .

    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.