IDEAS home Printed from https://ideas.repec.org/a/spr/joheur/v29y2023i2d10.1007_s10732-023-09511-0.html
   My bibliography  Save this article

A two-phase hybrid evolutionary algorithm for solving the bi-objective scheduling multiprocessor tasks on two dedicated processors

Author

Listed:
  • Fatma-Zohra Baatout

    (USTHB)

  • Mhand Hifi

    (USTHB
    UPJV)

Abstract

In this paper, we solve the bi-objective scheduling problem on two dedicated processors, an NP-Hard combinatorial optimization problem with a hybrid scatter search-based method. The goal of the problem is to schedule all tasks on their related processors such that the makespan and the total tardiness are minimized. The proposed method starts with an initial reference set, namely Pareto front set, provided by applying an adaptation of the knapsack type procedure. It then solves the problem by making a cooperation between two stages: (i) the first stage focuses on improving the reference set by optimizing the objective related to makespan and, (ii) the second stage tries to highlight the final reference set by favoring the optimization of the total tardiness. Further, at each stage, the $$\varepsilon $$ ε -constraint strategy is employed as a learning strategy, where its aim is to enlarge the search process around reference solutions for covering some unvisited subspaces and so, to avoid a premature convergence. In order to link both stages of the method, the path-relinking is injected whenever a new/modified reference set is reached. Finally, the performance of the designed algorithm is evaluated on instances extracted from the literature. Its results are compared to the results obtained by more recent methods of the literature. Encouraging results have been obtained.

