Production planning problem with sequence dependent setups as a bilevel programming problem (CROSBI ID 129073)
Prilog u časopisu | izvorni znanstveni rad
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
Povezanost rada
Matematika