Pregled bibliografske jedinice broj: 282934
Production planning problem with sequence dependent setups as a bilevel programming problem
Production planning problem with sequence dependent setups as a bilevel programming problem // European journal of operational research, 187 (2008), 3; 1504-1512 (podatak o recenziji nije dostupan, članak, znanstveni)
CROSBI ID: 282934 Za ispravke kontaktirajte CROSBI podršku putem web obrasca
Naslov
Production planning problem with sequence dependent
setups as a bilevel programming problem
Autori
Šorić, Kristina ; Vojvodić Rosenzweig, Višnja ; Lukač, Zrinka
Izvornik
European journal of operational research (0377-2217) 187
(2008), 3;
1504-1512
Vrsta, podvrsta i kategorija rada
Radovi u časopisima, članak, znanstveni
Ključne riječi
kapacitirani problem proizvodnje ; dva stroja ; međuovisna vremena setiranja ; kvadratno mješovito cjelobrojno programiranje ; tabu pretraživanje ; Lagrangeova relaksacija
(capacitated lot sizing problem ; two machines ; sequence dependent setup times ; quadratic mixed 0-1 integer programming problem ; tabu search ; Lagrangean relaxation)
Sažetak
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.
Izvorni jezik
Engleski
Znanstvena područja
Matematika
Citiraj ovu publikaciju:
Časopis indeksira:
- Current Contents Connect (CCC)
- Web of Science Core Collection (WoSCC)
- Science Citation Index Expanded (SCI-EXP)
- Social Science Citation Index (SSCI)
- SCI-EXP, SSCI i/ili A&HCI
- Scopus
