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

Pixelation of time matrices for solving permutation flowshop scheduling problem

Author

Listed:
  • Shahriar Farahmand Rad

Abstract

Over the last decades, scheduling theory has been put into practice so as to tackle production process as a combinatorial optimisation problem and specifically as a PFSP (Permutation Flowshop Scheduling Problem). Often, NP-completeness of PFSP leads numerous research towards suggesting heuristic algorithms. The objective is to propose an optimal or near-to-optimal order of n jobs processing on m machines with a minimum completion time of all jobs. In this paper, a two-phase heuristic algorithm will be presented, named IFRS (Improved FRS). FRS, within the first phase, is going to be used to find a superior order of jobs out of Taillard’s instances; then the order of jobs will be improved again in phase 2. While running IFRS, a completely new idea, named Pixelation of time matrices, will be used for the very first time and provide a final pattern, which can be used in any heuristic algorithm with makespan criterion. After using the hard benchmark instances of Taillard, the superiority of IFRS over 20 algorithms is going to be shown by tables and statistical graphics. Due to its low makespan values, IFRS benefits flow production, as does NEH.

Suggested Citation

  • Shahriar Farahmand Rad, 2024. "Pixelation of time matrices for solving permutation flowshop scheduling problem," International Journal of Production Research, Taylor & Francis Journals, vol. 62(23), pages 8505-8517, December.
  • Handle: RePEc:taf:tprsxx:v:62:y:2024:i:23:p:8505-8517
    DOI: 10.1080/00207543.2024.2344654
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1080/00207543.2024.2344654?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:62:y:2024:i:23:p:8505-8517. 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.