IDEAS home Printed from https://ideas.repec.org/p/ies/wpaper/e201008.html
   My bibliography  Save this paper

Branch-and-bound method for minimizing the weighted completion time scheduling problem on a single machine with release dates

Author

Listed:
  • Rabia Nessah

    (IESEG School of Management (LEM-CNRS))

  • Imed Kacem

    (Université Paul Verlaine, Metz)

Abstract

No abstract is available for this item.

Suggested Citation

  • Rabia Nessah & Imed Kacem, 2009. "Branch-and-bound method for minimizing the weighted completion time scheduling problem on a single machine with release dates," Working Papers 2010-ECO-08, IESEG School of Management.
    • Handle: RePEc:ies:wpaper:e201008
    as

    Download full text from publisher

    File URL: http://my.ieseg.fr/bienvenue/DownloadDoc.asp?Fich=54246261_2010-ECO-08_Nessah_Kacem.pdf
    Download Restriction: no
    File URL:
    Download Restriction: no
    ---><---

    Other versions of this item:

    Citations

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


    Cited by:

    1. Chung-Ho Su & Jen-Ya Wang, 2022. "A Branch-and-Bound Algorithm for Minimizing the Total Tardiness of Multiple Developers," Mathematics, MDPI, vol. 10(7), pages 1-24, April.
    2. Natashia Boland & Riley Clement & Hamish Waterer, 2016. "A Bucket Indexed Formulation for Nonpreemptive Single Machine Scheduling Problems," INFORMS Journal on Computing, INFORMS, vol. 28(1), pages 14-30, February.

    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:ies:wpaper:e201008. 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: Lies BOUTEN (email available below). General contact details of provider: https://edirc.repec.org/data/iesegfr.html .

    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.