Abstract
Abstract In this paper we present an Integer Programming reformulation for a hard batching problem encountered in feeding assembly lines. The study was motivated by the real process to feed the production flow through the shop floor in a leading automobile industry in Brazil. The problem consists of deciding the assignment of items to containers and the frequency of moves from the storage area to the line in order to meet demands with minimum cost. Better lower and upper bounds were obtained by a branch-and-bound algorithm based on the proposed reformulation. We also present valid inequalities that may improve such algorithm even further.
Full Text
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call