IDEAS home Printed from https://ideas.repec.org/a/gam/jsusta/v13y2021i16p9277-d616793.html
   My bibliography  Save this article

Green Scheduling of Identical Parallel Machines with Release Date, Delivery Time and No-Idle Machine Constraints

Author

Listed:
  • Lotfi Hidri

    (Industrial Engineering Department, College of Engineering, King Saud University, P.O. Box 800, Riyadh 11421, Saudi Arabia)

  • Ali Alqahtani

    (Industrial Engineering Department, College of Engineering, King Saud University, P.O. Box 800, Riyadh 11421, Saudi Arabia)

  • Achraf Gazdar

    (Software Engineering Department, College of Computer and Information Sciences, King Saud University, P.O. Box 51178, Riyadh 11543, Saudi Arabia)

  • Belgacem Ben Youssef

    (Computer Engineering Department, College of Computer and Information Sciences, King Saud University, P.O. Box 51178, Riyadh 11543, Saudi Arabia)

Abstract

Global warming and climate change are threatening life on earth. These changes are due to human activities resulting in the emission of greenhouse gases. This is caused by intensive industrial activities and excessive fuel energy consumption. Recently, the scheduling of production systems has been judged to be an effective way to reduce energy consumption. This is the field of green scheduling, which aims to allocate jobs to machines in order to minimize total costs, with a focus on the sustainable use of energy. Several studies have investigated parallel-machine shops, with a special focus on reducing and minimizing the total consumed energy. Few studies explicitly include the idle energy of parallel machines, which is the energy consumed when the machines are idle. In addition, very few studies have considered the elimination of idle machine times as an efficient way to reduce the total consumed energy. This is the no-idle machine constraint, which is the green aspect of the research. In this context, this paper addresses the green parallel-machine scheduling problem, including release dates, delivery times, and no-idle machines, with the objective of minimizing the maximum completion time. This problem is of practical interest since it is encountered in several industry processes, such as the steel and automobile industries. A mixed-integer linear programming (MILP) model is proposed for use in obtaining exact solutions for small-sized instances. Due to the NP-hardness of the studied problem, and encouraged by the successful adaptation of metaheuristics for green scheduling problems, three genetic algorithms (GAs) using three different crossover operators and a simulated annealing algorithm (SA) were developed for large-sized problems. A new family of lower bounds is proposed. This was intended for the evaluation of the performance of the proposed algorithms over the average percent of relative deviation (ARPD). In addition, the green aspect was evaluated over the percentage of saved energy, while eliminating the idle-machine times. An extensive experimental study was carried out on a benchmark of test problems with up to 200 jobs and eight machines. This experimental study showed that one GA variant dominated the other proposed procedures. Furthermore, the obtained numerical results provide strong evidence that the proposed GA variant outperformed the existing procedures from the literature. The experimental study also showed that the adoption of the no-idle machine time constraints made it possible to reduce the total consumed energy by 29.57%, while the makespan (cost) increased by only 0.12%.

