Stronger upper and lower bounds for a hard batching problem to feed assembly lines

DOI10.1016/j.endm.2008.01.028zbMath1341.90021OpenAlexW2003104445MaRDI QIDQ3503545

Mauricio C. de Souza, Alexandre Salles da Cunha

Publication date: 5 June 2008

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2008.01.028

zbMATH Keywords

integer programmingassembly lineslot-sizing in batches

Mathematics Subject Classification ID

Integer programming (90C10) Transportation, logistics and supply chain management (90B06)

Cites Work

• Packing items to feed assembly lines
• Lot-Sizing with Constant Batches: Formulation and Valid Inequalities
• Production Planning by Mixed Integer Programming

This page was built for publication: Stronger upper and lower bounds for a hard batching problem to feed assembly lines