Gokhale, Ravindra and Mathirajan, M (2011) Heuristic algorithms for scheduling of a batch processor in automobile gear manufacturing. In: International Journal of Production Research, 49 (10). pp. 2705-2728.Full text not available from this repository.
In this paper we address a scheduling problem for minimising total weighted tardiness. The motivation for the paper comes from the automobile gear manufacturing process. We consider the bottleneck operation of heat treatment stage of gear manufacturing. Real life scenarios like unequal release times, incompatible job families, non-identical job sizes and allowance for job splitting have been considered. A mathematical model taking into account dynamic starting conditions has been developed. Due to the NP-hard nature of the problem, a few heuristic algorithms have been proposed. The performance of the proposed heuristic algorithms is evaluated: (a) in comparison with optimal solution for small size problem instances, and (b) in comparison with `estimated optimal solution' for large size problem instances. Extensive computational analyses reveal that the proposed heuristic algorithms are capable of consistently obtaining near-optimal solutions (that is, statistically estimated one) in very reasonable computational time.
|Item Type:||Journal Article|
|Additional Information:||Copyright of this article belongs to Taylor and Francis Group.|
|Keywords:||scheduling; batch processor; gear manufacturing; mathematical model; heuristic algorithms|
|Department/Centre:||Division of Information Sciences > Management Studies|
|Date Deposited:||31 Mar 2011 07:14|
|Last Modified:||31 Mar 2011 07:14|
Actions (login required)