Carnegie Mellon ICAPS-07 22-Sept, 2007 Benchmark Problems for Oversubscribed Scheduling Laura V. Barbulescu and Laurence A. Kramer and Stephen F. Smith.

Slides:

Advertisements

Similar presentations

Operations Scheduling

Advertisements

Hadi Goudarzi and Massoud Pedram

Biased Random Key Genetic Algorithm with Hybrid Decoding for Multi-objective Optimization Panwadee Tangpattanakul, Nicolas Jozefowiez, Pierre Lopez LAAS-CNRS.

Using Parallel Genetic Algorithm in a Predictive Job Scheduling

Solutions for Scheduling Assays. Why do we use laboratory automation? Improve quality control (QC) Free resources Reduce sa fety risks Automatic data.

A Simple Distribution- Free Approach to the Max k-Armed Bandit Problem Matthew Streeter and Stephen Smith Carnegie Mellon University.

Meta-Level Control in Multi-Agent Systems Anita Raja and Victor Lesser Department of Computer Science University of Massachusetts Amherst, MA

The Who, What, Why and How of High Performance Computing Applications in the Cloud Soheila Abrishami 1.

Xiaofei Xu School of Computer Science and Technology Harbin Institute of Technology Model and Problem Generation Tool of Project Scheduling.

Mixed-Initiative Planning Yolanda Gil USC CS 541 Fall 2003.

Modelling the Aerospace Aftermarket with Multi-agents Systems Ken Woghiren Technical Director - Lost Wax.

DESIGN OF A GENERIC PATH PATH PLANNING SYSTEM AILAB Path Planning Workgroup.

Parallelized Evolution System Onur Soysal, Erkin Bahçeci Erol Şahin Dept. of Computer Engineering Middle East Technical University.

Case Injected Genetic Algorithms Sushil J. Louis Genetic Algorithm Systems Lab (gaslab) University of Nevada, Reno

A Heuristic Bidding Strategy for Multiple Heterogeneous Auctions Patricia Anthony & Nicholas R. Jennings Dept. of Electronics and Computer Science University.

Case Injected Genetic Algorithms Sushil J. Louis Genetic Algorithm Systems Lab (gaslab) University of Nevada, Reno

1 An Evolutionary Algorithm for Query Optimization in Database Kayvan Asghari, Ali Safari Mamaghani Mohammad Reza Meybodi International Joint Conferences.

Heuristics for the MTTPROADEF, February /49 Heuristics for the Mirrored Traveling Tournament Problem Celso C. RIBEIRO Sebastián URRUTIA.

Structure and Phase Transition Phenomena in the VTC Problem C. P. Gomes, H. Kautz, B. Selman R. Bejar, and I. Vetsikas IISI Cornell University University.

Multirobot Coordination in USAR Katia Sycara The Robotics Institute

Online Learning for Web Query Generation: Finding Documents Matching a Minority Concept on the Web Rayid Ghani Accenture Technology Labs, USA Rosie Jones.

Impact of Problem Centralization on Distributed Constraint Optimization Algorithms John P. Davin and Pragnesh Jay Modi Carnegie Mellon University School.

WASP-LIKE AGENTS FOR DISTRIBUTED FACTORY COORDINATION Vincent A. Cicirello, Stephen F. Smith December 2001

Tabu Search-Based Synthesis of Dynamically Reconfigurable Digital Microfluidic Biochips Elena Maftei, Paul Pop, Jan Madsen Technical University of Denmark.

Policy Generation for Continuous-time Stochastic Domains with Concurrency Håkan L. S. YounesReid G. Simmons Carnegie Mellon University.

Particle Swarm Optimization Algorithms

Platzhalter für Bild, Bild auf Titelfolie hinter das Logo einsetzen Ann Melissa Campbell, Jan Fabian Ehmke 2013 Service Management and Science Forum Decision.

Controlling and Configuring Large UAV Teams Paul Scerri, Yang Xu, Jumpol Polvichai, Katia Sycara and Mike Lewis Carnegie Mellon University and University.

Cristian Urs and Ben Riveira. Introduction The article we chose focuses on improving the performance of Genetic Algorithms by: Use of predictive models.

