•  
  •  
 

Abstract

This paper discusses about the scheduling problem of a multi product manufacturing industry. Often there has been a problem of applying optimization algorithms to solve the makespan minimization criterion of a job shop due to its inherent NP-hard nature. It is therefore unrealistic to try obtaining a solution through a commercial solver in polynomial time. In this context, we propose a computationally effective heuristic, which is based on the powers-of-two policy in inventory, for solving the minimum makespan problem of job shop scheduling. The research discussed in the current paper is a real time scheduling problem faced by a large scale and complex turbine manufacturing job shop. It is worth noting that by integrating the material requirements planning (MRP) with the feasible schedule obtained, this policy also proves to be useful in minimizing the inventory costs.

Share

COinS