Pregled bibliografske jedinice broj: 815068
Some heuristics for solving Production Planning Problem with Sequence Dependent Setup Times
Some heuristics for solving Production Planning Problem with Sequence Dependent Setup Times // Proceedings of The 6th International Conference on Information Technology - Cloud Computing ICIT 2013 / Al-Dahoud, Ali (ur.).
Amman, 2013. (predavanje, međunarodna recenzija, cjeloviti rad (in extenso), znanstveni)
CROSBI ID: 815068 Za ispravke kontaktirajte CROSBI podršku putem web obrasca
Naslov
Some heuristics for solving Production Planning Problem with Sequence Dependent Setup Times
Autori
Lukač, Zrinka
Vrsta, podvrsta i kategorija rada
Radovi u zbornicima skupova, cjeloviti rad (in extenso), znanstveni
Izvornik
Proceedings of The 6th International Conference on Information Technology - Cloud Computing ICIT 2013
/ Al-Dahoud, Ali - Amman, 2013
ISBN
978-9957-8583-1-5
Skup
The 6th International Conference on Information Technology - Cloud Computing ICIT 2013
Mjesto i datum
Amman, Jordan, 08.05.2013. - 10.05.2013
Vrsta sudjelovanja
Predavanje
Vrsta recenzije
Međunarodna recenzija
Ključne riječi
lot-sizing; sequence dependent setup times; lagrangean relaxation; tabu search; variable neighborhood search; heuristic
Sažetak
This paper addresses the problem of production planning of multiple items on two non-identical machines with sequence dependent setup times in order to meet deterministic dynamic demand and minimize overall costs consisting of production, holding and setup costs. The problem is formulated as quadratic 0-1 mixed-integer programming problem. Its linear formulation is also given. Three heuristics based on variable neighborhood search (VNS) are developed. Heuristics are tested and compared to Lagrangean relaxation heuristics, three versions of tabu search heuristics and CPLEX. Computational results show tradeoff between solution quality and run time needed to obtain solution.
Izvorni jezik
Engleski
Znanstvena područja
Matematika, Računarstvo, Ekonomija
