4.7 Article

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

Journal

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
Volume 234, Issue 1, Pages 266-277

Publisher

ELSEVIER
DOI: 10.1016/j.ejor.2013.10.017

Keywords

Matheuristic; Lot-sizing and scheduling problems; Textile industry; Mixed integer programming

Funding

  1. FAPESP [2008/09953-2, 2012/20773-1]
  2. CNPq from Brazil [300713/2010-0]
  3. CAPES from Brail [BEX-1545/11-6]
  4. FP7-PEOPLE-IRSES Project [246881]
  5. European Commission
  6. ERDF through the Programme COMPETE
  7. Portuguese Government through FCT - Foundation for Science and Technology [PTDC/EGE-GES/117692/2010]
  8. Fundação para a Ciência e a Tecnologia [PTDC/EGE-GES/117692/2010] Funding Source: FCT

Ask authors/readers for more resources

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.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available