On the complexity of the car sequencing problem

Authors:
TamáS Kis
Affiliations:
Computer and Automation Research Institute, Hungarian Academy of Sciences, Kende Utca 13-17, Budapest H-1111, Hungary
Venue:
Operations Research Letters
Year:
2004

Citing 4
Cited 9

Job-shop scheduling using automated reasoning: a case study of the car-sequencing problem

Journal of Automated Reasoning
Constraint satisfaction using constraint logic programming

Artificial Intelligence - Special volume on constraint-based reasoning
Sequencing JIT Mixed-Model Assembly Lines Under Station-Load and Part-Usage Constraints

Management Science
Algorithms for the car sequencing and the level scheduling problem

Journal of Scheduling

Algorithms for the car sequencing and the level scheduling problem

Journal of Scheduling
A GRASP approach for the extended car sequencing problem

Journal of Scheduling
Integration of ACO in a Constraint Programming Language

ANTS '08 Proceedings of the 6th international conference on Ant Colony Optimization and Swarm Intelligence
The search for the optimal number of kanbans in unstable assembly-tree layout systems under intensive loading conditions

International Journal of Computer Integrated Manufacturing - THE CHALLENGES OF MANUFACTURING IN THE GLOBALLY INTEGRATED ECONOMY. GUEST EDITOR: ROBIN G. QIU
Crossover operators for the car sequencing problem

EvoCOP'07 Proceedings of the 7th European conference on Evolutionary computation in combinatorial optimization
CONFIIT: a middleware for peer-to-peer computing

The Journal of Supercomputing
Car sequencing with constraint-based ACO

Proceedings of the 13th annual conference on Genetic and evolutionary computation
A decomposition approach for the car resequencing problem with selectivity banks

Computers and Operations Research
Key performance indicators for the evaluation of balanced lines

Proceedings of the Winter Simulation Conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this note we give an easier proof of the known result that the car sequencing problem is NP-hard, and point out that it is NP-hard in the strong sense. We show that a previous claim of NP-completeness is incorrect, and instead we give a sufficient condition of membership of NP. We also provide a pseudo-polynomial algorithm for a special case.