Suggested Citation

  • Lotfi Hidri & Ali Alqahtani & Achraf Gazdar & Belgacem Ben Youssef, 2021. "Green Scheduling of Identical Parallel Machines with Release Date, Delivery Time and No-Idle Machine Constraints," Sustainability, MDPI, vol. 13(16), pages 1-30, August.
    • Handle: RePEc:gam:jsusta:v:13:y:2021:i:16:p:9277-:d:616793
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2071-1050/13/16/9277/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2071-1050/13/16/9277/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Federico Della Croce & Andrea Grosso & Fabio Salassa, 2021. "Minimizing total completion time in the two-machine no-idle no-wait flow shop problem," Journal of Heuristics, Springer, vol. 27(1), pages 159-173, April.
    2. Anghinolfi, Davide & Paolucci, Massimo & Ronco, Roberto, 2021. "A bi-objective heuristic approach for green identical parallel machine scheduling," European Journal of Operational Research, Elsevier, vol. 289(2), pages 416-434.
    3. Ilkyeong Moon & Yoon Jea Jeong & Subrata Saha, 2016. "Fuzzy Bi-Objective Production-Distribution Planning Problem under the Carbon Emission Constraint," Sustainability, MDPI, vol. 8(8), pages 1-17, August.
    4. 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.
    5. Jeong, Yoonjea & Saha, Subrata & Chatterjee, Debajyoti & Moon, Ilkyeong, 2018. "Direct shipping service routes with an empty container management strategy," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 118(C), pages 123-142.
    6. Zhou, Shengchao & Xie, Jianhui & Du, Ni & Pang, Yan, 2018. "A random-keys genetic algorithm for scheduling unrelated parallel batch processing machines with different capacities and arbitrary job sizes," Applied Mathematics and Computation, Elsevier, vol. 334(C), pages 254-268.
    7. Peng Liang & Hai-dong Yang & Guo-sheng Liu & Jian-hua Guo, 2015. "An Ant Optimization Model for Unrelated Parallel Machine Scheduling with Energy Consumption and Total Tardiness," Mathematical Problems in Engineering, Hindawi, vol. 2015, pages 1-8, August.
    8. Wu, Xueqi & Che, Ada, 2019. "A memetic differential evolution algorithm for energy-efficient parallel machine scheduling," Omega, Elsevier, vol. 82(C), pages 155-165.
    9. Li, Lin & Sun, Zeyi & Yao, Xufeng & Wang, Donghai, 2016. "Optimal production scheduling for energy efficiency improvement in biofuel feedstock preprocessing considering work-in-process particle separation," Energy, Elsevier, vol. 96(C), pages 474-481.
    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. Qingfei Tong & Xinguo Ming & Xianyu Zhang, 2023. "Construction of Sustainable Digital Factory for Automated Warehouse Based on Integration of ERP and WMS," Sustainability, MDPI, vol. 15(2), pages 1-22, January.
    2. Tao Dai & Xiangqi Fan, 2021. "Multi-Stove Scheduling for Sustainable On-Demand Food Delivery," Sustainability, MDPI, vol. 13(23), pages 1-13, November.

    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. Yamashiro, Hirochika & Nonaka, Hirofumi, 2021. "Estimation of processing time using machine learning and real factory data for optimization of parallel machine scheduling problem," Operations Research Perspectives, Elsevier, vol. 8(C).
    2. Catanzaro, Daniele & Pesenti, Raffaele & Ronco, Roberto, 2023. "Job scheduling under Time-of-Use energy tariffs for sustainable manufacturing: a survey," European Journal of Operational Research, Elsevier, vol. 308(3), pages 1091-1109.
    3. Dunstall, Simon & Wirth, Andrew, 2005. "A comparison of branch-and-bound algorithms for a family scheduling problem with identical parallel machines," European Journal of Operational Research, Elsevier, vol. 167(2), pages 283-296, December.
    4. Kramer, Arthur & Dell’Amico, Mauro & Iori, Manuel, 2019. "Enhanced arc-flow formulations to minimize weighted completion time on identical parallel machines," European Journal of Operational Research, Elsevier, vol. 275(1), pages 67-79.
    5. 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.
    6. Li, He & Wang, Pengyu & Fang, Debin, 2024. "Differentiated pricing for the retail electricity provider optimizing demand response to renewable energy fluctuations," Energy Economics, Elsevier, vol. 136(C).
    7. Roberto Cordone & Pierre Hosteins & Giovanni Righini, 2018. "A Branch-and-Bound Algorithm for the Prize-Collecting Single-Machine Scheduling Problem with Deadlines and Total Tardiness Minimization," INFORMS Journal on Computing, INFORMS, vol. 30(1), pages 168-180, February.
    8. Lixin Tang & Gongshu Wang & Zhi-Long Chen, 2014. "Integrated Charge Batching and Casting Width Selection at Baosteel," Operations Research, INFORMS, vol. 62(4), pages 772-787, August.
    9. Xiangtong Qi, 2005. "A logistics scheduling model: Inventory cost reduction by batching," Naval Research Logistics (NRL), John Wiley & Sons, vol. 52(4), pages 312-320, June.
    10. Alaa Abdelshafie & May Salah & Tomaž Kramberger & Dejan Dragan, 2022. "Repositioning and Optimal Re-Allocation of Empty Containers: A Review of Methods, Models, and Applications," Sustainability, MDPI, vol. 14(11), pages 1-23, May.
    11. Jeong, Yoonjea & Kim, Gwang, 2023. "Reliable design of container shipping network with foldable container facility disruption," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 169(C).
    12. Chung‐Yee Lee & Zhi‐Long Chen, 2000. "Scheduling jobs and maintenance activities on parallel machines," Naval Research Logistics (NRL), John Wiley & Sons, vol. 47(2), pages 145-165, March.
    13. Sung, Inkyung & Lee, Taesik, 2016. "Optimal allocation of emergency medical resources in a mass casualty incident: Patient prioritization by column generation," European Journal of Operational Research, Elsevier, vol. 252(2), pages 623-634.
    14. Daniel Kowalczyk & Roel Leus, 2018. "A Branch-and-Price Algorithm for Parallel Machine Scheduling Using ZDDs and Generic Branching," INFORMS Journal on Computing, INFORMS, vol. 30(4), pages 768-782, November.
    15. H. Fei & C. Chu & N. Meskens, 2009. "Solving a tactical operating room planning problem by a column-generation-based heuristic procedure with four criteria," Annals of Operations Research, Springer, vol. 166(1), pages 91-108, February.
    16. Kramer, Arthur & Iori, Manuel & Lacomme, Philippe, 2021. "Mathematical formulations for scheduling jobs on identical parallel machines with family setup times and total weighted completion time minimization," European Journal of Operational Research, Elsevier, vol. 289(3), pages 825-840.
    17. Rabia Nessah & Chengbin Chu, 2010. "Infinite split scheduling: a new lower bound of total weighted completion time on parallel machines with job release dates and unavailability periods," Annals of Operations Research, Springer, vol. 181(1), pages 359-375, December.
    18. Gaggero, Mauro & Paolucci, Massimo & Ronco, Roberto, 2023. "Exact and heuristic solution approaches for energy-efficient identical parallel machine scheduling with time-of-use costs," European Journal of Operational Research, Elsevier, vol. 311(3), pages 845-866.
    19. 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.
    20. Yunting Feng & Yong Geng & Ge Zhao & Mengya Li, 2022. "Carbon Emission Constraint Policy in an OEM and Outsourcing Remanufacturer Supply Chain with Consumer Preferences," IJERPH, MDPI, vol. 19(8), pages 1-16, April.

    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:gam:jsusta:v:13:y:2021:i:16:p:9277-:d:616793. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    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.