Constraint based scheduling

Slides:



Advertisements
Similar presentations
Forward-Chaining Partial-Order Planning Amanda Coles, Andrew Coles, Maria Fox and Derek Long (to appear, ICAPS 2010)
Advertisements

1-1 Constraint-based Scheduling Claude Le Pape. 1-2 Outline Introduction Scheduling constraints Non-preemptive scheduling –Temporal constraints –Resource.
REAL TIME SYSTEM Scheduling.
5-1 Problem-Solving Examples (Non-Preemptive Case)
Greta YorshEran YahavMartin Vechev IBM Research. { ……………… …… …………………. ……………………. ………………………… } P1() Challenge: Correct and Efficient Synchronization { ……………………………
Greta YorshEran YahavMartin Vechev IBM Research. { ……………… …… …………………. ……………………. ………………………… } T1() Challenge: Correct and Efficient Synchronization { ……………………………
Interactive Configuration
1 Chapter 8: Modelling with Finite Domain Constraints Where we examine how modelling and controlling search interact with finite domain constraints.
CPE555A: Real-Time Embedded Systems
Knapsack Problem: Greedy vs. Brute Force pp (Section 7.6)
Contents College 4 §4.1, §4.2, §4.4, §4.6 Extra literature on resource constrained project scheduling (will be handed out)
Lecture 10: Integer Programming & Branch-and-Bound
1 Swiss Federal Institute of Technology Computer Engineering and Networks Laboratory Embedded Systems Exercise 2: Scheduling Real-Time Aperiodic Tasks.
6-1 Temporal Constraint Propagation (Preemptive Case)
2-1 Scheduling Constraints. 2-2 Outline Activities Temporal constraints Resources Resource constraints (mono-activity) Resource constraints (two activities)
9-1 Applications. 9-2 Outline Moulding shop scheduling (MSS) Construction site scheduling (CSS)
 Resource Constraint Propagation (Preemptive Case)
Ant Colony Optimization Chapter 5 Ant Colony Optimization for NP- Hard Problems Ben Sauskojus.
 Resource Constraint Propagation (Non-Preemptive Case)
 Temporal Constraint Propagation (Non-Preemptive Case)
8-1 Problem-Solving Examples (Preemptive Case). 8-2 Outline Preemptive job-shop scheduling problem (P-JSSP) –Problem definition –Basic search procedure.
Stochastic greedy local search Chapter 7 ICS-275 Spring 2007.
On the Task Assignment Problem : Two New Efficient Heuristic Algorithms.
Iterative Flattening in Cumulative Scheduling. Cumulative Scheduling Problem Set of Jobs Each job consists of a sequence of activities Each activity has.
PLANNING Partial order regression planning Temporal representation 1 Deductive planning in Logic Temporal representation 2.
Jobshop scheduling. We have a set of resources a set of jobs a job is a sequence of operations/activities sequence the activities on the resources.
Computer Science CPSC 322 Lecture 13 Arc Consistency (4.5, 4.6 ) Slide 1.
Generating RCPSP instances with Known Optimal Solutions José Coelho Generator and generated instances in:
Constraint Satisfaction CPSC 386 Artificial Intelligence Ellen Walker Hiram College.
LDK R Logics for Data and Knowledge Representation Propositional Logic: Reasoning First version by Alessandro Agostini and Fausto Giunchiglia Second version.
RTOS task scheduling models
Chapter 5 Constraint Satisfaction Problems
Roman Barták Visopt B.V. (NL) / Charles University (CZ) IP&S in complex and dynamic areas Visopt Experience.
Principles of Intelligent Systems Constraint Satisfaction + Local Search Written by Dr John Thornton School of IT, Griffith University Gold Coast.
CONSTRAINT-BASED SCHEDULING AND PLANNING Speaker: Olufikayo Adetunji CSCE 921 4/08/2013Olufikayo Adetunji 1 Authors: Philippe Baptiste, Philippe Laborie,
Stochastic greedy local search Chapter 7 ICS-275 Spring 2009.
Maintaining Arc Consistency (MAC) MAC is the same as Back-tracking, but with calls to AC-3 interleaved... function Backtracking-Search(csp) returns.
CS182 Intelligent Machines: Reasoning, Actions and Plans Section 4.
Using Constructive Search in Resource Scheduling By Andrei Missine.
Heuristics with Mad queens and example from jssp.
Dynamic Backtracking Explained (clearly) Presented by Phil Oertel.
Resource-Constrained Project Scheduling Problem (RCPSP)
ARTIFICIAL INTELLIGENCE (CS 461D) Dr. Abeer Mahmoud Computer science Department Princess Nora University Faculty of Computer & Information Systems.
Embedded System Scheduling
Jobshop scheduling.
Scheduling with Constraint Programming
Dynamic Constraint Models for Complex Production Environments
Dynamic Graph Partitioning Algorithm
Constraint Satisfaction Problems Lecture # 14, 15 & 16
EEE 6494 Embedded Systems Design
Computer Science cpsc322, Lecture 14
Chapter 10: Algorithm Design Techniques
Computer Science cpsc322, Lecture 14
4. Properties of Regular Languages
Modeling Scheduling Problems
Lecture 19 CSE 331 Oct 12, 2016.
Hierarchical Search on DisCSPs
Lecture 19 CSE 331 Oct 8, 2014.
Lecture 18 CSE 331 Oct 9, 2017.
Constraint satisfaction problems
Artificial Intelligence
Hierarchical Search on DisCSPs
Sudoku.
Richard Anderson Winter 2019 Lecture 7
Constraint Satisfaction
Presented by: Amira Gamaleldin Marlien Edward Mounir Stino
Lecture 19 CSE 331 Oct 10, 2016.
Chapter 1. Formulations.
Implementation of Learning Systems
Constraint satisfaction problems
Presentation transcript:

Constraint based scheduling Paper by: Claude Le Pape Presented by: Mounir Stino

What is a scheduling problem? Input: A set of resources with given capacities. A set of activities with given processing time and resource requirements. A set of temporal constraints between activities. Output: To decide when to execute each activity. An instance of the CSP problem.

Types of scheduling problems Disjunctive vs. cumulative scheduling Non-preemptive vs. preemptive scheduling Our problem is a disjunctive non-preemptive problem, the most specific case.

Representation of constraints Constraints of activities: Two variables associated to each activity A: Start(A) and End(A).

Representation of constraints(2) Temporal constraints: Start(A) + Delay(A) < Start(B). Resource constraints: If A and B require the same resource, then A and B cannot intersect

Example: Resource-Constrained Project Scheduling Problem (RCPSP) Given: m resources R1 ... Rm with given capacities c1...cm n activities A1 ... An with given durations d1 ... dn precedence constraints between activities Task: Assign start and end date to all activities satisfying the constraints and minimizing the total duration.

Search procedure Initialize the set of selectable activities W to the complete set. If all activities have fixed start and end times, exit. Otherwise remove from W those activities which have fixed start and end times. If W is not empty, select an activity from W, create a choice point for the selected activity (to allow backtracking) and schedule the selected activity from its earliest start time to its earliest end time. If W is empty, backtrack to the most recent choice point. (If there is no choice point left, report that there is no problem solution and exit.) Upon backtracking, mark the backtracked activity as not selectable as long as its earliest start and end times have not changed. Then goto step 2.

Conclusion The paper tries to cover general scheduling problems. A lot of sections about interruptible activities, cumulative resources, state resources and energetic resources were not covered in this presentation. Not very relevant to our project.