IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-1-4613-0303-9_25.html

A Review of Machine Scheduling: Complexity, Algorithms and Approximability

In: Handbook of Combinatorial Optimization

Author

Listed:
  • Bo Chen

    (University of Warwick, Warwick Business School)

  • Chris N. Potts

    (University of Southampton, Faculty of Mathematical Studies)

  • Gerhard J. Woeginger

    (Graz University of Technology, Institut für Mathematik)

Abstract

The scheduling of computer and manufacturing systems has been the subject of extensive research for over forty years. In addition to computers and manufacturing, scheduling theory can be applied to many areas including agriculture, hospitals and transport. The main focus is on the efficient allocation of one or more resources to activities over time. Adopting manufacturing terminology, a job consists of one or more activities, and a machine is a resource that can perform at most one activity at a time. We concentrate on deterministic machine scheduling for which it is assumed that all data that define a problem instance are known with certainty.

Suggested Citation

  • Bo Chen & Chris N. Potts & Gerhard J. Woeginger, 1998. "A Review of Machine Scheduling: Complexity, Algorithms and Approximability," Springer Books, in: Ding-Zhu Du & Panos M. Pardalos (ed.), Handbook of Combinatorial Optimization, pages 1493-1641, Springer.
    • Handle: RePEc:spr:sprchp:978-1-4613-0303-9_25
    DOI: 10.1007/978-1-4613-0303-9_25
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    Citations

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


    Cited by:

    1. Tao Ren & Yuandong Diao & Xiaochuan Luo, 2012. "Optimal Results and Numerical Simulations for Flow Shop Scheduling Problems," Journal of Applied Mathematics, John Wiley & Sons, vol. 2012(1).
    2. Agnetis, Alessandro & Billaut, Jean-Charles & Pinedo, Michael & Shabtay, Dvir, 2025. "Fifty years of research in scheduling — Theory and applications," European Journal of Operational Research, Elsevier, vol. 327(2), pages 367-393.

    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:spr:sprchp:978-1-4613-0303-9_25. 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.