| proposed by | Barbara Smith bms@scs.leeds.ac.uk |
B.D. Parrello, W.C. Kabat and L. Wos. Job-shop scheduling using automated reasoning: a case study of the car-sequencing problem. Journal of Automated Reasoning, 2: 1-42, 1986.
M. Dincbas, H. Simonis, and P. van Hentenryck. Solving the car-sequencing problem in constraint logic programming. In Y. Kodratoff, editor, Proceedings ECAI-88, pp. 290--295, 1988.
Two Results on Car-sequencing Problems. Ian Gent. APES Report APES-02-1998: April 1998. Available from http://www.dcs.st-and.ac.uk/~apes/apesreports.html.
P. van Hentenryck, H. Simonis, and M. Dincbas. Constraint Satisfaction using Constraint Logic Programming. Artificial Intelligence, 58:113--159, 1992.
Succeed-first or Fail-first: A Case Study in Variable and Value Ordering Heuristics . Barbara Smith, Research Report 96.26, September 1996. (Presented at the ILOG Solver and ILOG Schedule 2nd International Users' Conference, Paris, July 1996. Also in the Proceedings of PACT'97, Third International Conference on the Practical Applications of Constraint Technology, pp. 321-330, 1997)
J.-C. Regin and J.-F. Puget. A Filtering Algorithm for Global Sequencing Constraints. In G. Smolka, editor, Principles and Practice of Constraint Programming - CP97, LNCS 1330, pp. 32--46. Springer-Verlag, 1997.
Extending GENET for non-binary CSP's. J.H.M. Lee, H.F. Leung, and H.W. Won, Seventh IEEE International Conference on Tools with Artificial Intelligence, IEEE Computer Society Press, p.338-343, Washington D.C., USA, November, 1995.
Performance of a Comprehensive and Efficient Constraint Library using Local Search . J.H.M. Lee, H.F. Leung, and H.W. Won, 11th Australian Joint Conference on Artificial Intelligence, Springer-Verlag, LNAI, Brisbane, Australia, July, 1998
C. Solnon. Solving Permutation Constraint Satisfaction Problems with Artificial Ants. In Proceedings of 14th European Conference on Artificial Intelligence (ECAI 2000), 118 - 122, IOS Press, 2000
J. Gottlieb, M. Puchta, and C. Solnon. A Study of Greedy, Local Search and Ant Colony Optimization Approaches for Car Sequencing Problems. In G.R. Raidl et al. (eds.), Applications of Evolutionary Computing, Lecture Notes in Computer Science, Volume 2611, 246 - 257, Springer, 2003
S. Boivin. Resolution of a Constraints Satisfaction Problem for the Scheduling of Car-Sequencing Production. Masters thesis, Universite du Quebc a Chicoutimi, 2004. Joint work with Marc Gravel and Caroline Gagne.
Gravel M., Gagné C., Price W.L., (2004), Review and comparison of three methods for the solution of the car sequencing problem, Journal of the Operational Research Society.
A program to solve the car sequencing problem is included as a demonstration program with ILOG Solver and is described in the User Manual. The program requires a slightly different format than given here, since the options file is included with the car data.