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.
|International Journal of Enterprise Network Management