IDEAS home Printed from https://ideas.repec.org/a/ids/ijores/v54y2025i3p310-333.html

Permutation flow-shop scheduling with early and late penalty costs using the Jaya algorithm

Author

Listed:
  • Raunaque Paraveen
  • Manoj Kumar Khurana

Abstract

The purpose of this study is to use the most efficient meta-heuristic methodologies in permutation flow shop to identify the ideal sequence of jobs with the least amount of penalties for being early and late. The permutation flow shop is a common job shop problem in which all jobs must pass through all machines in a predefined order. Numerous meta-heuristic algorithms have been developed to tackle this problem. However, users often struggle with selecting appropriate algorithm parameters due to the problem's complexity. To address these challenges, this research adopts the recently developed Jaya algorithm, which stands out for being a parameter-less approach that aims to achieve success while avoiding failure. The Jaya algorithm was tested alongside a genetic algorithm using a simulated industry dataset. This dataset contained different scenarios with varying numbers of jobs and machines. The Jaya algorithm consistently outperformed the genetic algorithm, providing superior results for the given problem.

Suggested Citation

  • Raunaque Paraveen & Manoj Kumar Khurana, 2025. "Permutation flow-shop scheduling with early and late penalty costs using the Jaya algorithm," International Journal of Operational Research, Inderscience Enterprises Ltd, vol. 54(3), pages 310-333.
    • Handle: RePEc:ids:ijores:v:54:y:2025:i:3:p:310-333
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=149656
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to

    for a different version of it.

    More about this item

    Keywords

    ;
    ;
    ;
    ;

    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:ids:ijores:v:54:y:2025:i:3:p:310-333. 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: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=170 .

    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.