IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v16y1969i4pb247-b263.html
   My bibliography  Save this article

The Sequencing Problem

Author

Listed:
  • Mahendra S. Bakshi

    (Jansen Electronics Manufacturing, Inc., St. Paul, Minnesota)

  • Sant Ram Arora

    (Division of Industrial Engineering, University of Minnesota)

Abstract

This paper surveys methods proposed in the literature for determining the optimal solution to "N Job, M Machines" scheduling problems when there are no due dates or priorities and the sole objective is to complete all operations in least time.

Suggested Citation

  • Mahendra S. Bakshi & Sant Ram Arora, 1969. "The Sequencing Problem," Management Science, INFORMS, vol. 16(4), pages 247-263, December.
    • Handle: RePEc:inm:ormnsc:v:16:y:1969:i:4:p:b247-b263
    DOI: 10.1287/mnsc.16.4.B247
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.16.4.B247
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.16.4.B247?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
    ---><---

    Citations

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


    Cited by:

    1. Sahoo, Biresh K. & Zhu, Joe & Tone, Kaoru & Klemen, Bernhard M., 2014. "Decomposing technical efficiency and scale elasticity in two-stage network DEA," European Journal of Operational Research, Elsevier, vol. 233(3), pages 584-594.
    2. Sahoo, Biresh K. & Tone, Kaoru, 2013. "Non-parametric measurement of economies of scale and scope in non-competitive environment with price uncertainty," Omega, Elsevier, vol. 41(1), pages 97-111.
    3. Blazewicz, Jacek & Domschke, Wolfgang & Pesch, Erwin, 1996. "The job shop scheduling problem: Conventional and new solution techniques," European Journal of Operational Research, Elsevier, vol. 93(1), pages 1-33, August.
    4. Tzafestas, Spyros & Triantafyllakis, Alekos, 1993. "Deterministic scheduling in computing and manufacturing systems: a survey of models and algorithms," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 35(5), pages 397-434.

    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:inm:ormnsc:v:16:y:1969:i:4:p:b247-b263. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.