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

A Crane Scheduling Problem in a Computer-Integrated Manufacturing Environment

Author

Listed:
  • Hirofumi Matsuo

    (Department of Management, Graduate School of Business, University of Texas, Austin, Texas 78712)

  • Jen S. Shang

    (Joseph M. Katz Graduate School of Business, University of Pittsburgh, Pittsburgh, Pennsylvania 15260)

  • Robert S. Sullivan

    (Department of Management, Graduate School of Business, University of Texas, Austin, Texas 78712)

Abstract

This paper addresses a crane scheduling and machine layout problem in a Computer Integrated Manufacturing (CIM) Environment. A single crame is used to move all the Work-in-Process (WIP) in the system. The overall system objective is to maximize the yield rate subject to the flow time limit of the WIP. We formalize the problem, and analytically and empirically show that cyclic scheduling provides a near optimal solution, which is superior to dispatching rules. First, we illustrate the optimality and benefits of cyclic scheduling in a simple environment. Then, for multiple-product problems, we show that for a given sequence, finding the minimum cycle time becomes the maximum cost circular network flow problem in a graph. Based on the insights developed, a heuristic for sequencing product types in a cycle is derived that approximately minimizes the cycle time over all sequences. Finally, computational experiments are reported and various assertions made in the paper are empirically verified.

Suggested Citation

  • Hirofumi Matsuo & Jen S. Shang & Robert S. Sullivan, 1991. "A Crane Scheduling Problem in a Computer-Integrated Manufacturing Environment," Management Science, INFORMS, vol. 37(5), pages 587-606, May.
    • Handle: RePEc:inm:ormnsc:v:37:y:1991:i:5:p:587-606
    DOI: 10.1287/mnsc.37.5.587
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.37.5.587
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.37.5.587?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. Kats, Vladimir & Lei, Lei & Levner, Eugene, 2008. "Minimizing the cycle time of multiple-product processing networks with a fixed operation sequence, setups, and time-window constraints," European Journal of Operational Research, Elsevier, vol. 187(3), pages 1196-1211, June.
    2. Wen, Charlie & Eksioglu, Sandra Duni & Greenwood, Allen & Zhang, Shu, 2010. "Crane scheduling in a shipbuilding environment," International Journal of Production Economics, Elsevier, vol. 124(1), pages 40-50, March.
    3. Andrew Lim & Brian Rodrigues & Fei Xiao & Yi Zhu, 2004. "Crane scheduling with spatial constraints," Naval Research Logistics (NRL), John Wiley & Sons, vol. 51(3), pages 386-406, April.
    4. Imai, Akio & Yamakawa, Yukiko & Huang, Kuancheng, 2014. "The strategic berth template problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 72(C), pages 77-100.
    5. Chauvet, Fabrice & Levner, Eugene & Meyzin, Leonid K. & Proth, Jean-Marie, 2000. "On-line scheduling in a surface treatment system," European Journal of Operational Research, Elsevier, vol. 120(2), pages 382-392, January.
    6. Zhichao Feng & Milind Dawande & Ganesh Janakiraman, 2021. "On the Capacity of a Process with Batch Processing and Setup Times," Production and Operations Management, Production and Operations Management Society, vol. 30(11), pages 4273-4287, November.
    7. Milind Dawande & Zhichao Feng & Ganesh Janakiraman, 2021. "On the Structure of Bottlenecks in Processes," Management Science, INFORMS, vol. 67(6), pages 3853-3870, June.

    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:37:y:1991:i:5:p:587-606. 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.