Journal
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
Volume 55, Issue 21, Pages 6288-6304Publisher
TAYLOR & FRANCIS LTD
DOI: 10.1080/00207543.2017.1341065
Keywords
bin packing; assembly line balancing; generalised precedence constraints; iterated local search; batching moves
Categories
Funding
- Conselho Nacional de Desenvolvimento Cientifico e Tecnologico (CNPq/Brazil) [GDE 201222/2014-0]
- Coordenacao de Aperfeicoamento de Pessoal de Nivel Superior (CAPES/Brazil) [A007/2013]
Ask authors/readers for more resources
In this paper, we propose a generalisation of the bin packing problem, obtained by adding precedences between items that can assume heterogeneous non-negative integer values. Such generalisation also models the well-known Simple Assembly Line Balancing Problem of type I. To solve the problem, we propose a simple and effective iterated local search algorithm that integrates in an innovative way of constructive procedures and neighbourhood structures to guide the search to local optimal solutions. Moreover, we apply some preprocessing procedures and adapt classical lower bounds from the literature. Extensive computational experiments on benchmark instances suggest that the developed algorithm is able to generate good quality solutions in a reasonable computational time.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available