On the complexity of the car sequencing problem.

DOI10.1016/J.ORL.2003.09.003MaRDI QIDQ703239zbMATH OpenOpenAlexFDO

Authors Tamás Kis

Publication date 11 January 2005

Published in Operations Research Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.orl.2003.09.003

zbMATH Keywords

Computational complexityAnalysis of algorithmsPseudo-polynomial algorithmsSequencing/scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Review and comparison of three methods for the solution of the car sequencing problem
• Soft car sequencing with colors: lower bounds and optimality proofs
• Large neighborhood improvements for solving car sequencing problems
• Algorithms for the car sequencing and the level scheduling problem
• Solving the car sequencing problem via branch \& bound

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Algorithms for the car sequencing and the level scheduling problem
• Constraint satisfaction using constraint logic programming
• Sequencing JIT mixed-model assembly lines under station-load and part-usage constraints

Cited in

(23)

• Iterative beam search for car sequencing
• Solving real car sequencing problems with ant colony optimization
• The maximum length car sequencing problem
• Algorithms for the car sequencing and the level scheduling problem
• Improvement of earliness and lateness by postponement on an automotive production line
• Combining two pheromone structures for solving the car sequencing problem with ant colony optimization
• Analysis and design of sequencing rules for car sequencing
• A GRASP approach for the extended car sequencing problem
• Complexity of the Project Sequencing Problem
• Robust car sequencing for automotive assembly
• Considering distribution logistics in production sequencing: problem definition and solution algorithm
• Iterated tabu search for the car sequencing problem
• Sequencing mixed-model assembly lines: survey, classification and model critique
• Large neighborhood improvements for solving car sequencing problems
• A decomposition approach for the car resequencing problem with selectivity banks
• A Lagrangian-ACO matheuristic for car sequencing
• An integer linear programming approach and a hybrid variable neighborhood search for the car sequencing problem
• The car sequencing problem: overview of state-of-the-art methods and industrial case-study of the ROADEF'2005 challenge problem
• Advanced constraint propagation for the combined car sequencing and level scheduling problem
• Instance space analysis for the car sequencing problem
• Solving the car sequencing problem via branch \& bound
• Two local search approaches for solving real-life car sequencing problems
• Genetic Algorithm with Hybrid Integer Linear Programming Crossover Operators for the Car-Sequencing Problem

This page was built for publication: On the complexity of the car sequencing problem.

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