Solving the car sequencing problem via branch \& bound

DOI10.1016/j.ejor.2007.04.045zbMath1156.90317OpenAlexW2076947644MaRDI QIDQ932220

Malte Fliedner, Nils Boysen

Publication date: 10 July 2008

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

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

zbMATH Keywords

mixed-model assembly linecar sequencingbranch \& bound

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Traffic problems in operations research (90B20)

Related Items (9)

A decomposition approach for the car resequencing problem with selectivity banks ⋮ The single vehicle routing problem with toll-by-weight scheme: a branch-and-bound approach ⋮ The car sequencing problem: overview of state-of-the-art methods and industrial case-study of the ROADEF'2005 challenge problem ⋮ Analysis and design of sequencing rules for car sequencing ⋮ Advanced constraint propagation for the combined car sequencing and level scheduling problem ⋮ Sequencing mixed-model assembly lines to minimize part inventory cost ⋮ Car sequencing versus mixed-model sequencing: a computational study ⋮ Sequencing mixed-model assembly lines: survey, classification and model critique ⋮ Iterative beam search for car sequencing

Cites Work

• Unnamed Item
• Unnamed Item
• On the complexity of the car sequencing problem.
• Algorithms for the car sequencing and the level scheduling problem
• Optimal level schedules in mixed-model, multi-level JIT assembly systems with pegging
• Parallel concepts in graph theory
• Sequencing in mixed model assembly lines: A genetic algorithm approach
• Scattered branch and bound. An adaptive search strategy applied to resource-constrained project scheduling
• Minimizing variation of production rates in just-in-time systems: A survey
• Solving real car sequencing problems with ant colony optimization
• A survey on problems and methods in generalized assembly line balancing
• Sequencing JIT Mixed-Model Assembly Lines Under Station-Load and Part-Usage Constraints
• Note—Sequencing JIT Mixed-Model Assembly Lines
• Review and comparison of three methods for the solution of the car sequencing problem
• Level Schedules for Mixed-Model Assembly Lines in Just-In-Time Production Systems
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• Level Schedules for Mixed-Model, Just-in-Time Processes
• Stochastic procedures for scheduling minimum job sets on mixed model assembly lines
• Sequencing jobs on an automobile assembly line: objectives and procedures
• Sequencing mixed-model assembly lines to level parts usage and minimize line length
• A mathematical model for selecting mixed models with due dates
• Mixed-Model Sequencing to Minimize Utility Work and the Risk of Conveyor Stoppage
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs

This page was built for publication: Solving the car sequencing problem via branch \& bound