engleski

Production Planning Problem with Sequence Dependent Setups as a Bilevel Programming Problem

Each of N items (products) is to be processed on two machines in order to satisfy known demands in each of T periods. Only one item can be processed on each machine at any given time. Each switch from one item to another requires sequence dependent setup time. The object is to minimize the total set up time and the sum of the costs of production, backlog, storage and set up. In order to obtain the solution, we divide the above problem into two subproblems by introducing the hierarchy into the model. Because of this, we model the problem as a bilevel mixed 0-1 integer programming problem. The object of the leader is to assign the items to the machines in order to minimize the total setup time, while the object of the follower is to minimize the production, backlog, storage and setup cost of the machine. We develop a heuristics based on tabu search for solving the problem. At the end, some computational results are presented.

production planning problem; two machines; sequence dependent setup times; bilevel mixed 0-1 integer programming problem; heuristics based on tabu search

nije evidentirano