Scheduling Algorithm to Optimize Jobs in Shop Floor | Science Publications

Journal of Mathematics and Statistics

S. Somasundaram¹  A. N. Senthilvel¹  T. Hemamalini¹ 

关键词: Ratio scheduling;    job shop scheduling;    Np-hardness;    penalty;    restrictive problem;   

DOI  :  10.3844/jmssp.2010.416.420

学科分类：社会科学、人文和艺术（综合）

来源: Science Publications

【 摘 要 】

Problem statement: The ratio scheduling algorithm to solve the allocation of jobs in theshop floor was proposed. The problem was to find an optimal schedule so as to minimize themaximum completion time, the sum of distinct earliness and tardiness penalties from a given commondue date d. Approach: The objective of the proposed algorithm was to reduce the early penalty and thelate penalty and to increase the overall profit of the organization. The proposed method was discussedwith different possible instances. Results: The test results showed that the algorithm was robust andsimple and can be applied for any job size problem. Conclusion: The proposed algorithm gaveencouraging result for the bench mark instances when the due date is less than half of the totalprocessing time.

【 授权许可】

Unknown