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

Use of a case study in sequencing/scheduling research

Author

Listed:
  • Dudek, RA
  • Smith, ML
  • Panwalkar, SS

Abstract

This paper describes a study of an industrial sequencing/scheduling problem. The study contains the definition of the problem, data requirements and examination of solution technique. Definition of the problem is discussed from the aspect of uniqueness of the specific system. Discussion of data requirements includes availability and accuracy, while examination of solution technique considers limitation of time, computer capacity, etc., as well as the possibility of imbedding available algorithms into the solution procedure. Conclusions are presented relative to the use of the case study approach in sequencing/scheduling research.

Suggested Citation

  • Dudek, RA & Smith, ML & Panwalkar, SS, 1974. "Use of a case study in sequencing/scheduling research," Omega, Elsevier, vol. 2(2), pages 253-261, April.
    • Handle: RePEc:eee:jomega:v:2:y:1974:i:2:p:253-261
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0305-0483(74)90094-2
    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. Mina Roohnavazfar & Daniele Manerba & Lohic Fotio Tiotsop & Seyed Hamid Reza Pasandideh & Roberto Tadei, 2021. "Stochastic single machine scheduling problem as a multi-stage dynamic random decision process," Computational Management Science, Springer, vol. 18(3), pages 267-297, July.
    2. Ching‐Jong Liao & Cheng‐Hsing Chuang, 1996. "Sequencing with setup time and order tardiness trade‐offs," Naval Research Logistics (NRL), John Wiley & Sons, vol. 43(7), pages 971-984, October.
    3. Sioud, A. & Gagné, C., 2018. "Enhanced migrating birds optimization algorithm for the permutation flow shop problem with sequence dependent setup times," European Journal of Operational Research, Elsevier, vol. 264(1), pages 66-73.

    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:2:y:1974:i:2:p:253-261. 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.