Utilize este identificador para referenciar este registo: http://hdl.handle.net/10198/2670
Título: Solving a multiprocessor problem by column generation and branch-and-price
Autor: Duarte, António J.S.T.
Carvalho, J.M. Valério de
Palavras-chave: Scheduling
Data: 2010
Citação: Duarte, António J.S.T. ; Valério de Valério, J. M. ; (2010) - Solving a multiprocessor problem by column generation and branch-and-price. In IFAC MCPL. Coimbra.
Resumo: This work presents an algorithm for solving exactly a scheduling problem with identical parallel machines and malleable tasks, subject to arbitrary release dates and due dates. The objective is to minimize a function of late work and setup costs. A task is malleable if we can freely change the set of machines assigned to its processing over the time horizon. We present an integer programming model, a Dantzig-Wolfe decomposition reformulation and its solution by column generation. We also developed an equivalent network flow model, used for the branching phase. Finally, we carried out extensive computational tests to verify the algorithm’s efficiency and to determine the model’s sensitivity to instance size parameters: the number of machines, the number of tasks and the size of the planning horizon.
URI: http://hdl.handle.net/10198/2670
Aparece nas colecções:ESTiG - Publicações em Proceedings Indexadas à WoS/Scopus

Ficheiros deste registo:
Ficheiro Descrição TamanhoFormato 
mcpl2010Definitivo.pdf171 kBAdobe PDFVer/Abrir

FacebookTwitterDeliciousLinkedInDiggGoogle BookmarksMySpace
Formato BibTex MendeleyEndnote Degois 

Todos os registos no repositório estão protegidos por leis de copyright, com todos os direitos reservados.