engleski

Some Heuristics for Production Planning Problem with Sequence Dependent Setup Times

We consider the problem of how to schedule the production of n different products on two different capacity limited machines in order to satisfy the known demand during the planning horizon consisting of T periods of time. We assume that each product can be processed on any of the two machines and that at any given time period each machine can produce one type of product only. Furthermore, each switch from one item to another requires sequence dependent setup time. The objective is to minimize the sum of production, storage and setup costs. The problem is formulated as a quadratic mixed 0-1 integer programming problem. In order to solve the problem we develop several heuristics based on Lagrangean relaxation, Tabu Search and Variable Neighborhood Search (VNS) heuristics. At the end we present some computational results and heuristics comparison.

Production planning problem; sequence dependent setup times; heuristics

nije evidentirano