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

DOI10.1016/J.ENDM.2008.01.028zbMATH Open1341.90021OpenAlexW2003104445MaRDI QIDQ3503545FDOQ3503545

Authors: Alexandre Salles da Cunha, Maurício C. de Souza 

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

Recommendations

• Bounds for Assembly Line Balancing Heuristics
• An linear programming based lower bound for the simple assembly line balancing problem
• A dynamic program with fathoming and dynamic upper bounds for the assembly line balancing problem
• On the complexity of assembly line balancing problems
• Approximation Algorithms for the Assembly Line Crew Scheduling Problem
• scientific article; zbMATH DE number 4059101
• On lower and upper bounds for single machine parallel batch scheduling
• Stochastic assembly line balancing: general bounds and reliability-based branch-and-bound algorithm
• Cost-oriented assembly line balancing: model formulations, solution difficulty, upper and lower bounds

zbMATH Keywords

integer programmingassembly lineslot-sizing in batches

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (1)

• Packing items to feed assembly lines

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3503545)