Solving the Capacitated Lot Sizing and Scheduling Problem with Parallel Machines using Reduced Variable Neighborhood Search and Variable Neighborhood Descent Heuristics | AVESİS

Dokuz Eylül Üniversitesi Akademik Veri Yönetim Sistemi

Solving the Capacitated Lot Sizing and Scheduling Problem with Parallel Machines using Reduced Variable Neighborhood Search and Variable Neighborhood Descent Heuristics

Atıf İçin Kopyala

ÖZCAN TATARİ S., TOPALOĞLU Ş. A.

26th EURO-INFORMS Conference, 1 - 04 Temmuz 2013, (Özet Bildiri)

Yayın Türü: Bildiri / Özet Bildiri
Dokuz Eylül Üniversitesi Adresli: Evet