IDEAS home Printed from https://ideas.repec.org/a/spr/topjnl/v9y2001i2p243-269.html
   My bibliography  Save this article

List scheduling algorithms to minimize the makespan on identical parallel machines

Author

Listed:
  • Ethel Mokotoff
  • José Jimeno
  • Ana Gutiérrez

Abstract

No abstract is available for this item.

Suggested Citation

  • Ethel Mokotoff & José Jimeno & Ana Gutiérrez, 2001. "List scheduling algorithms to minimize the makespan on identical parallel machines," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 9(2), pages 243-269, December.
    • Handle: RePEc:spr:topjnl:v:9:y:2001:i:2:p:243-269
    DOI: 10.1007/BF02579085
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/BF02579085
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/BF02579085?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. Fang, Kan & Wang, Shijin & Pinedo, Michael L. & Chen, Lin & Chu, Feng, 2021. "A combinatorial Benders decomposition algorithm for parallel machine scheduling with working-time restrictions," European Journal of Operational Research, Elsevier, vol. 291(1), pages 128-146.
    2. Dell'Amico, Mauro & Iori, Manuel & Martello, Silvano & Monaci, Michele, 2006. "Lower bounds and heuristic algorithms for the ki-partitioning problem," European Journal of Operational Research, Elsevier, vol. 171(3), pages 725-742, June.
    3. Mauro Dell'Amico & Manuel Iori & Silvano Martello & Michele Monaci, 2008. "Heuristic and Exact Algorithms for the Identical Parallel Machine Scheduling Problem," INFORMS Journal on Computing, INFORMS, vol. 20(3), pages 333-344, August.
    4. Mokotoff, Ethel, 2004. "An exact algorithm for the identical parallel machine scheduling problem," European Journal of Operational Research, Elsevier, vol. 152(3), pages 758-769, February.

    More about this item

    Keywords

    Approximate algorithms; scheduling; list scheduling; 90B35;
    All these keywords.

    JEL classification:

    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:spr:topjnl:v:9:y:2001:i:2:p:243-269. 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.