IDEAS home Printed from https://ideas.repec.org/a/ids/ijisen/v13y2013i4p409-423.html
   My bibliography  Save this article

Scheduling identical parallel machine with unequal job release time to minimise total flow time

Author

Listed:
  • Zubair Ahmed
  • Tarek Y. Elmekkawy

Abstract

This paper addresses the identical parallel machine scheduling problem with unequal jobs release date to minimise the total flow time. An efficient heuristic algorithm was proposed, known as modified forward heuristic algorithm. The algorithm starts with developing a priority list of all jobs. This list is used to develop sub-schedules for each machine based on some propositions related to the jobs processing and release times with allowing delay schedule. A mathematical model of the problem was also developed. The performance of the algorithm was evaluated by comparing its solutions with the optimal solutions of small test cases obtained from the developed mathematical model. Then, the results of large problems were compared with the results of the best reported heuristics in the literature. In addition to the simplicity of the proposed algorithm, these comparisons showed that the proposed algorithm can obtain solutions that are very close to the optimum solutions and better than the other heuristics.

Suggested Citation

  • Zubair Ahmed & Tarek Y. Elmekkawy, 2013. "Scheduling identical parallel machine with unequal job release time to minimise total flow time," International Journal of Industrial and Systems Engineering, Inderscience Enterprises Ltd, vol. 13(4), pages 409-423.
    • Handle: RePEc:ids:ijisen:v:13:y:2013:i:4:p:409-423
    as

    Download full text from publisher

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

    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. Sergey Plaksin & Gulnara Abdrakhmanova & Galina Kovaleva, 2017. "Approaches to Defining and Measuring Russia’s Internet Economy," Foresight and STI Governance (Foresight-Russia till No. 3/2015), National Research University Higher School of Economics, vol. 11(1), pages 55-65.
      • Sergey Plaksin & Gulnara Abdrakhmanova & Galina Kovaleva, 2017. "Approaches to Defining and Measuring Russia’s Internet Economy," Foresight-Russia Форсайт, CyberLeninka;Федеральное государственное автономное образовательное учреждение высшего образования «Национальный исследовательский университет «Высшая школа экономики», vol. 11(1 (eng)), pages 55-65.
    2. Mecler, Davi & Abu-Marrul, Victor & Martinelli, Rafael & Hoff, Arild, 2022. "Iterated greedy algorithms for a complex parallel machine scheduling problem," European Journal of Operational Research, Elsevier, vol. 300(2), pages 545-560.

    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:ijisen:v:13:y:2013:i:4:p:409-423. 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=188 .

    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.