TY  - JOUR
AU  - Hemamalini, T. 
AU  - Senthilvel, A. N. 
AU  - Somasundaram, S. 
PY  - 2010
TI  - Scheduling Algorithm to Optimize Jobs in Shop Floor
JF  - Journal of Mathematics and Statistics
VL  - 6
IS  - 4
DO  - 10.3844/jmssp.2010.416.420
UR  - https://thescipub.com/abstract/jmssp.2010.416.420
AB  - Problem statement: The ratio scheduling algorithm to solve the allocation of jobs in the
shop floor was proposed. The problem was to find an optimal schedule so as to minimize the
maximum completion time, the sum of distinct earliness and tardiness penalties from a given common
due date d. Approach: The objective of the proposed algorithm was to reduce the early penalty and the
late penalty and to increase the overall profit of the organization. The proposed method was discussed
with different possible instances. Results: The test results showed that the algorithm was robust and
simple and can be applied for any job size problem. Conclusion: The proposed algorithm gave
encouraging result for the bench mark instances when the due date is less than half of the total
processing time.