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

Novel approach to energy-efficient flexible job-shop scheduling problems

Author

Listed:
  • Rakovitis, Nikolaos
  • Li, Dan
  • Zhang, Nan
  • Li, Jie
  • Zhang, Liping
  • Xiao, Xin

Abstract

In this work, we develop a novel mathematical formulation for the energy-efficient flexible job-shop scheduling problem using the improved unit-specific event-based time representation. The flexible job-shop is represented using the state-task network. It is shown that the proposed model is superior to the existing models with the same or better solutions by up to 13.5 % energy savings in less computational time. Furthermore, it can generate feasible solutions for large-scale instances that the existing models fail to solve. To efficiently solve large-scale problems, a grouping-based decomposition approach is proposed to divide the entire problem into smaller subproblems. It is demonstrated that the proposed decomposition approach can generate good feasible solutions with reduced energy consumption for large-scale examples in significantly less computational time (within 10 min). It can achieve up to 43.1 % less energy consumption in comparison to the existing gene-expression programming-based algorithm.

Suggested Citation

  • Rakovitis, Nikolaos & Li, Dan & Zhang, Nan & Li, Jie & Zhang, Liping & Xiao, Xin, 2022. "Novel approach to energy-efficient flexible job-shop scheduling problems," Energy, Elsevier, vol. 238(PB).
    • Handle: RePEc:eee:energy:v:238:y:2022:i:pb:s0360544221020211
    DOI: 10.1016/j.energy.2021.121773
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0360544221020211
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.energy.2021.121773?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. Hua Zhang & Ziwei Dai & Wenyu Zhang & Shuai Zhang & Yan Wang & Rongyu Liu, 2017. "A New Energy-Aware Flexible Job Shop Scheduling Method Using Modified Biogeography-Based Optimization," Mathematical Problems in Engineering, Hindawi, vol. 2017, pages 1-12, August.
    2. Harvey M. Wagner, 1959. "An integer linear‐programming model for machine scheduling," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 6(2), pages 131-140, June.
    3. Edward H. Bowman, 1959. "The Schedule-Sequencing Problem," Operations Research, INFORMS, vol. 7(5), pages 621-624, October.
    4. Zhang, Liping & Tang, Qiuhua & Wu, Zhengjia & Wang, Fang, 2017. "Mathematical modeling and evolutionary generation of rule sets for energy-efficient flexible job shops," Energy, Elsevier, vol. 138(C), pages 210-227.
    5. Deming Lei & Youlian Zheng & Xiuping Guo, 2017. "A shuffled frog-leaping algorithm for flexible job shop scheduling with the consideration of energy consumption," International Journal of Production Research, Taylor & Francis Journals, vol. 55(11), pages 3126-3140, June.
    6. Paulli, Jan, 1995. "A hierarchical approach for the FMS scheduling problem," European Journal of Operational Research, Elsevier, vol. 86(1), pages 32-42, October.
    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. João M. R. C. Fernandes & Seyed Mahdi Homayouni & Dalila B. M. M. Fontes, 2022. "Energy-Efficient Scheduling in Job Shop Manufacturing Systems: A Literature Review," Sustainability, MDPI, vol. 14(10), pages 1-34, May.
    2. Müller, David & Müller, Marcus G. & Kress, Dominik & Pesch, Erwin, 2022. "An algorithm selection approach for the flexible job shop scheduling problem: Choosing constraint programming solvers through machine learning," European Journal of Operational Research, Elsevier, vol. 302(3), pages 874-891.
    3. M. Hajibabaei & J. Behnamian, 2023. "Fuzzy cleaner production in assembly flexible job-shop scheduling with machine breakdown and batch transportation: Lagrangian relaxation," Journal of Combinatorial Optimization, Springer, vol. 45(5), pages 1-26, July.
    4. Ying Tian & Zhanxu Gao & Lei Zhang & Yujing Chen & Taiyong Wang, 2023. "A Multi-Objective Optimization Method for Flexible Job Shop Scheduling Considering Cutting-Tool Degradation with Energy-Saving Measures," Mathematics, MDPI, vol. 11(2), pages 1-31, January.

    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. João M. R. C. Fernandes & Seyed Mahdi Homayouni & Dalila B. M. M. Fontes, 2022. "Energy-Efficient Scheduling in Job Shop Manufacturing Systems: A Literature Review," Sustainability, MDPI, vol. 14(10), pages 1-34, May.
    2. Golpîra, Hêriş, 2020. "Smart Energy-Aware Manufacturing Plant Scheduling under Uncertainty: A Risk-Based Multi-Objective Robust Optimization Approach," Energy, Elsevier, vol. 209(C).
    3. Shen, Liji & Dauzère-Pérès, Stéphane & Maecker, Söhnke, 2023. "Energy cost efficient scheduling in flexible job-shop manufacturing systems," European Journal of Operational Research, Elsevier, vol. 310(3), pages 992-1016.
    4. Da Col, Giacomo & Teppan, Erich C., 2022. "Industrial-size job shop scheduling with constraint programming," Operations Research Perspectives, Elsevier, vol. 9(C).
    5. Park, Myoung-Ju & Ham, Andy, 2022. "Energy-aware flexible job shop scheduling under time-of-use pricing," International Journal of Production Economics, Elsevier, vol. 248(C).
    6. 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.
    7. Kolisch, Rainer, 1994. "Serial and parallel resource-constrained projekt scheduling methodes revisited: Theory and computation," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 344, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    8. Jain, A. S. & Meeran, S., 1999. "Deterministic job-shop scheduling: Past, present and future," European Journal of Operational Research, Elsevier, vol. 113(2), pages 390-434, March.
    9. Nicolás Álvarez-Gil & Rafael Rosillo & David de la Fuente & Raúl Pino, 2021. "A discrete firefly algorithm for solving the flexible job-shop scheduling problem in a make-to-order manufacturing system," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 29(4), pages 1353-1374, December.
    10. Shehadeh, Karmel S. & Cohn, Amy E.M. & Epelman, Marina A., 2019. "Analysis of models for the Stochastic Outpatient Procedure Scheduling Problem," European Journal of Operational Research, Elsevier, vol. 279(3), pages 721-731.
    11. Sun, Yige & Chung, Sai-Ho & Wen, Xin & Ma, Hoi-Lam, 2021. "Novel robotic job-shop scheduling models with deadlock and robot movement considerations," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 149(C).
    12. Kolisch, Rainer, 1994. "Efficient priority rules for the resource-constrained project scheduling problem," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 350, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    13. Bahman Naderi & Rubén Ruiz & Vahid Roshanaei, 2023. "Mixed-Integer Programming vs. Constraint Programming for Shop Scheduling Problems: New Results and Outlook," INFORMS Journal on Computing, INFORMS, vol. 35(4), pages 817-843, July.
    14. Tamssaouet, Karim & Dauzère-Pérès, Stéphane, 2023. "A general efficient neighborhood structure framework for the job-shop and flexible job-shop scheduling problems," European Journal of Operational Research, Elsevier, vol. 311(2), pages 455-471.
    15. Philippe Baptiste & Ruslan Sadykov, 2009. "On scheduling a single machine to minimize a piecewise linear objective function: A compact MIP formulation," Naval Research Logistics (NRL), John Wiley & Sons, vol. 56(6), pages 487-502, September.
    16. Vilcot, Geoffrey & Billaut, Jean-Charles, 2008. "A tabu search and a genetic algorithm for solving a bicriteria general job shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 190(2), pages 398-411, October.
    17. Hosseini, Amir & Otto, Alena & Pesch, Erwin, 2024. "Scheduling in manufacturing with transportation: Classification and solution techniques," European Journal of Operational Research, Elsevier, vol. 315(3), pages 821-843.
    18. Alvarez-Meaza, Izaskun & Zarrabeitia-Bilbao, Enara & Rio-Belver, Rosa-María & Garechana-Anacabe, Gaizka, 2021. "Green scheduling to achieve green manufacturing: Pursuing a research agenda by mapping science," Technology in Society, Elsevier, vol. 67(C).
    19. Kolisch, Rainer, 1996. "Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation," European Journal of Operational Research, Elsevier, vol. 90(2), pages 320-333, April.
    20. Kolisch, Rainer & Sprecher, Arno & Drexl, Andreas, 1992. "Characterization and generation of a general class of resource-constrained project scheduling problems: Easy and hard instances," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 301, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.

    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:energy:v:238:y:2022:i:pb:s0360544221020211. 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.journals.elsevier.com/energy .

    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.