Scheduling

It is a process of summing starts and finish time information to the job order dictated in the sequencing process. Sequencing process, in turn, is described as getting the order in which jobs are to be run on a machine. Thus ,the sequence attained determines the schedule, since we suppose each job is begun on the machine as soon as the job has finished all of predecessor operations and the machine has done all earlier jobs in the

 sequences. It is referred to as semi-active schedule and behaves as an optimal policy for minimizing the completion time, lateness, flow time, tardiness, and other measures of performance. Scheduling problems are frequently mentioned by N/M/F/P where N is the number of jobs to be scheduled, M is the number of machines, F indicate job flow pattern, and P is performance measures that are to be appropriately minimized or maximized. Generally the solution of scheduling problems are presented in the form of Gantt-chart which is a chart plotted among different work centres and entire processing time on that work centre. Following is given an example problem to mention the formation of Gantt-chart.