Category Archives: benchmark

Car Sequencing

Henry Ford is often quoted as saying: “Any customer can have a car painted any colour that he wants so long as it is black.” In the early years of using assembly lines for his model T, uniformity of product … Continue reading

Posted in 1988, 29 Manufacture of vehicles and trailers, 29.1 Manufacture of motor vehicles, benchmark, C Manufacturing, CHIP, ECAI, Scheduling | Leave a comment

Progressive Party

This is a benchmark problem which was introduced in 1995 by Brailsford, S., Hubbard, P., Smith, B., Williams, H.: Organizing a social event – a difficult problem of combinatorial optimization. Computers Ops Res 23 (1996) 845–856. The problem is to … Continue reading

Posted in 2009, benchmark, CP-AI-OR, ECLiPSe, Personnel | 3 Comments

Packing Squares into Rectangles

This is is a benchmark problem suggested by Richard Korf. The task is to pack all squares of sizes 1×1 to NxN into the smallest possible rectangle, i.e. into a rectangle with minimal surface. As the problem size increases, this … Continue reading

Posted in 2008, benchmark, CP Conference, Other, puzzle, SICStus Prolog | 3 Comments

Routing and Wavelength Assignment

This is an application from the network design and management domain. In an optical network, traffic demands between nodes are satisfied by finding colored paths from a source to a destination. The number of colors available on each link is … Continue reading

Posted in 2009, 61 Telecommunications, 61.1 Wired Telecommunnications, benchmark, CP Conference, ECLiPSe, J Information and Communications, Network | Leave a comment