Given a graph G = (V, E) and positive integral vertex weights w : V → N, the max-coloring problem seeks to find a proper vertex coloring of G whose color classes C1, C2, . . . ,...
Dynamic programming, branch-and-bound, and constraint programming are the standard solution principles for nding optimal solutions to machine scheduling problems. We propose a new ...
One challenge for research in constraint-based scheduling has been to produce scalable solution procedures under fairly general representational assumptions. Quite often, the comp...
This review paper presents an overview of the current state of the art in Problem Solving Environments (PSE). PSE provides integrated human-friendly innovative computational servi...
In this paper we study the human eye movement and the head movement system as a simple mechanical control system. Most of the time, eye movements obey Listing's constraint, wh...