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).
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
