BINARY ILP FORMULATION FOR THE SIMULTANEOUS MACHINE LOADING PROBLEMS OF TARAKU MILLS LIMITED

Abstract

The integer linear programming (ILP) in production scheduling provides optimal solutions for the desired objective function in sequential scenario. A similar formulation for Taraku Mills Limited is presented where processors are capable of accommodating more than one job (Products) at the same time.

The algorithm used in the computation, utilizes two other algorithms, the Cambell, Dudex and Smith algorithms and the nearest neighbour method of the assignment problems. The simultaneous approach performs extremely better than the sequential approach. There is great reduction in the total flow time of products considered.

The solution to the Taraku Mills Limited formulation is presented in three parts with the objective of minimizing the total flow time. The first part schedules the jobs (products) unto the first processor. The second part finds the total flow time of the four products while the third part schedules the production times of these jobs unto a ganth chart.

The simultaneous approach performs entirely better than the sequential approach and the method like other operations research models can be applied to real life problems.