HOPS - Hamming-Oriented Partition Search production planning in the spinning industry
HOPS - Hamming-Oriented Partition Search production planning in the spinning industry
No Thumbnail Available
Date
2014
Authors
Victor Camargo
Toledo,FMB
Bernardo Almada-Lobo
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
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.