A column generation approach and new bounds for the car sequencing problem

DOI10.1007/s10479-017-2663-4zbMath1390.90466OpenAlexW2764248603MaRDI QIDQ1639282

Roberto Asín Achá, Eivind Jahren

Publication date: 12 June 2018

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-017-2663-4

zbMATH Keywords

column generationcombinatorial optimizationinteger linear programmingindustrial car sequencing

Mathematics Subject Classification ID

Integer programming (90C10) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Related Items (1)

An efficient model-based branch-and-price algorithm for unrelated-parallel machine batching and scheduling problems

Cites Work

• Unnamed Item
• The car sequencing problem: overview of state-of-the-art methods and industrial case-study of the ROADEF'2005 challenge problem
• Two local search approaches for solving real-life car sequencing problems
• Soft car sequencing with colors: lower bounds and optimality proofs
• Greedy approach and multi-criteria simulated annealing for the car sequencing problem
• An integer linear programming approach and a hybrid variable neighborhood search for the car sequencing problem
• Branch-and-Price: Column Generation for Solving Huge Integer Programs
• A Linear Programming Approach to the Cutting-Stock Problem
• Adaptive Restart Strategies for Conflict Driven SAT Solvers

This page was built for publication: A column generation approach and new bounds for the car sequencing problem