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

Focused Scheduling in Proportionate Flowshops

Author

Listed:
  • Peng Si Ow

    (Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh, Pennsylvania 15213)

Abstract

The proportionate flowshop is a special class of flowshops in which the operation times of jobs are proportionate, e.g., because of differences in the speeds of machines. In this paper, we make use of a special property of proportionate flowshops, namely that the bottleneck in the shop is almost always the one where job operations are proportionately longer than for any other operations (the slowest machine) to demonstrate a scheduling procedure that makes scheduling decisions by focusing on the information and consequences at the bottleneck resource. This is called the Focused Approach. The scheduling objective is to minimize the total tardiness cost of jobs, where each job may have a different tardiness cost. The decision rule used in this approach is the Idle Time Rule whose development is described in this paper. The approach was tested using approximately proportionate flowshops of different sizes. The results obtained for small 3-machine problems were compared against the optimal permutation schedules obtained using Branch-and-Bound and was found to be near-optimal. For larger problems using 4- and 8-machine flowshops, the results were compared to five other scheduling methods. The focused approach performed far better than those other scheduling methods not only in minimizing tardiness cost, but also minimizing the percentage of tardy jobs and the percentage of processing time to work-in-process time. Finally, the two-product shop where the bottleneck was dynamic was studied and, using a simple strategy to track bottlenecks, the focused approach was again found to perform well compared with other heuristic methods.

Suggested Citation

  • Peng Si Ow, 1985. "Focused Scheduling in Proportionate Flowshops," Management Science, INFORMS, vol. 31(7), pages 852-869, July.
  • Handle: RePEc:inm:ormnsc:v:31:y:1985:i:7:p:852-869
    DOI: 10.1287/mnsc.31.7.852
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.31.7.852
    Download Restriction: no

    File URL: https://libkey.io/10.1287/mnsc.31.7.852?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
    ---><---

    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:31:y:1985:i:7:p:852-869. 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.