engleski

Production plannig problem with sequence dependent setups

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 setup time and the sum of the costs of production, backlog, storage and setup. Combining these two problems, we define a bicriteria mixed 0-1 integer programming problem called Production Planning Problem with Sequence Dependent Setups. 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; bicriteria mixed 0-1 integer programming problem; heuristics based on tabu search

nije evidentirano