IDEAS home Printed from https://ideas.repec.org/a/hin/jnddns/350308.html
   My bibliography  Save this article

A Study on the Enhanced Best Performance Algorithm for the Just-in-Time Scheduling Problem

Author

Listed:
  • Sivashan Chetty
  • Aderemi O. Adewumi

Abstract

The Just-In-Time (JIT) scheduling problem is an important subject of study. It essentially constitutes the problem of scheduling critical business resources in an attempt to optimize given business objectives. This problem is NP-Hard in nature, hence requiring efficient solution techniques. To solve the JIT scheduling problem presented in this study, a new local search metaheuristic algorithm, namely, the enhanced Best Performance Algorithm (eBPA), is introduced. This is part of the initial study of the algorithm for scheduling problems. The current problem setting is the allocation of a large number of jobs required to be scheduled on multiple and identical machines which run in parallel. The due date of a job is characterized by a window frame of time, rather than a specific point in time. The performance of the eBPA is compared against Tabu Search (TS) and Simulated Annealing (SA). SA and TS are well-known local search metaheuristic algorithms. The results show the potential of the eBPA as a metaheuristic algorithm.

Suggested Citation

  • Sivashan Chetty & Aderemi O. Adewumi, 2015. "A Study on the Enhanced Best Performance Algorithm for the Just-in-Time Scheduling Problem," Discrete Dynamics in Nature and Society, Hindawi, vol. 2015, pages 1-12, March.
    • Handle: RePEc:hin:jnddns:350308
    DOI: 10.1155/2015/350308
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/DDNS/2015/350308.pdf
    Download Restriction: no
    File URL: http://downloads.hindawi.com/journals/DDNS/2015/350308.xml
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2015/350308?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
    ---><---

    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:hin:jnddns:350308. 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    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.