Naslov
Some Heuristics for Production Planning Problem with Sequence Dependent Setup Times

Autori
Lukač, Zrinka ; Neralić, Luka

Vrsta, podvrsta i kategorija rada
Sažeci sa skupova, sažetak, znanstveni

Izvornik
IX International Conference "Approximation and Optimization in the Caribbean", Abstract Book, San Andres Island - COLOMBIA / - Cali : Department of Mathematics, University of Valle, Cali, Colombia, 2008, 113-113

Skup
IX International Conference Approximation and Optimization in the Caribbean

Mjesto i datum
Isla de San Andrés, Kolumbija, 02.03.2008. - 07.03.2008

Vrsta sudjelovanja
Predavanje

Vrsta recenzije
Međunarodna recenzija

Ključne riječi
Production planning problem; sequence dependent setup times; heuristics

Sažetak
We consider the problem of how to schedule the production of n different products on two different capacity limited machines in order to satisfy the known demand during the planning horizon consisting of T periods of time. We assume that each product can be processed on any of the two machines and that at any given time period each machine can produce one type of product only. Furthermore, each switch from one item to another requires sequence dependent setup time. The objective is to minimize the sum of production, storage and setup costs. The problem is formulated as a quadratic mixed 0-1 integer programming problem. In order to solve the problem we develop several heuristics based on Lagrangean relaxation, Tabu Search and Variable Neighborhood Search (VNS) heuristics. At the end we present some computational results and heuristics comparison.

Izvorni jezik
Engleski

Znanstvena područja
Matematika, Ekonomija

POVEZANOST RADA