IDEAS home Printed from https://ideas.repec.org/a/ids/ijores/v3y2008i6p643-664.html
   My bibliography  Save this article

Lower bounds for parallel machine scheduling problems

Author

Listed:
  • Philippe Baptiste
  • Antoine Jouglet
  • David Savourey

Abstract

We study the parallel machine scheduling problem with release dates and consider several 'min-sum' objective functions including total weighted tardiness, total tardiness, total weighted completion time and total completion time. We describe several lower bounds for these problems, most of them being original ones. We provide experimental results to compare these lower bounds according to their quality and of their computational time requirement.

Suggested Citation

  • Philippe Baptiste & Antoine Jouglet & David Savourey, 2008. "Lower bounds for parallel machine scheduling problems," International Journal of Operational Research, Inderscience Enterprises Ltd, vol. 3(6), pages 643-664.
    • Handle: RePEc:ids:ijores:v:3:y:2008:i:6:p:643-664
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=19731
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

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


    Cited by:

    1. Arthur Kramer & Anand Subramanian, 2019. "A unified heuristic and an annotated bibliography for a large class of earliness–tardiness scheduling problems," Journal of Scheduling, Springer, vol. 22(1), pages 21-57, February.
    2. Alves de Queiroz, Thiago & Iori, Manuel & Kramer, Arthur & Kuo, Yong-Hong, 2023. "Dynamic scheduling of patients in emergency departments," European Journal of Operational Research, Elsevier, vol. 310(1), pages 100-116.

    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:ids:ijores:v:3:y:2008:i:6:p:643-664. 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: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=170 .

    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.