Load Information Based Priority Dependant Heuristic for Manpower Scheduling Problem in Remanufacturing

Disassemble scheduling in remanufacturing is an important issue in the current industrial scenario. Allocation of operators for this purpose forms a special class of manpower scheduling problem with an added layer of restrictions. In this paper we propose a set of heuristics that make use of the concept of load information utilization. Several modifications have been incorporated on the basic framework and thorough comparison has been made between the same to devise an efficient way to tackle remanufacturing scheduling problems. The developed method has been put to test on a series of test functions of varying range of difficulty. The results prove the efficiency of these heuristics to solve this scheduling problem.