Scheduling with uncertain resources Elicitation of additional data Ulaş Bardak, Eugene Fink, Chris Martens, and Jaime Carbonell Carnegie Mellon University.

Slides:



Advertisements
Similar presentations
Change-Point Detection Techniques for Piecewise Locally Stationary Time Series Michael Last National Institute of Statistical Sciences Talk for Midyear.
Advertisements

RCM-Tool v1.0 Demo Performing Welcome to the RCM-Tool RCM-Tool
Summer Internship Program Outline
Chapter 1 Business Driven Technology
Dialogue Policy Optimisation
StormingForce.com Motion. StormingForce.com StormingForce’s technology is significantly increasing productivity and quality of manual repetitive tasks.
A Prediction-based Real-time Scheduling Advisor Peter A. Dinda Carnegie Mellon University.
RADAR EVALUATION Goals, Targets, Review & Discussion Jaime Carbonell & soon Full SRI/CMU/IET RADAR Team 1-February-2005 School of Computer Science Supported.
Proactive Learning: Cost- Sensitive Active Learning with Multiple Imperfect Oracles Pinar Donmez and Jaime Carbonell Pinar Donmez and Jaime Carbonell Language.
Scheduling with uncertain resources Search for a near-optimal solution Eugene Fink, Matthew Jennings, Ulaş Bardak, Jean Oh, Stephen Smith, and Jaime Carbonell.
Project Status Chemical Engineering Lab Scheduler Team 5 This presentation will probably involve audience discussion, which will create action items. Use.
Scheduling with Uncertain Resources Reflective Agent with Distributed Adaptive Reasoning RADAR.
1 Monte-Carlo Simulation Simulation with Spreadsheets.
Machine Learning Methods for Personalized Cybersecurity Jaime G. Carbonell Eugene Fink Mehrbod Sharifi Applying machine learning and artificial intelligence.
Academic Advisor: Prof. Ronen Brafman Team Members: Ran Isenberg Mirit Markovich Noa Aharon Alon Furman.
CS 347Notes 041 CS 347: Distributed Databases and Transaction Processing Notes04: Query Optimization Hector Garcia-Molina.
Robust Mechanisms for Information Elicitation Aviv Zohar & Jeffrey S. Rosenschein The Hebrew University.
Mathematics 191 Research Seminar in Mathematical Modeling 28 March 2005 Rapid Modeling and Tractability.
Automated Changes of Problem Representation Eugene Fink LTI Retreat 2007.
1RADAR – Scheduling Task © 2003 Carnegie Mellon University RADAR – Scheduling Task May 20, 2003 Manuela Veloso, Stephen Smith, Jaime Carbonell, Brett Browning,
Academic Advisor: Prof. Ronen Brafman Team Members: Ran Isenberg Mirit Markovich Noa Aharon Alon Furman.
Personalized Cybersecurity for Dummies Jaime G. Carbonell Eugene Fink Mehrbod Sharifi Application of machine learning and crowdsourcing to adapt cybersecurity.
Preference Elicitation in Scheduling Problems Ulaş Bardak Ph.D. Thesis Proposal Committee Jaime Carbonell, Eugene Fink, Stephen Smith, Sven Koenig (University.
Scheduling with uncertain resources: Representation and utility function Ulas Bardak, Eugene Fink, and Jaime Carbonell Reflective Agent with Distributed.
ENGINEERING YOUR FUTURE
Mathematical Problem Solving Math 6320 Summer 2006.
Supply Contract Allocation Gyana R. Parija Bala Ramachandran IBM T.J. Watson Research Center INFORMS Miami 2001.
VTT-STUK assessment method for safety evaluation of safety-critical computer based systems - application in BE-SECBS project.
Project Management : Techniques and Tools (60-499) Fall 2014 / Winter 2015.
Modeling Tough Scheduling Problems with Software Alex S. Brown Mitsui Sumitomo Insurance Group, USA.
Some Sub-Activities within Requirements Engineering 1.Prototyping 2.Requirements Documentation 3.Requirements Validation 4.Requirements Measurements 5.Requirements.
Carnegie Mellon School of Computer Science Copyright © 2001, Carnegie Mellon. All Rights Reserved. JAVELIN Project Briefing 1 AQUAINT Phase I Kickoff December.
Automated Design of Multistage Mechanisms Tuomas Sandholm (Carnegie Mellon) Vincent Conitzer (Carnegie Mellon) Craig Boutilier (Toronto)
Automated Assistant for Crisis Management Reflective Agent with Distributed Adaptive Reasoning RADAR.
Modeling Tough Scheduling Problems with Software Alex S. Brown Mitsui Sumitomo Marine Management (USA), Inc.
Copyright © 2003 Primavera Systems, Inc Primavera User Conference Schedule Bingo presented by Mike Stone w/Professional Project Management Services.
FORS 8450 Advanced Forest Planning Lecture 5 Relatively Straightforward Stochastic Approach.
PAINT RAPID : Representation and Analysis of Probabilistic Intelligence Data Carnegie Mellon University DYNAM i X Technologies PI: Jaime Carbonell Eugene.
Management Information Systems, 4 th Edition 1 Three decision-making phases(p.481) –Intelligence –Design –Choice 1. The Decision-Making Process Chapter.
Effective Automatic Image Annotation Via A Coherent Language Model and Active Learning Rong Jin, Joyce Y. Chai Michigan State University Luo Si Carnegie.
April 29th, Chapter 6 Decision Making 6.1 The Nature of Management decisions 6.1 The Nature of Management decisions 6.2The decision making process.
1 RAPID: Representation and Analysis of Probabilistic Intelligence Data Carnegie Mellon University PI : Prof. Jaime G. Carbonell / / (412)
Compilers as Collaborators and Competitors of High-Level Specification Systems David Padua University of Illinois at Urbana-Champaign.
Microsoft Office Live Meeting What’s New for Attendees? Streamlined User Experience Improved Web Access Client Local PC and Server Recordings High.
RADAR May 5, RADAR /Space-Time Assistant: Crisis Allocation of Resources.
Unclassified//For Official Use Only 1 RAPID: Representation and Analysis of Probabilistic Intelligence Data Carnegie Mellon University PI : Prof. Jaime.
Analysis of Uncertain Data: Tools for Representation and Processing Bin Fu Eugene Fink Jaime G. Carbonell.
RADAR February 15, RADAR /Space-Time Learning.
Scheduling with Uncertain Resources Eugene Fink, Jaime G. Carbonell, Ulas Bardak, Alex Carpentier, Steven Gardiner, Andrew Faulring, Blaze Iliev, P. Matthew.
Analysis of Uncertain Data: Smoothing of Histograms Eugene Fink Ankur Sarin Jaime G. Carbonell
Reasoning under Uncertainty Eugene Fink LTI Seminar November 16, 2007.
Automated Assistant for Crisis Management (Reflective Agent with Distributed Adaptive Reasoning) RADAR.
Contents  Introduction  Image Collection planning system  Optimized Satellite Planning System for Multi-Satellite Operation  Optimization.
Scheduling with uncertain resources Collaboration with the user Eugene Fink, Ulaş Bardak, Brandon Rothrock, Jaime Carbonell Carnegie Mellon University.
Systems Analysis Lecture 5 Requirements Investigation and Analysis 1 BTEC HNC Systems Support Castle College 2007/8.
Uncertainty and controversy in environmental research
The Schoolyard Problem
Evaluation through user participation
The Schoolyard Problem
Role and Potential of TAs for Industrial Scheduling Problems
RADAR/Space-Time: Allocation of Rooms and Vendor Orders
Information Elicitation in Scheduling Problems
Scheduling with uncertain resources Search for a near-optimal solution
CRC Card Design A CRC Model is a collection of cards (usually standard index cards or larger) that are divided into three sections. 1. Class 2. Responsibility.
Scheduling under Uncertainty
How (not) to give a talk Barbara Jacak Stony Brook Sept. 6, 2006.
HCI Evaluation Techniques
Joint Application Development (JAD)
Issues of Scaling LAN Session 4321 SHARE 85 Pat Berastegui-Egen.
Driving Successful Projects
Presentation transcript:

Scheduling with uncertain resources Elicitation of additional data Ulaş Bardak, Eugene Fink, Chris Martens, and Jaime Carbonell Carnegie Mellon University

Problem Scheduling a conference under uncertainty Uncertain room properties Uncertain equipment needs Uncertain speaker preferences The automated scheduler needs to collaborate with the human user.

Problem The system may not have enough data for producing a good schedule The user may be able to obtain some of the missing data, but not all data The system should identify critical missing data and ask the user only for these data.

Missing info: Invited talk: – Projector need Poster session: – Room size – Projector need Assumptions: Invited talk: – Needs a projector Poster session: – Small room is OK – Needs no projector Initial schedule Available rooms: Room num. Size Proj- ector Yes No Yes Events and constraints: Invited talk, 9–10am: Needs big room Poster session, 9–11am: Needs a room Initial schedule: Talk Posters

Choice of questions Candidate questions: Invited talk: Needs a projector? Poster session: Needs a larger room? Needs a projector? Events and constraints: Invited talk, 9–10am: Needs a large room Poster session, 9–11am: Needs a room Useless info: There are no large rooms w/o a projector × Useless info: There are no unoccupied larger rooms × Potentially useful info √ Initial schedule: Talk Posters

Improved schedule Events and constraints: Invited talk, 9–10am: Needs a large room Poster session, 9–11am: Needs a room System: Does the poster session need a projector? User: A projector may be useful, but not really necessary. Posters 1 New schedule: Talk Initial schedule: Talk Posters Info elicitation:

Architecture Info elicitorParserOptimizer Process new info Update the schedule Choose questions Top-level control and learning Graphical user interface Administrator

Choice of questions For each candidate question, estimate the probabilities of possible answers For each question, compute its expected impact on the schedule quality, and select questions with large expected impacts For each possible answer, compute the respective change of the schedule quality

Experiments Scheduling of a large conference 14 available rooms 84 conference sessions 700 uncertain variables Manual Scheduling 0.61 Auto w/o Elicitation 0.68 Auto with Elicitation 0.72 Schedule Quality

Schedule Quality Number of Questions 0.50 Experiments 0 actual estimated optimal schedule

Extensions Game-tree search for the most important questions Fast heuristics for pruning unimportant questions Learning new strategies for question selection

Conclusions We have developed a system that analyzes the importance of missing data, identifies critical uncertainties, and asks the user to obtain related additional data. It usually finds a near-optimal solution after asking 2% to 6% of all potential questions. The developed technique does not rely on specific properties of scheduling tasks, and it is applicable to a variety of problems that involve optimization under uncertainty.