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 sequence dependent setups as a bilevel programming problem (CROSBI ID 129073)

Prilog u časopisu | izvorni znanstveni rad

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

Podaci o odgovornosti

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

engleski

Production planning problem with sequence dependent setups as a bilevel programming problem

The wellknown Capacitated Lot Sizing Problem is generalized including sequence dependent setup times and two unrelated parallel machines. The obtained problem is modeled as a quadratic mixed 0-1 integer programming problem called Capacitated Lot Sizing Problem with Sequence Dependent Setup Times. We develop a heuristic based on Lagrangean relaxation and tabu search for solving the problem. In the end, some computational results are presented.

capacitated lot sizing problem ; two machines ; sequence dependent setup times ; quadratic mixed 0-1 integer programming problem ; tabu search ; Lagrangean relaxation

nije evidentirano

nije evidentirano

nije evidentirano

nije evidentirano

nije evidentirano

nije evidentirano

Podaci o izdanju

187 (3)

2008.

1504-1512

objavljeno

0377-2217

1872-6860

Povezanost rada

Matematika