+ PRODUCTION SCHEDULING Medical analysis on an automated machine Sophie Debrade sd2829 Alexandre Philippe Ayache apa2117 Pierre Castaing pc2613.

Slides:



Advertisements
Similar presentations
Impact of Interference on Multi-hop Wireless Network Performance
Advertisements

On the Complexity of Scheduling
Optimal Bus Sequencing for Escape Routing in Dense PCBs H.Kong, T.Yan, M.D.F.Wong and M.M.Ozdal Department of ECE, University of Illinois at U-C ICCAD.
Covers, Dominations, Independent Sets and Matchings AmirHossein Bayegan Amirkabir University of Technology.
1 LP Duality Lecture 13: Feb Min-Max Theorems In bipartite graph, Maximum matching = Minimum Vertex Cover In every graph, Maximum Flow = Minimum.
1 EE5900 Advanced Embedded System For Smart Infrastructure RMS and EDF Scheduling.
CS1104: Computer Organisation School of Computing National University of Singapore.
0 Synchronization Problem Resource sharing –Requires mutual exclusion –Critical section A code section that should be executed mutually exclusively by.
CHAPTER 2 PROCESSOR SCHEDULING PART I By U ğ ur HALICI.
1 IOE/MFG 543 Chapter 8: Open shops Section 8.1 (you may skip Sections 8.2 – 8.5)
Harini Ramaprasad, Frank Mueller North Carolina State University Center for Embedded Systems Research Tightening the Bounds on Feasible Preemption Points.
CALTECH CS137 Winter DeHon CS137: Electronic Design Automation Day 14: March 3, 2004 Scheduling Heuristics and Approximation.
Solutions for Scheduling Assays. Why do we use laboratory automation? Improve quality control (QC) Free resources Reduce sa fety risks Automatic data.
Operations Scheduling
Operations Scheduling
Online Scheduling with Known Arrival Times Nicholas G Hall (Ohio State University) Marc E Posner (Ohio State University) Chris N Potts (University of Southampton)
Bicriteria Approximation Tradeoff for the Node-Cost Budget Problem Yuval Rabani (Technion) Gabriel Scalosub (Tel Aviv University)
Lecture 10: Integer Programming & Branch-and-Bound
Online Social Networks and Media. Graph partitioning The general problem – Input: a graph G=(V,E) edge (u,v) denotes similarity between u and v weighted.
1 An Asymptotically Optimal Algorithm for the Max k-Armed Bandit Problem Matthew Streeter & Stephen Smith Carnegie Mellon University NESCAI, April
Online Algorithms Motivation and Definitions Paging Problem Competitive Analysis Online Load Balancing.
EDA (CS286.5b) Day 11 Scheduling (List, Force, Approximation) N.B. no class Thursday (FPGA) …
Job Scheduling Lecture 19: March 19. Job Scheduling: Unrelated Multiple Machines There are n jobs, each job has: a processing time p(i,j) (the time to.
8-1 Problem-Solving Examples (Preemptive Case). 8-2 Outline Preemptive job-shop scheduling problem (P-JSSP) –Problem definition –Basic search procedure.
A Tool for Partitioning and Pipelined Scheduling of Hardware-Software Systems Karam S Chatha and Ranga Vemuri Department of ECECS University of Cincinnati.
An Inventory-Location Model: Formulation, Solution Algorithm and Computational Results Mark S. Daskin, Collete R. Coullard and Zuo-Jun Max Shen presented.
Approximation Algorithms Motivation and Definitions TSP Vertex Cover Scheduling.
Embedded System Design Framework for Minimizing Code Size and Guaranteeing Real-Time Requirements Insik Shin, Insup Lee, & Sang Lyul Min CIS, Penn, USACSE,
Ana-Maria Oprescu, Thilo Kielmann (Vrije University) Presented By Gal Cohen Cloud Computing Seminar CS Technion, Spring 2012.
Myopic Policies for Budgeted Optimization with Constrained Experiments Javad Azimi, Xiaoli Fern, Alan Fern Oregon State University AAAI, July
The mileage of a certain car can be approximated by: At what speed should you drive the car to obtain the best gas mileage? Of course, this problem isn’t.
Throughput Competitive Online Routing Baruch Awerbuch Yossi Azar Serge Plotkin.
MM Process Management Karrie Karahalios Spring 2007 (based off slides created by Brian Bailey)
1 By: MOSES CHARIKAR, CHANDRA CHEKURI, TOMAS FEDER, AND RAJEEV MOTWANI Presented By: Sarah Hegab.
CALTECH CS137 Winter DeHon CS137: Electronic Design Automation Day 12: February 13, 2002 Scheduling Heuristics and Approximation.
Spring 2015 Mathematics in Management Science Machine Scheduling Problem Statement of MSP Assumptions & Goals Priority Lists List Processing Algorithm.
Scheduling policies for real- time embedded systems.
1 Andreea Chis under the guidance of Frédéric Desprez and Eddy Caron Scheduling for a Climate Forecast Application ANR-05-CIGC-11.
Lecture 6 – Integer Programming Models Topics General model Logic constraint Defining decision variables Continuous vs. integral solution Applications:
1 Short Term Scheduling. 2  Planning horizon is short  Multiple unique jobs (tasks) with varying processing times and due dates  Multiple unique jobs.
1 Operation Scheduling- II The Multi-Machine Case Look! There are two machines.
An ‘EPIC’ on Multitasking Jason Baer. Multitasking Used very often in practical settings Reveals fundamentals of an information processing system Fundamental.
Towards Proactive Replanning for Multi-Robot Teams Brennan Sellner and Reid Simmons 5th International Workshop on Planning and Scheduling for Space October.
1 BA 275 Quantitative Business Methods Quiz #3 Statistical Inference: Hypothesis Testing Types of a Test P-value Agenda.
CprE 458/558: Real-Time Systems (G. Manimaran)1 CprE 458/558: Real-Time Systems RMS and EDF Schedulers.
Tung-Wei Kuo, Kate Ching-Ju Lin, and Ming-Jer Tsai Academia Sinica, Taiwan National Tsing Hua University, Taiwan Maximizing Submodular Set Function with.
Parallel Machine Scheduling
Introduction to Embedded Systems Rabie A. Ramadan 5.
Static Process Scheduling
1 EE5900 Advanced Embedded System For Smart Infrastructure Static Scheduling.
BROADCAST PROGRAMMING Paul Parker Donald McKinnon Production Scheduling Spring ‘13.
Hypothesis Testing. Suppose we believe the average systolic blood pressure of healthy adults is normally distributed with mean μ = 120 and variance σ.
A stochastic scheduling algorithm for precedence constrained tasks on Grid Future Generation Computer Systems (2011) Xiaoyong Tang, Kenli Li, Guiping Liao,
5 Number Summary. Definition (Five-Number Summary) The five-number summary of a set of numbers consists of the five quantities – Minimum – 1st quartile.
Carnegie Mellon Lecture 8 Software Pipelining I. Introduction II. Problem Formulation III. Algorithm Reading: Chapter 10.5 – 10.6 M. LamCS243: Software.
Polyhedral Optimization Lecture 5 – Part 3 M. Pawan Kumar Slides available online
-1- UC San Diego / VLSI CAD Laboratory Optimal Reliability-Constrained Overdrive Frequency Selection in Multicore Systems Andrew B. Kahng and Siddhartha.
1 Chapter 7 Network Flow Slides by Kevin Wayne. Copyright © 2005 Pearson-Addison Wesley. All rights reserved.
Progress Report 07/30. Virtual Core Scheduling Problem For every time period, the hypervisor scheduler is given a set of virtual cores with their operating.
Pradeep Konduri Static Process Scheduling:  Proceedance process model  Communication system model  Application  Dicussion.
Parallel processing is not easy
Optimizing Compilers Background
Operating Systems CPU Scheduling.
Planning and Scheduling in Manufacturing and Services
Process Scheduling B.Ramamurthy 2/23/2019.
Selfish Load Balancing
EMIS 8374 Maximum Concurrent Flow Updated 3 April 2008
Flexible Assembly Systems
List Scheduling Given a list of jobs (each with a specified processing time), assign them to processors to minimize makespan (max load) In Graham’s notation:
CPU Scheduling ( Basic Concepts)
Presentation transcript:

+ PRODUCTION SCHEDULING Medical analysis on an automated machine Sophie Debrade sd2829 Alexandre Philippe Ayache apa2117 Pierre Castaing pc2613

+ Problem Definition Need to test samples for HIV, Hepatits C, B, etc. Robot automating the process. 2

+ Challenge Framework and notations: Multi-tasks automated machine performs medical tests Tasks : Rince, Inject, Mix,… Different test: 1..i..n Duration of the task: Pij Waiting time after the task has lower (Lij) and upper (Uij) bounds Problem formulation: Max Throughput s.t. N samples to test M different possible tests time constraint Max Throughput s.t. N samples to test M different possible tests time constraint 3

+ Protocoles of the Tests TEST ELISA TEST WESTERN BLOT REVERSE TRANCRIPTION POLYMERASE CHAIN REACTION 4

+ Data of the Tests TEST ELISA TEST WESTERN BLOT REVERSE TRANCRIPTION POLYMERASE CHAIN REACTION 5

+ Case 1: 1 type of test 2 samples – Test ELISA Scenario 1: If do task j for Sample 1, then do task j for Sample 2 Scenario 2: Keep executing all the available tasks on the sample that is being processed Heuristic: Keep executing all the available tasks on the sample being processed One job at a time 6

+ Case 1: Analysis of the results Analyzing the performance of our algorithm: Analyzing the effectiveness of the machine: 7

+ Case 1: Results of the algorithm (R code) Using our heuristic, we try to maximize the throughput with 1 type of test Performance metrics: throughput & occupancy Test ELISATime constraint: 50 min Throughput: 19 samplesOccupancy: 59.8% 8

+ Case 1: Results of the algorithm (R code) Using our heuristic, we try to maximize the throughput with 1 type of test Performance metrics: throughput & occupancy Test WESTERN BLOTTime constraint: 1h30min Throughput: 11 samplesOccupancy: 28.5% 9

+ Case 1: Results of the algorithm (R code) Using our heuristic, we try to maximize the throughput with 1 type of test Performance metrics: throughput & occupancy Test RT-PCRTime constraint: 2h Throughput: 11 samplesOccupancy: 37.9% 10

+ Case 1: Analysis of the results Analyzing the performance of our algorithm: Finding an Upper Bound for the throughput: Time limit, say 3000 s Job1 takes 2195 s. Lower bound to overlap: UB = ( )/overlap = 23 jobs With our heuristic we obtain 19 jobs 82.6 % approximation of optimal (at least!) 11

+ Case 2: 2 types of test 2 tests – ELISA and Western-Blot. Realistic assumption -> HIV testing. We continue with the first heuristic (once a job is started, it has priority). Scenario 1: we schedule all tests of type 1 and then all tests of type 2. Scenario 2: we alternate some amount of tests of type 1 with some tests of type 2. NB: we use the fact that one WB ≈ 2 ELISA 12

+ Case 2: 2 types of test 2 tests – ELISA and Western-Blot. Scenario 1: we schedule all tests of type 1 and then all tests of type 2. Tried 4 WB - 12Elisa- 4WB – 12Elisa. Makespan =

+ Case 2: 2 types of test 2 tests – ELISA and Western-Blot. Scenario 2: we alternate some amount of tests of type 1 with some tests of type 2. Tried 2 WB - 6Elisa- 2WB – 6Elisa – 2 – 6 – Makespan =

+ Case 2: 2 types of test 2 tests – ELISA and Western-Blot. Conclusion: scenario 2 is better. Hypothesis: since tests Western-Blot are used to confirm false positive from ELISA, there are less WB than ELISA tests. The heuristic we discovered is: Given the ratio of WB vs ELISA (1 vs 3 in our example) schedule using the maximum alternance. 1 – 3 – 1 – 3 – etc. Named it: Smallest Pattern Available (SPA). Heuristic: SPA 15

+ Case 2: Scheduling Tried to schedule a lot of them with our heuristic (and our R code). Using SPA and assuming a ratio of 1 WB-10 ELISA, with a time limit of 6 hours. Throughput: 17 WB and 166 ELISA Occupancy of 84% 16

+ Case 2: Conclusion In the case of two test, ELISA and Western-Blot, we obtained a very good heuristic for a very challenging scheduling problem. Could imagine building an automated robot for HIV testing that would use the SPA heuristic. What we could do next: Repeat this process with the 3 types of tests. Find a Upper Bound for the 2 tests case and improve (lower) the first one. Think a using several robots (and go mad)!!! Change the robot characteristics/choose another robot. 17

+ THANK YOU Any questions?