FINITE HORIZON ELSP IN FLEXIBLE FLOW LINES WITH UNRELATED PARALLEL MACHINES

This article addresses the economic lot sizing and scheduling problem in flexible flow lines with unrelated parallel machines over a finite planning horizon. It is assumed that all parameters such as demand rates for the products are deterministic and constant over a finite planning horizon. A new mixed zero-one nonlinear mathematical program for the problem has been developed. Due to the difficulty of obtaining the optimal solution, an efficient constructive heuristic algorithm is also proposed and evaluated. Computational experiments indicate that the proposed heuristic is very hopeful especially for obtaining a near-optimal (or optimal) solution in medium and large-scaled problems.