DefinePK

Abstract

The weighted scheduling problem is practically obvious and need more investigation. In this research work is focused on the weighted scheduling problem with critical machine consideration of permutation flow type manufacturing environment. The objectives are makespan minimization as well as maximize the utilization of critical machine. The problem initially simplified and solved by heuristic method and validated. A special type of heuristic is suggested to solve such critical machine based weighted scheduling problems. The proposed heuristics were validated with multilevel problems. The proposed heuristic outperforms in reduction of ideal time, of critical machine as well as makespan.