Volume : V, Issue : I, January - 2016

OPTIMAL JOB SEQUENCE INVOLVING THREE OR MORE MACHINES

Ch. N. Anuradha, V. V. Haragopal, Shahnaz Bathul

Abstract :

The problem of Optimal Job Sequencing (Where processing order of the machines are the same for all jobs and objective is minimizing the makespan) is considered in the general case of M>=3 machines. After reviewing some special cases where the problem is reducible to equivalent two machines case which can be solved by Johnson’s algorithm, procedures for effective bound setting and hence effective lexisearch for optimal solutions in case of general problems with no special restrictions are presented. Computational efficiency of these bounding procedures are investigated by solution of randomly generated problems of different sizes.

Keywords :

Article: Download PDF   DOI : 10.36106/ijsr  

Cite This Article:

CH.N. ANURADHA, V.V.HARAGOPAL, SHAHNAZ BATHUL Optimal Job Sequence Involving Three or More Machines International Journal of Scientific Research, Vol : 5, Issue : 1 January 2016

Number of Downloads : 781

References :