共 35 条
HOPS - Hamming-Oriented Partition Search production planning in the spinning industry
被引:22
作者:
Camargo, Victor C. B.
[1
,2
]
Toledo, Franklina M. B.
[2
]
Almada-Lobo, Bernardo
[1
]
机构:
[1] Univ Porto, INESC TEC, Fac Engn, P-4200465 Oporto, Portugal
[2] Univ Sao Paulo, Inst Ciencias Matemat & Computac, BR-13560970 Sao Carlos, SP, Brazil
基金:
巴西圣保罗研究基金会;
关键词:
Matheuristic;
Lot-sizing and scheduling problems;
Textile industry;
Mixed integer programming;
LOT;
SETUP;
HEURISTICS;
D O I:
10.1016/j.ejor.2013.10.017
中图分类号:
C93 [管理学];
学科分类号:
12 ;
1201 ;
1202 ;
120202 ;
摘要:
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.
引用
收藏
页码:266 / 277
页数:12
相关论文