Suggested Citation

  • Fatma-Zohra Baatout & Mhand Hifi, 2023. "A two-phase hybrid evolutionary algorithm for solving the bi-objective scheduling multiprocessor tasks on two dedicated processors," Journal of Heuristics, Springer, vol. 29(2), pages 229-267, June.
    • Handle: RePEc:spr:joheur:v:29:y:2023:i:2:d:10.1007_s10732-023-09511-0
    DOI: 10.1007/s10732-023-09511-0
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10732-023-09511-0
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10732-023-09511-0?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. M Hifi & M Michrafy, 2006. "A reactive local search-based algorithm for the disjunctively constrained knapsack problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(6), pages 718-726, June.
    2. Manuel Laguna & Rafael Marti, 1999. "GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization," INFORMS Journal on Computing, INFORMS, vol. 11(1), pages 44-52, February.
    3. Drozdowski, Maciej, 1996. "Scheduling multiprocessor tasks -- An overview," European Journal of Operational Research, Elsevier, vol. 94(2), pages 215-230, October.
    4. Adel Kacem & Abdelaziz Dammak, 2019. "Bi-objective scheduling on two dedicated processors," European Journal of Industrial Engineering, Inderscience Enterprises Ltd, vol. 13(5), pages 681-700.
    5. Adel Manaa & Chengbin Chu, 2010. "Scheduling multiprocessor tasks to minimise the makespan on two dedicated processors," European Journal of Industrial Engineering, Inderscience Enterprises Ltd, vol. 4(3), pages 265-279.
    6. L. Bianco & J. Blazewicz & P. Dell'Olmo & M. Drozdowski, 1997. "Preemptive multiprocessor task scheduling with release times and time windows," Annals of Operations Research, Springer, vol. 70(0), pages 43-55, April.
    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. Méziane Aïder & Sabrin Boulebene & Mhand Hifi, 2025. "An adaptative multi-objective scatter search for solving the dynamic bin packing problem," Journal of Heuristics, Springer, vol. 31(1), pages 1-69, March.

    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. Adel Kacem & Abdelaziz Dammak, 2021. "Multi-objective scheduling on two dedicated processors," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 29(3), pages 694-721, October.
    2. Thekra Al-douri & Mhand Hifi & Vassilis Zissimopoulos, 2021. "An iterative algorithm for the Max-Min knapsack problem with multiple scenarios," Operational Research, Springer, vol. 21(2), pages 1355-1392, June.
    3. Bierwirth, C. & Kuhpfahl, J., 2017. "Extended GRASP for the job shop scheduling problem with total weighted tardiness objective," European Journal of Operational Research, Elsevier, vol. 261(3), pages 835-848.
    4. Kyriakakis, Nikolaos A. & Marinaki, Magdalene & Matsatsinis, Nikolaos & Marinakis, Yannis, 2022. "A cumulative unmanned aerial vehicle routing problem approach for humanitarian coverage path planning," European Journal of Operational Research, Elsevier, vol. 300(3), pages 992-1004.
    5. Ramón Alvarez-Valdes & Rafael Martí & Jose M. Tamarit & Antonio Parajón, 2007. "GRASP and Path Relinking for the Two-Dimensional Two-Stage Cutting-Stock Problem," INFORMS Journal on Computing, INFORMS, vol. 19(2), pages 261-272, May.
    6. Andrea Bettinelli & Valentina Cacchiani & Enrico Malaguti, 2017. "A Branch-and-Bound Algorithm for the Knapsack Problem with Conflict Graph," INFORMS Journal on Computing, INFORMS, vol. 29(3), pages 457-473, August.
    7. Rafael Martí & Abraham Duarte & Manuel Laguna, 2009. "Advanced Scatter Search for the Max-Cut Problem," INFORMS Journal on Computing, INFORMS, vol. 21(1), pages 26-38, February.
    8. Napoletano, Antonio & Martínez-Gavara, Anna & Festa, Paola & Pastore, Tommaso & Martí, Rafael, 2019. "Heuristics for the Constrained Incremental Graph Drawing Problem," European Journal of Operational Research, Elsevier, vol. 274(2), pages 710-729.
    9. Mauricio Resende & Renato Werneck, 2007. "A fast swap-based local search procedure for location problems," Annals of Operations Research, Springer, vol. 150(1), pages 205-230, March.
    10. Wu, Lingxiao & Wang, Shuaian, 2018. "Exact and heuristic methods to solve the parallel machine scheduling problem with multi-processor tasks," International Journal of Production Economics, Elsevier, vol. 201(C), pages 26-40.
    11. Ferreira, Cristiane & Figueira, Gonçalo & Amorim, Pedro, 2021. "Scheduling Human-Robot Teams in collaborative working cells," International Journal of Production Economics, Elsevier, vol. 235(C).
    12. Matheus M. Vieira & Bruno Nogueira & Rian G. S. Pinheiro, 2024. "An integrated ILS-VND strategy for solving the knapsack problem with forfeits," Journal of Heuristics, Springer, vol. 30(5), pages 399-420, December.
    13. Antonio R. Uguina & Juan F. Gomez & Javier Panadero & Anna Martínez-Gavara & Angel A. Juan, 2024. "A Learnheuristic Algorithm Based on Thompson Sampling for the Heterogeneous and Dynamic Team Orienteering Problem," Mathematics, MDPI, vol. 12(11), pages 1-19, June.
    14. Keqin Li, 1999. "Analysis of the List Scheduling Algorithm for Precedence Constrained Parallel Tasks," Journal of Combinatorial Optimization, Springer, vol. 3(1), pages 73-88, July.
    15. Fred Glover & Vicente Campos & Rafael Martí, 2021. "Rejoinder on: Tabu search tutorial. A Graph Drawing Application," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 29(2), pages 363-371, July.
    16. Markus Frey & Ferdinand Kiermaier & Rainer Kolisch, 2017. "Optimizing Inbound Baggage Handling at Airports," Transportation Science, INFORMS, vol. 51(4), pages 1210-1225, November.
    17. Xiaoqiang Cai & Chung‐Yee Lee & Chung‐Lun Li, 1998. "Minimizing total completion time in two‐processor task systems with prespecified processor allocations," Naval Research Logistics (NRL), John Wiley & Sons, vol. 45(2), pages 231-242, March.
    18. Jianer Chen & Chung‐Yee Lee, 1999. "General multiprocessor task scheduling," Naval Research Logistics (NRL), John Wiley & Sons, vol. 46(1), pages 57-74, February.
    19. Oguz, C. & Fikret Ercan, M. & Edwin Cheng, T. C. & Fung, Y. F., 2003. "Heuristic algorithms for multiprocessor task scheduling in a two-stage hybrid flow-shop," European Journal of Operational Research, Elsevier, vol. 149(2), pages 390-403, September.
    20. Palubeckis, Gintaras & Tomkevičius, Arūnas & Ostreika, Armantas, 2019. "Hybridizing simulated annealing with variable neighborhood search for bipartite graph crossing minimization," Applied Mathematics and Computation, Elsevier, vol. 348(C), pages 84-101.

    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:spr:joheur:v:29:y:2023:i:2:d:10.1007_s10732-023-09511-0. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.