HOPS - Hamming-Oriented Partition Search production planning in the spinning industry

Autor(es)

Camargo, Victor C. B. ^{[1, 2]} ; Toledo, Franklina M. B. ^[1] ; Almada-Lobo, Bernardo ^[2]

Afiliação do(s) autor(es)

^[1] Univ Sao Paulo, Inst Ciencias Matemat & Computac, BR-13560970 Sao Carlos, SP - Brazil

^[2] Univ Porto, INESC TEC, Fac Engn, P-4200465 Oporto - Portugal

• Tipo de documento: Artigo Científico
• Fonte: European Journal of Operational Research; v. 234, n. 1, p. 266-277, APR 1 2014.
• Citações Web of Science: 13

Resumo

In this paper, we investigate a two-stage lot-sizing and scheduling problem in a spinning industry. A new hybrid method called HOPS (Hamming-Oriented Partition Search), which is a branch-and-bound based procedure that incorporates a fix-and-optimize improvement method is proposed to solve the problem. An innovative partition choice for the fix-and-optimize is developed. The computational tests with generated instances based on real data show that HOPS is a good alternative for solving mixed integer problems with recognized partitions such as the lot-sizing and scheduling problem. (C) 2013 Elsevier B.V. All rights reserved. (AU)

• Processo FAPESP: 12/20773-1 - Extensões para a otimização de processos na indústria têxtil
• Beneficiário: Victor Claudio Bento de Camargo
• Modalidade de apoio: Bolsas no Brasil - Pós-Doutorado
• Processo FAPESP: 08/09953-2 - Otimização de processos na indústria têxtil: modelos e métodos de solução
• Beneficiário: Victor Claudio Bento de Camargo
• Modalidade de apoio: Bolsas no Brasil - Doutorado