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

•A new MIP model for an industrial problem arising at a spinning industry.•The synchronized lot-sizing and scheduling is approached by a new matheuristic.•A Hamming-Oriented Partition Search is the core of the matheuristic.•Variable fixing to problem partitions allows for better upper bounds.•The HO...

Full description

Saved in:
Bibliographic Details
Published in:European journal of operational research 2014-04, Vol.234 (1), p.266-277
Main Authors: Camargo, Victor C.B., Toledo, Franklina M.B., Almada-Lobo, Bernardo
Format: Article
Language:English
Subjects:
Hops
Integer programming
Lot-sizing and scheduling problems
Mathematical problems
Matheuristic
Mixed integer
Mixed integer programming
Optimization algorithms
Partitions
Production planning
Production scheduling
Recognition
Scheduling
Searching
Spinning
Studies
Textile industry
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:•A new MIP model for an industrial problem arising at a spinning industry.•The synchronized lot-sizing and scheduling is approached by a new matheuristic.•A Hamming-Oriented Partition Search is the core of the matheuristic.•Variable fixing to problem partitions allows for better upper bounds.•The HOPS outperforms two commercial implementations of improvement matheuristics. 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.
ISSN:0377-2217
1872-6860
DOI:10.1016/j.ejor.2013.10.017