CAPACITATED LOT SIZING AND SCHEDULING PROBLEMS USING HYBRID GA／TS APPROACHES

The capacitated lot sizing and scheduling problem that involves in determining the production amounts and release dates for several items over a given planning horizon are given to meet dynamic order demand without incurring backloggings. The problem considering overtime capacity is studied. The mathematical model is presented, and a genetic algorithm (GA) approach is developed to solve the problem. The initial solutions are generated after using heuristic method. Capacity balancing procedure is employed to stipulate the feasibility of the solutions. In addition, a technique based on Tabu search (TS) is inserted into the genetic algorithm to deal with the scheduled overtime and help the convergence of algorithm. Computational simulation is conducted to test the efficiency of the proposed hybrid approach, which turns out to improve both the solution quality and execution speed.