Nalazite se na CroRIS probnoj okolini. Ovdje evidentirani podaci neće biti pohranjeni u Informacijskom sustavu znanosti RH. Ako je ovo greška, CroRIS produkcijskoj okolini moguće je pristupi putem poveznice www.croris.hr
izvor podataka: crosbi

Production planning problem with different setups as a bilevel programming problem (CROSBI ID 163244)

Prilog u časopisu | izvorni znanstveni rad | međunarodna recenzija

Lukač, Zrinka ; Šorić, Kristina ; Vojvodić Rosenzweig, Višnja Production planning problem with different setups as a bilevel programming problem // European journal of operational research, 187 (2008), 3; 1504-1512

Podaci o odgovornosti

Lukač, Zrinka ; Šorić, Kristina ; Vojvodić Rosenzweig, Višnja

engleski

Production planning problem with different 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

nije evidentirano

nije evidentirano

nije evidentirano

nije evidentirano

nije evidentirano

Podaci o izdanju

187 (3)

2008.

1504-1512

objavljeno

0377-2217

Povezanost rada

Matematika

Indeksiranost