Optimizing glass coating lines: MIP model and valid inequalities

DOI10.1016/j.ejor.2009.06.027zbMath1176.90415OpenAlexW1970451428MaRDI QIDQ1040997

Celine Gicquel, Michel Minoux, Yves Dallery, N. Miègeville

Publication date: 27 November 2009

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2009.06.027

zbMATH Keywords

integer programmingbranch and boundvalid inequalitiesglass coatingproduction line design

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Uses Software

• CPLEX

Cites Work

• Unnamed Item
• Hierarchical cellular network design with channel allocation
• A classification of assembly line balancing problems
• A versatile algorithm for assembly line balancing
• Modeling and solving a crew assignment problem in air transportation
• A survey on problems and methods in generalized assembly line balancing
• Assembly System Design: A Branch and Cut Approach
• The Complexity of Some Problems on Subsequences and Supersequences
• Harvest Scheduling Subject to Maximum Area Restrictions: Exploring Exact Approaches

This page was built for publication: Optimizing glass coating lines: MIP model and valid inequalities