Distributed Network Scheduling Bradley J. Clement, Steven R. Schaffer Jet Propulsion Laboratory, California Institute of Technology Contact:

ROBUST RESOURCE ALLOCATION OF DAGS IN A HETEROGENEOUS MULTI-CORE SYSTEM Luis Diego Briceño, Jay Smith, H. J. Siegel, Anthony A. Maciejewski, Paul Maxwell,

Introduction to Job Shop Scheduling Problem Qianjun Xu Oct. 30, 2001.

June 21, 2007 Minimum Interference Channel Assignment in Multi-Radio Wireless Mesh Networks Anand Prabhu Subramanian, Himanshu Gupta.

ANTs PI Meeting, Nov. 29, 2000W. Zhang, Washington University1 Flexible Methods for Multi-agent distributed resource Allocation by Exploiting Phase Transitions.

1 Maintaining Logical and Temporal Consistency in RT Embedded Database Systems Krithi Ramamritham.

임규찬. 1. Abstract 2. Introduction 3. Design Goals 4. Sample-Based Scheduling for Parallel Jobs 5. Implements.

A Survey of Distributed Task Schedulers Kei Takahashi (M1)

The Deep Space Network Scheduling Problem Brad Clement, Mark Johnston Artificial Intelligence Group Jet Propulsion Laboratory California Institute of Technology.

Automated Assistant for Crisis Management Reflective Agent with Distributed Adaptive Reasoning RADAR.

Design of an Evolutionary Algorithm M&F, ch. 7 why I like this textbook and what I don’t like about it!

Carnegie Mellon Interactive Resource Management in the COMIREM Planner Stephen F. Smith, David Hildum, David Crimm Intelligent Coordination and Logistics.

GENETIC ALGORITHM A biologically inspired model of intelligence and the principles of biological evolution are applied to find solutions to difficult problems.

Carnegie Mellon SMU/SIM-TECH Workshop on Trends in P/S – Sept 11, 2008 Constraint-Based Scheduling Adapted from slides by Stephen F. Smith.

1 S ystems Analysis Laboratory Helsinki University of Technology Flight Time Allocation Using Reinforcement Learning Ville Mattila and Kai Virtanen Systems.

Resource Mapping and Scheduling for Heterogeneous Network Processor Systems Liang Yang, Tushar Gohad, Pavel Ghosh, Devesh Sinha, Arunabha Sen and Andrea.

Space Operations as a Guide for a Real-World Scheduling Competition Eduardo Romero Marcelo Oglietti

SPHERES Reconfigurable Control Allocation for Autonomous Assembly Swati Mohan, David W. Miller MIT Space Systems Laboratory AIAA Guidance, Navigation,

Evolving the goal priorities of autonomous agents Adam Campbell* Advisor: Dr. Annie S. Wu* Collaborator: Dr. Randall Shumaker** School of Electrical Engineering.

A Generalized Version Space Learning Algorithm for Noisy and Uncertain Data T.-P. Hong, S.-S. Tseng IEEE Transactions on Knowledge and Data Engineering,

Intelligent controller design based on gain and phase margin specifications Daniel Czarkowski  and Tom O’Mahony* Advanced Control Group, Department of.

EE749 I ntroduction to Artificial I ntelligence Genetic Algorithms The Simple GA.

The Role of Decision Support Systems in Natural Resource Management: Overview of the Ecosystem Management Decision Support Framework Kevin James, Heartland.

Stochastic greedy local search Chapter 7 ICS-275 Spring 2009.

Franciszek Seredynski, Damian Kurdej Polish Academy of Sciences and Polish-Japanese Institute of Information Technology APPLYING LEARNING CLASSIFIER SYSTEMS.

ADASS the Planning and Scheduling Perspective Roadmap: - How planning and scheduling fits in at ADASS - ADASS planning and scheduling posters and presentations.

Content caching and scheduling in wireless networks with elastic and inelastic traffic Group-VI 09CS CS CS30020 Performance Modelling in Computer.

MSc in High Performance Computing Computational Chemistry Module Parallel Molecular Dynamics (i) Bill Smith CCLRC Daresbury Laboratory

The struggle for respect in a Planning Centric World… Stephen Smith Carnegie Mellon University.

