IDEAS home Printed from https://ideas.repec.org/a/eee/oprepe/v16y2026ics2214716026000151.html

Branch-and-bound algorithm to minimize the total completion time on two dedicated processors

Author

Listed:
  • Kacem, Adel
  • Dammak, Abdelaziz

Abstract

In this paper, we propose an exact method for solving the problem of scheduling multiprocessor tasks on two dedicated processors with release dates. In this problem, we have three subsets of tasks, where these tasks need one or two dedicated processors to be performed. The aim is to minimize the total completion time, where each task has a release date. In computational complexity theory, this problem is shown to be NP-hard in the strong sense. The contribution of our work is to construct a mathematical model, to give an improved lower bound and to propose a branch-and-bound algorithm to solve the studied problem.

Suggested Citation

  • Kacem, Adel & Dammak, Abdelaziz, 2026. "Branch-and-bound algorithm to minimize the total completion time on two dedicated processors," Operations Research Perspectives, Elsevier, vol. 16(C).
    • Handle: RePEc:eee:oprepe:v:16:y:2026:i:c:s2214716026000151
    DOI: 10.1016/j.orp.2026.100391
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S2214716026000151
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.orp.2026.100391?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

    for a different version of it.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    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:eee:oprepe:v:16:y:2026:i:c:s2214716026000151. 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: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/operations-research-perspectives .

    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.