A dynamic constraint solving scheme for semi on-line scheduling problems

Abstract

Most of real-life scheduling problems are semi on-line scheduling, where we do not know all the time variables of jobs in advance. Recently, solving such dynamic problems is a hot topic of research in Constraint Programming. In this paper we analyze the constraints in the semi on-line scheduling problems and introduce the concept of monotonic about constraints which appear in general dynamic constraint models. We designed a generic dynamic constraint solving algorithm for solving the scheduling problems. We give an example of its application to semi on-line discrete resource-constrained scheduling problem (ship-loading problem). © 2005 by International Federation for Information Processing.