IDEAS home Printed from https://ideas.repec.org/a/eee/jomega/v15y1987i3p207-227.html
   My bibliography  Save this article

Single machine scheduling research

Author

Listed:
  • Gupta, Sushil K
  • Kyparisis, Jerzy

Abstract

This paper reviews static scheduling research on single machine for the last three decades. One hundred seventy one papers were found on this topic after an extensive search in the English language periodicals. These papers are classified on the basis of the objective functions and constraints. Contribution of each paper is analyzed in terms of its theoretical and computational results. An analysis of the literature on the basis of number of articles published in each year, in each category, in different journals and by different authors has also been provided. This reveals several interesting facts about the developments in single machine scheduling (SMS) research and its future.

Suggested Citation

  • Gupta, Sushil K & Kyparisis, Jerzy, 1987. "Single machine scheduling research," Omega, Elsevier, vol. 15(3), pages 207-227.
    • Handle: RePEc:eee:jomega:v:15:y:1987:i:3:p:207-227
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0305-0483(87)90071-5
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    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. Gordon, Valery & Proth, Jean-Marie & Chu, Chengbin, 2002. "A survey of the state-of-the-art of common due date assignment and scheduling research," European Journal of Operational Research, Elsevier, vol. 139(1), pages 1-25, May.
    2. Drexl, Andreas & Jordan, Carsten, 1993. "Wissensbasierte Produktionsprozeßplanung bei reihenfolgeabhängigen Rüstkosten und -zeiten," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 321, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    3. repec:dgr:rugsom:95a37 is not listed on IDEAS
    4. Wiers, V. C. S., 1997. "A review of the applicability of OR and AI scheduling techniques in practice," Omega, Elsevier, vol. 25(2), pages 145-153, April.
    5. Chengbin Chu, 1992. "A branch‐and‐bound algorithm to minimize total tardiness with different release dates," Naval Research Logistics (NRL), John Wiley & Sons, vol. 39(2), pages 265-283, March.
    6. Kolahan, F. & Liang, M., 1998. "An adaptive TS approach to JIT sequencing with variable processing times and sequence-dependent setups," European Journal of Operational Research, Elsevier, vol. 109(1), pages 142-159, August.
    7. Chengbin Chu, 1992. "A branch‐and‐bound algorithm to minimize total flow time with unequal release dates," Naval Research Logistics (NRL), John Wiley & Sons, vol. 39(6), pages 859-875, October.
    8. Kate, H.A. ten & Wijngaard, J. & Zijm, W.H.M., 1995. "Minimizing weighted total earliness, total tardiness and setup costs," Research Report 95A37, University of Groningen, Research Institute SOM (Systems, Organisations and Management).
    9. Henning Strubelt & Sebastian Trojahn & Sebastian Lang & Abdulrahman Nahhas, 2018. "Scheduling Approach for the Simulation of a Sustainable Resource Supply Chain," Logistics, MDPI, vol. 2(3), pages 1-11, July.
    10. Allahverdi, Ali & Gupta, Jatinder N. D. & Aldowaisan, Tariq, 1999. "A review of scheduling research involving setup considerations," Omega, Elsevier, vol. 27(2), pages 219-239, April.

    More about this item

    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:eee:jomega:v:15:y:1987:i:3:p:207-227. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/375/description#description .

    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.