IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v129y2004i1p187-20410.1023-banor.0000030688.31785.40.html
   My bibliography  Save this article

Lower Bounds for Scheduling on Identical Parallel Machines with Heads and Tails

Author

Listed:
  • Mohamed Haouari
  • Anis Gharbi

Abstract

In this paper, we investigate new lower bounds for the P|r j ,q j |C max scheduling problem. A new bin packing based lower bound, as well as several new lifting procedures are derived for this strongly NP -hard problem. Extensive numerical experiments show that the proposed lower bounds consistently outperform the best existing ones. Copyright Kluwer Academic Publishers 2004

Suggested Citation

  • Mohamed Haouari & Anis Gharbi, 2004. "Lower Bounds for Scheduling on Identical Parallel Machines with Heads and Tails," Annals of Operations Research, Springer, vol. 129(1), pages 187-204, July.
    • Handle: RePEc:spr:annopr:v:129:y:2004:i:1:p:187-204:10.1023/b:anor.0000030688.31785.40
    DOI: 10.1023/B:ANOR.0000030688.31785.40
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1023/B:ANOR.0000030688.31785.40
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1023/B:ANOR.0000030688.31785.40?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.

    Citations

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


    Cited by:

    1. Mohamed Haouari & Lotfi Hidri & Anis Gharbi, 2006. "Optimal Scheduling of a Two-stage Hybrid Flow Shop," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 64(1), pages 107-124, August.
    2. Li Kai & Li Hui & Cheng Bayi & Luo Qing, 2015. "Uniform Parallel Machine Scheduling Problem with Controllable Delivery Times," Journal of Systems Science and Information, De Gruyter, vol. 3(6), pages 525-537, December.
    3. Peihai Liu & Xiwen Lu, 2015. "Online scheduling on two parallel machines with release dates and delivery times," Journal of Combinatorial Optimization, Springer, vol. 30(2), pages 347-359, August.

    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:annopr:v:129:y:2004:i:1:p:187-204:10.1023/b:anor.0000030688.31785.40. 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: 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.