Application of metaheuristics to single And multi objective flowshop Scheduling problems

Abstract

newline This thesis addresses permutation flowshop scheduling problem newlinePFSP which aims at scheduling a set of jobs for processing on m number of newlinemachines Scheduling is concerned with allocating limited resources to tasks newlineto optimize certain objective functions Globalisation has compelled the newlinemanufacturing companies to be more competitive to sustain their business newlineTotal Quality Management concept insists on time delivery of jobs which is newlinethe crucial factor for customer satisfaction Scheduling as a part of newlineproduction planning and control plays an important role in the entire newlinemanufacturing process newlineThe makespan is the completion time of the last job scheduled on newlinethe last machine and it is a function of the sequence in which the jobs are newlineprocessed through the flowshop Job flowtime is the time spent by a job in the newlineshop while being processed The objective of minimizing the makespan and newlineflowtime are often employed as a criterion for flow shop scheduling newlineMinimisation of total machine idletime leads to maximum utilization of newlineindividual machine and will minimize production cost also Since the problem newlineis known to be NP hard for more than two machines most of the research newlineeffort has been devoted to the development of heuristic procedures in order to newlineprovide good approximate solutions to the problem newline