Heuristics for parallel flow scheduling with due date based objective

Abstract

Scheduling theory is concerned with the allocation of a set of limited newlineresources to process a given number of jobs In fact a scheduling problem newlineconsists of finding the sequence of a certain number of jobs to be carried out newlineon different machines so that technological constraints are satisfied and one newlineor several performance criteria are optimized It also involves predicting the newlinework to be done so that we can coordinate timely use of materials and the newlinemeans of production newlineThis research work concentrates on parallel flow line scheduling which newlinecan be stated as a set of independent jobs to be processed on any number of newlineavailable parallel lines that has same number of similar machines newline newline