Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

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

Analysis of job insertion technique for different initial sequences in permutation flow shop... 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 ( heuristic) is the most efficient so far among the simple heuristics. 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 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. Keywords: heuristics; permutation flow shop scheduling; makespan; job insertion technique. Reference to this paper should be made as follows: Baskar, A. and Xavior, M.A. (2015) ` in permutation flow shop scheduling problems', Int. J. Enterprise Network Management, Vol. 6, No. 3, pp.153­174. Biographical notes: A. Baskar is currently working as the Principal/Professor http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png International Journal of Enterprise Network Management Inderscience Publishers

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

Download PDF
22 pages

Loading next page...
 
/lp/inderscience-publishers/analysis-of-job-insertion-technique-for-different-initial-sequences-in-I1qJUhGq0W

References

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

Publisher
Inderscience Publishers
Copyright
Copyright © 2015 Inderscience Enterprises Ltd.
ISSN
1748-1252
eISSN
1748-1260
DOI
10.1504/IJENM.2015.071131
Publisher site
See Article on Publisher Site

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 ( heuristic) is the most efficient so far among the simple heuristics. 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 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. Keywords: heuristics; permutation flow shop scheduling; makespan; job insertion technique. Reference to this paper should be made as follows: Baskar, A. and Xavior, M.A. (2015) ` in permutation flow shop scheduling problems', Int. J. Enterprise Network Management, Vol. 6, No. 3, pp.153­174. Biographical notes: A. Baskar is currently working as the Principal/Professor

Journal

International Journal of Enterprise Network Management – Inderscience Publishers

Published: Jan 1, 2015

There are no references for this article.