IDEAS home Printed from https://ideas.repec.org/a/ids/ijenma/v6y2015i3p153-174.html
   My bibliography  Save this article

Analysis of job insertion technique for different initial sequences in permutation flow shop scheduling problems

Author

Listed:
  • A. Baskar
  • M. Anthony Xavior

Abstract

A permutation flow shop scheduling problem involves the determination of the order of processing the required number of jobs having different processing times over different machines with an objective of minimising a performance parameter. For makespan minimisation, the problem is NP-complete and many heuristics have been developed over the years. It is generally accepted that the heuristic developed by Nawaz, Enscore and Ham (NEH heuristic) is the most efficient so far among the simple heuristics. NEH algorithm sorts the jobs in descending order of their total processing times. Initial sequence is constructed by selecting the first two jobs and other jobs are inserted one by one to obtain the makespan and the corresponding sequence. This paper analyses the powerful job insertion technique of NEH algorithm using different combinations of the total processing time and total machine idle time for different initial sequences. Taillard benchmark problems are used for the analysis.

Suggested Citation

  • A. Baskar & M. Anthony Xavior, 2015. "Analysis of job insertion technique for different initial sequences in permutation flow shop scheduling problems," International Journal of Enterprise Network Management, Inderscience Enterprises Ltd, vol. 6(3), pages 153-174.
    • Handle: RePEc:ids:ijenma:v:6:y:2015:i:3:p:153-174
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=71131
    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.

    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:ijenma:v:6:y:2015:i:3:p:153-174. 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=187 .

    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.