Search Control.. Planning is really really hard –Theoretically, practically But people seem ok at it What to do…. –Abstraction –Find “easy” classes of.

Shortcomings of Traditional Backtrack Search on Large, Tight CSPs: A Real-world Example Venkata Praveen Guddeti and Berthe Y. Choueiry The combination.

Algorithmic and Domain Centralization in Distributed Constraint Optimization Problems John P. Davin Carnegie Mellon University June 27, 2005 Committee:

Distributed Control and Autonomous Systems Lab. Sang-Hyuk Yun and Hyo-Sung Ahn Distributed Control and Autonomous Systems Laboratory (DCASL ) Department.

Resource Optimization for Publisher/Subscriber-based Avionics Systems Institute for Software Integrated Systems Vanderbilt University Nashville, Tennessee.

Organizing and Analyzing Logistics Systems

Local Container Truck Routing Problem with its Operational Flexibility Kyungsoo Jeong, Ph.D. Candidate University of California, Irvine Local container.

Fault and Energy Aware Communication Mapping with Guaranteed Latency for Applications Implemented on NoC Sorin Manolache, Petru Eles, Zebo Peng {sorma,

VDL Mode 4 Performance Simulator (DLS enhancements) presented by EUROCONTROL Montreal, 26 October 2004.

Dynamic Management of Food Redistribution for 412 Food Rescue

Case Injected Genetic Algorithms

VDL Mode 4 Performance Simulator (DLS enhancements) presented by EUROCONTROL Montreal, 26 October 2004.

Presentation transcript:

Carnegie Mellon ICAPS Sept, 2007 Benchmark Problems for Oversubscribed Scheduling Laura V. Barbulescu and Laurence A. Kramer and Stephen F. Smith Intelligent Coordination and Logistics Laboratory The Robotics Institute Carnegie Mellon University Pittsburgh PA

Carnegie Mellon ICAPS Sept, 2007 Competition Benchmark Problems The problems should abstract features that are present in real world domains. The real world domains should be representative of the challenges faced by human schedulers.

Carnegie Mellon ICAPS Sept, 2007 Generalizing from a Set of Scheduling Applications Evaluation of different approaches in the expanded context of multiple applications. Issues: Identifying similar applications. Synthesizing their common features. Imposing application specific features to produce instances for that application.

Carnegie Mellon ICAPS Sept, 2007 Oversubscribed Problems Oversubscribed scheduling problems are characterized by the inability to accommodate all tasks given available resources.

Carnegie Mellon ICAPS Sept, 2007 Why Oversubscribed Scheduling Problems? Present in many real world domains. Challenging problems - identifying the best subset of tasks that can be scheduled is difficult. Many oversubscribed real-world scheduling applications exhibit similar characteristics and can be modeled as a more abstract problem class.

Carnegie Mellon ICAPS Sept, 2007 Our Oversubscribed Scheduling Benchmark Set We identify 2 oversubscribed scheduling applications that share similar characteristics: AFSCN and AMC scheduling. We implement a problem generator to produce a more general class of problems. Generator parameter values control the characteristics of the instances.

Carnegie Mellon ICAPS Sept, 2007 Motivation: A Tale of Two Studies * Barbulescu et al., (’04,’06) CSU studies AFSCN* CMU studies AMC** Repair-based methods perform poorly; GA, SWO well. Repair-based TaskSwap very efficient and effective. ** Kramer & Smith, (’04,’05) AFSCN + AMC Problem Fusion Teams at Carnegie Mellon and Colorado State have been studying different oversubscribed scheduling domains.

Carnegie Mellon ICAPS Sept, 2007 Basic (AMC) Airlift Allocation Problem A B C W1 W2 Mission 1 : pick up cargo at A, deliver to B, then C. Decisions: Use resources (e.g., aircraft) from wing W1 or W2? Start at what time? Mission 2 … Mission n (Missions considered in strict priority order) Requests :

Carnegie Mellon ICAPS Sept, 2007 Air Force Satellite Control Network (AFSCN) Access Scheduling GS1 GS2 Request 1 : Download data from satellite 1 to ground-station 1 in time window W. Decisions: Use resource (an antenna) from which ground station? Schedule at what time in the window? Request 2 … Request-n Input :

Carnegie Mellon ICAPS Sept, 2007 Exploring the AFSCN/AMC Problem Space Despite obvious domain differences, the two applications share a common core problem structure: Required duration per task. Multi-capacity resources. Alternative resources. Fixed duration time windows. Basic objective of minimizing number of unassigned tasks.

Carnegie Mellon ICAPS Sept, 2007 Differences between AFSCN and AMC Domains are mainly of degree... except that of task priority. AFSCNAMC Hard Priority Constraint?NoYes Number of Tasks Resource Capacity Average Temporal Flexibility (task duration/window size) ( ) 0.50

Carnegie Mellon ICAPS Sept, 2007 A Problem Set to Span the AFSCN/AMC Problem Space We design a unified problem set to span the characteristics of the AFSCN and AMC domains. Initial problem set: five recent real-world AFSCN problems, R1-R5. We generate 50 new AFSCN-like problems: We vary the placement of each task’s time window. For each instance in the R1-R5 set, we generate 10 new instances.

Carnegie Mellon ICAPS Sept, 2007 A Problem Set to Span the AFSCN/AMC Problem Space (cont.) Starting with the 50 AFSCN-like instances, we generate new instances by varying: Problem size – same as the AFSCN instances, double or triple: For larger problems, we generate 1 or 2 new tasks for each task, by randomly moving the time window later in time Temporal flexibility (task slack) Increasing the slack by shortening the duration Resource Capacity (resource slack) Increasing the capacity (using a random factor) Priority (on/off) Task priorities randomly sampled between 1 and 5 (priority classes in AMC)

Carnegie Mellon ICAPS Sept, 2007 The Generated Problems (50 instances per problem set) Problem SetAverage SizeSlack dfCapacity cfpf = falsepf = true Avg. Unassignable Tasks, Initial Schedule

Carnegie Mellon ICAPS Sept, 2007 Summary 1.Oversubscribed scheduling applications represent an important, practical class of problems and should be considered for inclusion in a scheduling competition. 2.Effective approach to generate test problems: abstract and consolidate common features from multiple domains.

Carnegie Mellon ICAPS Sept, 2007 References Barbulescu, L. and Howe, A. E. and Watson, J. P. and Whitley, L. D Satellite Range Scheduling: A Comparison of Genetic, Heuristic and Local Search. In Proceedings of The Seventh International Conference on Parallel Problem Solving from Nature(PPSNVII). Barbulescu, L. and Watson, J. P. and Whitley, L. D. and Howe, A. E Scheduling Space-Ground Communications for the Air Force Satellite Control Network. Journal of Scheduling. Barbulescu, L.; Howe, A. E.; and Whitley, L Leap before you look: An effective strategy in an oversubscribed scheduling problem. In Proc. 19th National Conference on Artificial Intelligence (AAAI- 04). Barbulescu, L. and Howe, A. E. and Whitley, L.D. and Roberts, M Trading Places: How to Schedule More in a Multi-Resource Oversubscribed Scheduling Problem. In Proc. 14th International Conference on Automated Planning and Scheduling. Barbulescu, L.; Howe, A.; Whitley, L.; and Roberts, M Understanding algorithm performance on an oversubscribed scheduling application. JAIR 27:577–615. Cicirello, V., and Smith, S Amplification of search performance through randomization of heuristics. In Proc. 8th Int. Conf. on Principles and Practice of Constraint Programming. Ithaca NY: Springer-Verlag. Kramer, L., and Smith, S Maximizing flexibility: A retraction heuristic for oversubscribed scheduling problems. In Proceedings 18th International Joint Conference on Artificial Intelligence. Kramer, L. A., and Smith, S. F Task swapping for schedule improvement, a broader analysis. In Proc. 14 th Int’l Conf. on Automated Planning and Scheduling. Kramer, L. A., and Smith, S. F. 2005a. The amc scheduling problem: A description for reproducibility. Technical Report CMU-RI-TR-05-75, Robotics Institute, Carnegie Mellon University. Kramer, L. A., and Smith, S. F. 2005b. Maximizing availability: A commitment heuristic for oversubscribed scheduling problems. In Proc. 15th International Conference on Automated Planning and Scheduling (ICAPS-05).