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

Performance of priority rules in a due date flow shop

Author

Listed:
  • Hunsucker, J. L.
  • Shah, J. R.

Abstract

The scheduling of a flow shop with multiple processors at one or more stages is a generalized case of the basic flow shop problem. It involves the sequencing of n jobs in a flow shop where more than one identical machine at a machine stage is allowable. The constrained flow shop with multiple processors problem (CFSMP) is a special case of the flow shop with multiple processors problem, in which the total number of jobs that can concurrently exist in the system is limited to a pre-specified number. The purpose of this study is to evaluate the performance of six priority rules under different congestion levels in the system for two measures of performance, namely, mean tardiness and number of tardy jobs. A dynamic simulation model of the constrained flow shop with multiple processors has been developed. The priority rules considered in the study are localized procedures. However, the queuing priorities for sequencing the jobs in the simulation model are established dynamically at each processing stage. The results of the study provide conclusive evidence of the superiority of the first-in-first-out priority rule for the mean tardiness criterion. However, for the number of tardy jobs criterion, clear superiority of a particular priority rule is not established. It is found that different priority rules yield good performances for different congestion levels in the system. Thus, the study provides general guidelines for using a particular priority rule for the number of tardy jobs criterion depending upon the system parameters.

Suggested Citation

  • Hunsucker, J. L. & Shah, J. R., 1992. "Performance of priority rules in a due date flow shop," Omega, Elsevier, vol. 20(1), pages 73-89, January.
    • Handle: RePEc:eee:jomega:v:20:y:1992:i:1:p:73-89
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0305-0483(92)90057-E
    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. A. Baykal Hafızoğlu & Esma S. Gel & Pınar Keskinocak, 2013. "Expected Tardiness Computations in Multiclass Priority M / M / c Queues," INFORMS Journal on Computing, INFORMS, vol. 25(2), pages 364-376, May.
    2. Sarper, H. & Henry, M. C., 1996. "Combinatorial evaluation of six dispatching rules in a dynamic two-machine flow shop," Omega, Elsevier, vol. 24(1), pages 73-81, February.
    3. Rajendran, Chandrasekharan & Holthaus, Oliver, 1999. "A comparative study of dispatching rules in dynamic flowshops and jobshops," European Journal of Operational Research, Elsevier, vol. 116(1), pages 156-170, July.
    4. Néron, Emmanuel & Baptiste, Philippe & Gupta, Jatinder N. D., 2001. "Solving hybrid flow shop problem using energetic reasoning and global operations," Omega, Elsevier, vol. 29(6), pages 501-511, December.
    5. Bertel, S. & Billaut, J. -C., 2004. "A genetic algorithm for an industrial multiprocessor flow shop scheduling problem with recirculation," European Journal of Operational Research, Elsevier, vol. 159(3), pages 651-662, December.
    6. Ruiz, Rubén & Vázquez-Rodríguez, José Antonio, 2010. "The hybrid flow shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 205(1), pages 1-18, August.
    7. Botta-Genoulaz, Valerie, 2000. "Hybrid flow shop scheduling with precedence constraints and time lags to minimize maximum lateness," International Journal of Production Economics, Elsevier, vol. 64(1-3), pages 101-111, March.
    8. El-Bouri, Ahmed & Balakrishnan, Subramaniam & Popplewell, Neil, 2008. "Cooperative dispatching for minimizing mean flowtime in a dynamic flowshop," International Journal of Production Economics, Elsevier, vol. 113(2), pages 819-833, June.
    9. Santos, D. L. & Hunsucker, J. L. & Deal, D. E., 1995. "Global lower bounds for flow shops with multiple processors," European Journal of Operational Research, Elsevier, vol. 80(1), pages 112-120, January.
    10. Brah, Shaukat A. & Loo, Luan Luan, 1999. "Heuristics for scheduling in a flow shop with multiple processors," European Journal of Operational Research, Elsevier, vol. 113(1), pages 113-122, February.

    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:20:y:1992:i:1:p:73-89. 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.