IDEAS home Printed from https://ideas.repec.org/a/taf/tprsxx/v53y2015i9p2605-2616.html
   My bibliography  Save this article

Design and comparative performance analysis of a heuristic-based parameterised Banker’s algorithm using the CRL scheduling problems

Author

Listed:
  • Jin Young Choi

Abstract

In this paper, we suggest an efficient sub-optimal deadlock avoidance policy (DAP), called a heuristic-based parameterised Banker’s algorithm (H-pBA). It has the main three steps such as (i) for a state s$ s $, explicitly identifying j$ j $-job instances and feasible y$ y $-processing steps for them to be proceeded, (ii) generating a new state s′$ s^{\prime } $ by applying the (j,y)$ (j, y) $-choice to the state s$ s $ and (iii) determining the safety of the state s$ s $ by checking if all the resources required by all the job instances in the state s′$ s^{\prime } $ up to completion are available. The algorithm iteratively applies these steps to a state by changing the values of j$ j $ and y$ y $, up to their upper bounds in the worst case, until it makes a decision about the safety. For performance evaluation, we perform a comparative performance analysis by conducting numerical experiments using a set of prototypical examples for capacitated re-entrant line (CRL) configurations, while comparing with the most common polynomial-kernel DAPs reported in the literature. By suggesting two performance indices representing the operational flexibility and effectiveness, we show that the performance of the suggested H-pBA is consistently superior to that of other PK-DAPs, and furthermore, it is beneficial to integrate it with the first-buffer first-serve policy for system throughput in the CRL.

Suggested Citation

  • Jin Young Choi, 2015. "Design and comparative performance analysis of a heuristic-based parameterised Banker’s algorithm using the CRL scheduling problems," International Journal of Production Research, Taylor & Francis Journals, vol. 53(9), pages 2605-2616, May.
  • Handle: RePEc:taf:tprsxx:v:53:y:2015:i:9:p:2605-2616
    DOI: 10.1080/00207543.2014.970710
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2014.970710
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/00207543.2014.970710?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:taf:tprsxx:v:53:y:2015:i:9:p:2605-2616. 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 Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/TPRS20 .

    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.