On the complexity of the car sequencing problem

Research output: Contribution to journalArticle

64 Citations (Scopus)


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.

Original languageEnglish
Pages (from-to)331-335
Number of pages5
JournalOperations Research Letters
Issue number4
Publication statusPublished - Jul 1 2004



  • Analysis of algorithms
  • Computational complexity
  • Pseudo-polynomial algorithms
  • Sequencing/scheduling

ASJC Scopus subject areas

  • Software
  • Management Science and Operations Research
  • Industrial and Manufacturing Engineering
  • Applied Mathematics

Cite this