Some Numerical Studies on Machine Scheduling Problems

In the present paper shop environments with mathematics of scheduling is discussed in brief. A single machine scheduling problem is considered and solved for various objective criteria such as minimization of maximum lateness, minimization of total completion time, and total flow time. Sequences are considered with, without due dates and with and without release times. The precedence constraint is also considered in a situation and solved with chain rule. At last, minimization of total flow time is obtained using evolutionary search method (genetic algorithm). The time of arriving at the sequence is relatively very easy and computation time is less in genetic algorithm as compared to standard deterministic rules such as SPT,EDD, Random and WSPT.