(Enter summary)
Abstract: Car-sequencing problems have often been addressed using constraint programming techniques.
I present solutions of two open problems in this domain. First I show that the problem is NPcomplete.
Then I show that a previously open benchmark problem proposed by Smith has no
solution.
1 Introduction
The car sequencing problem is based on the problem of customising individual cars on a production
line, and goes back in the constraint programming community to [1] having previously been defined
by... (Update)
Context of citations to this paper: More
.... package 1) will look at the car sequencing problem, a problem recently shown to be NP complete via translation from Hamiltonian Path [4]. Work package 2 investigates change of representation between the job shop scheduling problem and vehicle routing, and may use two...
...i.e. Ilog solver can neither find a solution, nor prove infeasibility, on this particular instance within a reasonable amount of time. [12] proves that this instance is actually infeasible, and that any complete assignment violates at least two capacity constraints. On this...
Cited by: More
A Study of Greedy, Local Search and Ant Colony.. - Gottlieb, Puchta, Solnon
(Correct)
Constraint Satisfaction By Local Search - Bohlin (2002)
(Correct)
Solving Permutation Constraint Satisfaction Problems with.. - Solnon (2000)
(Correct)
Active bibliography (related documents): More All
0.2: Solving Constraint Satisfaction Sequencing Problems By.. - Davenport, Tsang (1999)
(Correct)
0.2: Constraint Satisfaction Using Constraint Logic Programming - Van Hentenryck, Simonis.. (1992)
(Correct)
0.2: Problem Reformulation and Search -- Part 2: Description of the.. - Of
(Correct)
Similar documents based on text: More All
0.2: On the Stupid Algorithm for Satisfiability - Ian Gent Report (1998)
(Correct)
0.2: Constraint Programming in Practice: Scheduling a Rehearsal Report - Smith (2003)
(Correct)
0.1: The Performance of Parallel Algorithmic Skeletons - Deldarie, Davy, Dew (1995)
(Correct)
Related documents from co-citation: More All
3: GENET: A connectionist architecture for solving constraint satisfaction problems..
- Davenport, Tsang et al. - 1994
3: Foundations of Constraint Satisfaction (context) - Tsang - 1993
3: A filtering algorithm for global sequencing constraints (context) - R'egin, Puget - 1997
BibTeX entry: (Update)
I.P. Gent. Two results on car sequencing problems. Technical report. Technical Report APES-02-1998. http://citeseer.ist.psu.edu/gent98two.html More
@misc{ gent98two,
author = "I. Gent",
title = "Two results on car sequencing problems",
text = "I.P. Gent. Two results on car sequencing problems. Technical report. Technical
Report APES-02-1998.",
year = "1998",
url = "citeseer.ist.psu.edu/gent98two.html" }
Citations (may not include all citations):
4212
Computers and intractability : a guide to the theory of NPco.. (context) - Garey, Johnson - 1979
951
Computational Complexity (context) - Papadimitriou - 1994
59
Solving the car-sequencing problem in constraint logic progr.. (context) - Dincbas, Simonis et al. - 1988
16
Job-shop scheduling using automated reasoning (context) - Parello, Kabat et al. - 1986
15
Heuristic solution of open bin packing problems (context) - Gent - 1998
15
A filtering algorithm for global sequencing constraints (context) - R'egin, Puget - 1997
7
Succeed-first or fail-first: A case study in variable and va..
- Smith - 1997
6
birth of an expert system (context) - Parello, the - 1988
Documents on the same site (http://www.cs.strath.ac.uk/~apes/apereports.html): More
Search in a Small World - Walsh (1998)
(Correct)
CSPlib: a benchmark library for constraints - Gent, Walsh (1999)
(Correct)
Implementation of LNS for Constrained VRPs - Kilby, Prosser, Shaw (1998)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC