Optimization of On-line Appointment Scheduling
|
|
- Gwendoline Sims
- 6 years ago
- Views:
Transcription
1 Optimization of On-line Appointment Scheduling Brian Denton Edward P. Fitts Department of Industrial and Systems Engineering North Carolina State University Tsinghua University, Beijing, China May, 2012 Brian Denton, NC State ISyE On-line Appointment () Scheduling May, / 40
2 Acknowledgements Ayca Erdogan, School of Medicine, Stanford University Alex Gose, NC State University Supported by National Science Foundation: CMMI Service Enterprise Systems Grant Brian Denton, NC State ISyE On-line Appointment () Scheduling May, / 40
3 Appointment Scheduling Systems Interface between healthcare providers and patients Arises in many healthcare contexts Primary care Radiation Oncology Surgery Outpatient Procedures Chemotherapy Brian Denton, NC State ISyE On-line Appointment () Scheduling May, / 40
4 Scheduling Challenges Competing criteria Patient waiting time Provider idle time and overtime Complicating Factors Uncertain service durations Uncertain patient demand No-shows Urgent Add-ons Brian Denton, NC State ISyE On-line Appointment () Scheduling May, / 40
5 Research Questions Given a probabilistic arrival process for customer appointment requests to a single server, in which appointments must be quoted on-line: What is the structure of the optimal appointment schedule? How can problems be classified into easy and hard? How important is it to find optimal schedules? Brian Denton, NC State ISyE On-line Appointment () Scheduling May, / 40
6 Presentation Outline Introduction Problems Static Appointment Scheduling Dynamic Appointment Scheduling Dynamic Appointment Sequencing and Scheduling Conclusions Other Research Brian Denton, NC State ISyE On-line Appointment () Scheduling May, / 40
7 Static Appointment Scheduling Problem Problem: Schedule n customers with uncertain service times during a fixed length of day, d Planned Available Time (d) x 1 x 2 x 3 x 4 x 5 Idling (s) Waiting (w) Overtime (l) Brian Denton, NC State ISyE On-line Appointment () Scheduling May, / 40
8 Common Heuristics Mean Service Times: a 1 = 0 a i = a i 1 + µ i 1, i Hedging: a 1 = 0 a i = a i 1 + µ i 1 + κσ i 1, i Ho, C., H. Lau Minimizing Total Cost in Scheduling Outpatient Appointments, Management Science 38(12). Cayirli, T., E. Veral Outpatient Scheduling in Health Care: A Review of Literature, Production and Operations Management 12. Brian Denton, NC State ISyE On-line Appointment () Scheduling May, / 40
9 Literature Review Queuing Analysis Bailey and Welch (1952) Jansson (1966) Sabria and Daganzo (1989) Heuristics White and Pike (1964) Soriano (1966) Ho and Lau (1992) Optimization Weiss (1990) Wang (1993) Denton and Gupta (2003) Brian Denton, NC State ISyE On-line Appointment () Scheduling May, / 40
10 Two-Stage Stochastic Linear Program First stage decisions x i : Time allowance for customer i Second stage decisions w i (ω): Customer i waiting time l(ω): Server overtime w.r.t. length of session d Random service durations: Z i (ω): Random service time for customer i Brian Denton, NC State ISyE On-line Appointment () Scheduling May, / 40
11 Model Formulation n min E ω [ ci w w i (ω) + c l l(ω)] i=2 s.t. w 2 (ω) Z 1 (ω) x 1, ω w 2 (ω) + w 3 (ω) Z 2 (ω) x 2, ω w n 1 (ω) + w n (ω) Z n 1 (ω) x n 1, ω n 1 w n (ω) + l(ω) Z n (ω) + x i d, ω x 0, w(ω), l(ω) 0, ω i=1 Brian Denton, NC State ISyE On-line Appointment () Scheduling May, / 40
12 Example: 6 Customers Denton, B.T. and Gupta D., 2003, A Sequential Bounding Approach for Optimal Appointment Scheduling, IIE Transactions, 35, Brian Denton, NC State ISyE On-line Appointment () Scheduling May, / 40
13 Dynamic Appointment Scheduling Problem: Up to n U customers are scheduled dynamically as they request appointments. Appointment requests are probabilistic. C2 C1 C3 C1 C2 C4 C1 C2 C3 C5 C1 C2 C3 C4 C1 C2 C3 C4 C5 Brian Denton, NC State ISyE On-line Appointment () Scheduling May, / 40
14 Multi-stage Stochastic Program Appointment requests are defined by a multi-stage scenario tree: q n u n U 1 q 4 n U -1 1-q n u n U q q 4 3 n U q 3 2 min x 1 {(1 q 3 )Q 2 (x 1 )+min{q 3 (1 q 4 )Q 3 (x 2 )+ + min {( x n U 1 x 2 n U i=3 )(q i )Q n U (x n U 1)} }} Brian Denton, NC State ISyE On-line Appointment () Scheduling May, / 40
15 Model Formulation: Stage j j+1 Q j (x j, ω j ) = min { ci w w j,i (ω j ) + c l l j+1 (ω j )} w,l i=2 s.t w j,2 (ω j ) Z 1 (ω j ) x 1 w j,2 (ω j ) + w j,3 (ω j ) Z 2 (ω j ) x w j,j (ω j ) + w j,j+1 (ω j ) Z j (ω j ) x j w j,j+1 (ω j ) + l j+1 (ω j ) Z j+1 (ω j ) + w j,i (ω j ) 0 i, l j (ω j ) 0. j x i d i=1 Brian Denton, NC State ISyE On-line Appointment () Scheduling May, / 40
16 Model Properties Motivation for first come first serve (FCFS) appointment sequence: Proposition For n U = 2 with i.i.d. service durations, and identical waiting costs, the optimal sequence is FCFS. Counter-examples exist for non i.i.d. and nonidentical waiting costs. Brian Denton, NC State ISyE On-line Appointment () Scheduling May, / 40
17 Solution Methods Variants of nested decomposition: Fast-forward-fast-back implementation Multi-cut method 2 variable method for master problems Valid inequalities based on relaxations of the mean value problem Brian Denton, NC State ISyE On-line Appointment () Scheduling May, / 40
18 Outer Linearization Outerlinearize the recourse function: min{θ θ Q(x)} Brian Denton, NC State ISyE On-line Appointment () Scheduling May, / 40
19 Methodology: Nested Decomposition Method Xn U -1 X n U X 1 X 2 3 q 4 n U u 1 q n -1 n U -1 u 1- q n n U -1 X U n -1 X n U n U 2 q 3 1- q 3 X 2 1- q 4 3 Forward X 1 2 Brian Denton, NC State ISyE On-line Appointment () Scheduling May, / 40
20 Methodology: Nested Decomposition Method Add Optimality cut Θ Eω [ π ( h Tx )] 2 Add Optimality cut q 4 q 3 1- q q 4 Add Optimality cut 3 n U -1 q n u -1 n U u 1- q n -1 n U -1 1 Add optimality cut n U Backward Brian Denton, NC State ISyE On-line Appointment () Scheduling May, / 40
21 Multi-Cut Method Separate cuts from master problems and subproblems (similar to multi-cut approach proposed by Birge and Louveaux (1985) Cut 1 3 q n u -1 n U 1 n U 2 q 3 1- q 3 3 Cut 2 1- q 3 q 2 Brian Denton, NC State ISyE On-line Appointment () Scheduling May, / 40
22 Two-variable LPs Master problems at each stage are two-variable LPs (x j and θ j ) α j x j + θ j β (α 1 x 1 + α 2 x α j 1 x j 1 ) Solve LPs with a modified version of the algorithm proposed by Dyer (1984) x 1 2 intersect x 3 4 intersect median x intersect Brian Denton, NC State ISyE On-line Appointment () Scheduling May, / 40
23 Valid Inequalities Proposition The optimal solution to the mean value problem is x i = µ i, i. Constraints based on mean value problem θ j Q j (x, ξ) Similar to valid inequalities proposed by Batun et al. (2011) Brian Denton, NC State ISyE On-line Appointment () Scheduling May, / 40
24 Solution Methods Several adaptations of nested decomposition were compared: Standard nested decomposition (ND) Multi-cut ND Two-variable ND ND with mean value valid inequalities (VI) Brian Denton, NC State ISyE On-line Appointment () Scheduling May, / 40
25 Comparisons of Methods Number of Iterations CPU Time (seconds) n U = 10 n U = 20 n U = 30 n U = 10 n U = 20 n U = 30 (d=200) (d=400) (d=600) (d=200) (d=400) (d=600) ND c l c = 10 Multi-cut ND w Two-variable ND ND with VIs ND c l c = 1 Multi-cut ND w Two-variable ND ND with VIs ND c l c = 0.1 Multi-cut ND w Two-variable ND ND with VIs QuadCore Intel R Xeon R Processor 2.50GHz CPU, 16GB Ram, CPLEX 11.0 Brian Denton, NC State ISyE On-line Appointment () Scheduling May, / 40
26 Value of Stochastic Solution (VSS) Table: VSS for test instances with Z i U(20, 40) and q i = 0.5 for add-on requests. VSS (%) Number of Customers d = 200 (Routine, Add-on) c l c c = 10 l c w c = 1 l w c = 0.1 w (0,30) (10,30) (20,30) Brian Denton, NC State ISyE On-line Appointment () Scheduling May, / 40
27 Example: Scheduling an Endoscopy Suite x i Patients 9-3 Patients 6-6 Patients 3-9 Patients Patients Figure: Service times based on colonoscopy times for an outpatient endoscopy practice: Z i Lognormal(23.55, 11.89), i. Brian Denton, NC State ISyE On-line Appointment () Scheduling May, / 40
28 Example: Multi-Procedure Room Endoscopy Practice Endoscopy Practice: 2 intake rooms 2 procedure rooms 4 recovery rooms Service timed based on empirical data Table: Expected waiting time and overtime according to different schedules Heuristic Stochastic Program Based Schedule c l c c = 10 l c w c = 1 l c w c = 0.1 l c w c = 10 l c w c = 1 l w c = 0.1 w Expected total cost Expected waiting time Expected overtime Brian Denton, NC State ISyE On-line Appointment () Scheduling May, / 40
29 Dynamic Appointment Sequencing and Scheduling The appointment request sequence and the appointment arrival sequence are not necessarily the same. C2 C2 C1 C1 C3 C3 C1 C2 C2 C1 C4 C4 C1 C2 C3 C2 C3 C1 C5 C5 C1 C2 C3 C4 C2 C4 C3 C1 C1 C2 C3 C4 C5 C2 C4 C3 C5 C1 (A) (B) Figure: (A) FCFS; (B) Example of the general case. Brian Denton, NC State ISyE On-line Appointment () Scheduling May, / 40
30 Two Stage Stochastic Integer Program Minimize {Cost of Indirect Waiting + E ω [Direct Waiting + Overtime]} First Stage Decisions: Customer sequencing (binary) Service time allowances (continuous, sequence dependent) Appointment times (continuous, sequence dependent) Second Stage Decisions: Waiting time (continuous, sequence dependent) Overtime (continuous) Brian Denton, NC State ISyE On-line Appointment () Scheduling May, / 40
31 Two Stage Stochastic Integer Program First Stage Decisions: o j,i,i : binary sequencing variable where o jii = 1 if customer i immediately precedes i at stage j, and o ii j = 0 otherwise x j,i,i : time allowance for customer i given that i immediately precedes i at stage j a j,i,i : appointment time of customer i, given that i immediately precedes i at stage j Second Stage Decisions: w j,i,i (ω) : waiting time of customer i given that customer i immediately precedes i at stage j under duration scenario ω s j,i,i (ω) : server idle time between customer i and i, given that i immediately precedes i at stage j l j (ω) : overtime at stage j with respect to session length d Brian Denton, NC State ISyE On-line Appointment () Scheduling May, / 40
32 First Stage Problem s.t. min j+1 o j,i,i = 1, i =1 n j p j [ j=1 j i=1 i =1 j+1 o j,i,i = 1 i =0 ci a a j,i,i ] + Q(o, x) j, i = 1, 2,..., j j+1 j+1 o j,i,i = j + 1 j i=0 i=0 o j,i,j + o j,j,i 2(o j 1,i,i o j,i,i ) 0 j, i, i < j x j,i,i M 1 o j,i,i, a j,i,i M 1 o j,i,i j, i, i j+1 j+1 j+1 x j,i,i = a j,i,i i =1 i =1 i =1 a j,i,i j, i x j,i,i, a j,i,i 0, o j,i,i {0, 1} j, i, i, j Brian Denton, NC State ISyE On-line Appointment () Scheduling May, / 40
33 Second Stage Subproblem j j Q(o, x, ω) = min E ω [ (ci w w j,i,i (ω) + cl l j (ω)] i=1 i =1 s.t. w j,i,i (ω) M 2 (ω)o j,i,i i, i, j, ω s j,i,i (ω) M 3 (ω)o j,i,i i, i, j, ω j j j j w j,i,i(ω) + w j,i,i (ω) s j,i,i (ω) = Z i (ω) x j,i,i i, j, ω i =1 j l j (ω) i =1 j s j,i,i (ω) + i =1 j Z i (ω) + i=1 i =1 i=1 i =1 i =1 j x j,0,i d j, ω w j,i,i (ω), s j,i,i (ω), l j (ω) 0, j, i, i, ω. Brian Denton, NC State ISyE On-line Appointment () Scheduling May, / 40
34 Model Properties The addition of indirect waiting costs results in conditions under which FCFS is not optimal: Proposition For n U = 2 with i.i.d. service durations if c a 2 cw 1 then the optimal sequence is LCFS. Brian Denton, NC State ISyE On-line Appointment () Scheduling May, / 40
35 Methodology Compared L-shaped method and Integer L-shaped method Fast solution to second stage subproblems Presolve Warm start Branch-and-cut vs. dynamic search MIP cuts (MIR, implied bound cuts, etc.) Mean value problem based valid inequalities Brian Denton, NC State ISyE On-line Appointment () Scheduling May, / 40
36 Computational Performance L-Shaped Method No. of Class Type of CPU Time # of Iterations Customers Customers Average Max Average Max Add on Customers Routine Add on Add on 15000* 15000* Customers Routine 15000* 15000* Add on Add on 15000* 15000* Customers Routine 15000* 15000* Add on Brian Denton, NC State ISyE On-line Appointment () Scheduling May, / 40
37 Computational Performance Table: Gap at the time of termination for the instances that are not solved to optimality Problem Instance Patient Best Gap Size No Type L-Shaped Method L-Shaped Method (mean value based cuts) Add on % optimal 7 Patients (uniform) Routine % 1.95% 3 Add on Add on % 7.26% Patients (uniform) Routine % 1.99% 3 Add on Add on % 21.99% 7 Patients (lognormal) Routine % 15.71% 3 Add on Add on % 31.53% Patients (lognormal) Routine % 13.07% 3 Add on Brian Denton, NC State ISyE On-line Appointment () Scheduling May, / 40
38 Example 1: Structure of the Optimal Solution Table: Examples with varying direct/indirect cost for instance 3.6 (7 routine, 3 add on, lognormal service times) parameters Instance c a c w c a c w No Routine Routine Add-on Add-on c L CPU Time # of Iterations Optimal Sequence ave max ave max R-R-R-R-R-R-R-A-A-A A-A-A-R-R-R-R-R-R-R A-A-A-R-R-R-R-R-R-R A-A-A-R-R-R-R-R-R-R A-A-A-R-R-R-R-R-R-R A-A-A-R-R-R-R-R-R-R A-A-A-R-R-R-R-R-R-R A-A-A-R-R-R-R-R-R-R Brian Denton, NC State ISyE On-line Appointment () Scheduling May, / 40
39 Conclusions VSS can be as high as 95% and as low as 0.5% Large instances of dynamic scheduling problem can be solved efficiently but sequencing and scheduling is much harder FCFS generally optimal when probabilities of add-on customers are low and/or indirect cost of waiting is low Placement of add on customers is frequently all or nothing Brian Denton, NC State ISyE On-line Appointment () Scheduling May, / 40
40 Other Research Complex service systems with multiple servers and stages of service Uncertain service time, demand, and patient/provider behavior Applications: Hospital surgery practices Outpatient procedure and treatment centers Brian Denton, NC State ISyE On-line Appointment () Scheduling May, / 40
41 Questions? Brian Denton Brian Denton, NC State ISyE On-line Appointment () Scheduling May, / 40
An Optimization Approach for Real Time Evacuation Reroute. Planning
An Optimization Approach for Real Time Evacuation Reroute Planning Gino J. Lim and M. Reza Baharnemati and Seon Jin Kim November 16, 2015 Abstract This paper addresses evacuation route management in the
More informationScheduling. Radek Mařík. April 28, 2015 FEE CTU, K Radek Mařík Scheduling April 28, / 48
Scheduling Radek Mařík FEE CTU, K13132 April 28, 2015 Radek Mařík (marikr@fel.cvut.cz) Scheduling April 28, 2015 1 / 48 Outline 1 Introduction to Scheduling Methodology Overview 2 Classification of Scheduling
More informationThe Capability of Error Correction for Burst-noise Channels Using Error Estimating Code
The Capability of Error Correction for Burst-noise Channels Using Error Estimating Code Yaoyu Wang Nanjing University yaoyu.wang.nju@gmail.com June 10, 2016 Yaoyu Wang (NJU) Error correction with EEC June
More informationChapter 12. Cross-Layer Optimization for Multi- Hop Cognitive Radio Networks
Chapter 12 Cross-Layer Optimization for Multi- Hop Cognitive Radio Networks 1 Outline CR network (CRN) properties Mathematical models at multiple layers Case study 2 Traditional Radio vs CR Traditional
More informationAircraft routing for on-demand air transportation with service upgrade and maintenance events: compact model and case study
Aircraft routing for on-demand air transportation with service upgrade and maintenance events: compact model and case study Pedro Munari, Aldair Alvarez Production Engineering Department, Federal University
More informationWireless communications: from simple stochastic geometry models to practice III Capacity
Wireless communications: from simple stochastic geometry models to practice III Capacity B. Błaszczyszyn Inria/ENS Workshop on Probabilistic Methods in Telecommunication WIAS Berlin, November 14 16, 2016
More informationControl of the Contract of a Public Transport Service
Control of the Contract of a Public Transport Service Andrea Lodi, Enrico Malaguti, Nicolás E. Stier-Moses Tommaso Bonino DEIS, University of Bologna Graduate School of Business, Columbia University SRM
More informationService Appointment Scheduling with Walk-In, Short-term, and Traditional Scheduling
Service Appointment Scheduling with Walk-In, Short-term, and Traditional Scheduling 1 Decision Sciences Institute Annual Meeting New Orleans November 16, 2009 Dr. Linda R. LaGanga Director of Quality Systems
More informationPart VII: VRP - advanced topics
Part VII: VRP - advanced topics c R.F. Hartl, S.N. Parragh 1/32 Overview Dealing with TW and duration constraints Solving VRP to optimality c R.F. Hartl, S.N. Parragh 2/32 Dealing with TW and duration
More informationCharacteristics of Routes in a Road Traffic Assignment
Characteristics of Routes in a Road Traffic Assignment by David Boyce Northwestern University, Evanston, IL Hillel Bar-Gera Ben-Gurion University of the Negev, Israel at the PTV Vision Users Group Meeting
More informationConstellation Scheduling Under Uncertainty: Models and Benefits
Unclassified Unlimited Release (UUR) Constellation Scheduling Under Uncertainty: Models and Benefits GSAW 2017 Securing the Future March 14 th 2017 Christopher G. Valica* Jean-Paul Watson *Correspondence:
More informationMini Project 3: GT Evacuation Simulation
Vanarase & Tuchez 1 Shreyyas Vanarase Christian Tuchez CX 4230 Computer Simulation Prof. Vuduc Part A: Conceptual Model Introduction Mini Project 3: GT Evacuation Simulation Agent based models and queuing
More informationOptimizing Client Association in 60 GHz Wireless Access Networks
Optimizing Client Association in 60 GHz Wireless Access Networks G Athanasiou, C Weeraddana, C Fischione, and L Tassiulas KTH Royal Institute of Technology, Stockholm, Sweden University of Thessaly, Volos,
More informationBuilding a Health Systems Engineering Infrastructure
Building a Health Systems Engineering Infrastructure Brian Denton, PhD Edward P. Fitts Department of Industrial & Systems Engineering North Carolina State University August 17, 2009 Summary What is systems
More informationHow user throughput depends on the traffic demand in large cellular networks
How user throughput depends on the traffic demand in large cellular networks B. Błaszczyszyn Inria/ENS based on a joint work with M. Jovanovic and M. K. Karray (Orange Labs, Paris) 1st Symposium on Spatial
More informationMIMO Radar and Communication Spectrum Sharing with Clutter Mitigation
MIMO Radar and Communication Spectrum Sharing with Clutter Mitigation Bo Li and Athina Petropulu Department of Electrical and Computer Engineering Rutgers, The State University of New Jersey Work supported
More informationThe Wireless Network Jamming Problem Subject to Protocol Interference
The Wireless Network Jamming Problem Subject to Protocol Interference Author information blinded December 22, 2014 Abstract We study the following problem in wireless network security: Which jamming device
More informationA TREE-SEARCH BASED HEURISTIC FOR A COMPLEX STACKING PROBLEM WITH CONTINUOUS PRODUCTION AND RETRIEVAL
A TREE-SEARCH BASED HEURISTIC FOR A COMPLEX STACKING PROBLEM WITH CONTINUOUS PRODUCTION AND RETRIEVAL Sebastian Raggl (a), Beham Andreas (b), Fabien Tricoire (c), Michael Affenzeller (d) (a,b,d) Heuristic
More informationVehicle routing problems with road-network information
50 Dominique Feillet Mines Saint-Etienne and LIMOS, CMP Georges Charpak, F-13541 Gardanne, France Vehicle routing problems with road-network information ORBEL - Liège, February 1, 2018 Vehicle Routing
More informationTransportation Timetabling
Outline DM87 SCHEDULING, TIMETABLING AND ROUTING 1. Sports Timetabling Lecture 16 Transportation Timetabling Marco Chiarandini 2. Transportation Timetabling Tanker Scheduling Air Transport Train Timetabling
More informationPolicy Teaching. Through Reward Function Learning. Haoqi Zhang, David Parkes, and Yiling Chen
Policy Teaching Through Reward Function Learning Haoqi Zhang, David Parkes, and Yiling Chen School of Engineering and Applied Sciences Harvard University ACM EC 2009 Haoqi Zhang (Harvard University) Policy
More informationOnline Supplement for An integer programming approach for fault-tolerant connected dominating sets
Submitted to INFORMS Journal on Computing manuscript (Please, provide the mansucript number!) Authors are encouraged to submit new papers to INFORMS journals by means of a style file template, which includes
More informationUtilization-Aware Adaptive Back-Pressure Traffic Signal Control
Utilization-Aware Adaptive Back-Pressure Traffic Signal Control Wanli Chang, Samarjit Chakraborty and Anuradha Annaswamy Abstract Back-pressure control of traffic signal, which computes the control phase
More informationTwo-stage column generation and applications in container terminal management
Two-stage column generation and applications in container terminal management Ilaria Vacca Matteo Salani Michel Bierlaire Transport and Mobility Laboratory EPFL 8th Swiss Transport Research Conference
More informationEfficiency and detectability of random reactive jamming in wireless networks
Efficiency and detectability of random reactive jamming in wireless networks Ni An, Steven Weber Modeling & Analysis of Networks Laboratory Drexel University Department of Electrical and Computer Engineering
More informationColumn Generation. A short Introduction. Martin Riedler. AC Retreat
Column Generation A short Introduction Martin Riedler AC Retreat Contents 1 Introduction 2 Motivation 3 Further Notes MR Column Generation June 29 July 1 2 / 13 Basic Idea We already heard about Cutting
More informationMULTI-STAGE TRANSMISSION EXPANSION PLANNING CONSIDERING MULTIPLE DISPATCHES AND CONTINGENCY CRITERION
MULTI-STAGE TRANSMISSION EXPANSION PLANNING CONSIDERING MULTIPLE DISPATCHES AND CONTINGENCY CRITERION GERSON C. OLIVEIRA, SILVIO BINATO, MARIO V. PEREIRA, LUIZ M. THOMÉ PSR CONSULTORIA LTDA R. VOLUNTARIOS
More informationImproving Reinforcement Learning Algorithms for Dynamic Spectrum Allocation in Cognitive Sensor Networks
Improving Reinforcement Learning Algorithms for Dynamic Spectrum Allocation in Cognitive Sensor Networks Wireless Communications and Networking Conference Leonardo Faganello, Rafael Kunst, Cristiano Both,
More informationOptimal Dispatching of Welding Robots
Optimal Dispatching of Welding Robots Cornelius Schwarz and Jörg Rambau Lehrstuhl für Wirtschaftsmathematik Universität Bayreuth Germany Aussois January 2009 Application: Laser Welding in Car Body Shops
More informationABM-DTA Deep Integration: Results from the Columbus and Atlanta SHRP C10 Implementations
ABM-DTA Deep Integration: Results from the Columbus and Atlanta SHRP C10 Implementations presented by Matt Stratton, WSP USA October 17, 2017 New CT-RAMP Integrable w/dta Enhanced temporal resolution:
More informationSelective Offloading to WiFi Devices for 5G Mobile Users by Fog Computing
Appeared in 13th InternationalWireless Communications and Mobile Computing Conference (IWCMC), Valencia, Spain, June 26-30 2017 Selective Offloading to WiFi Devices for 5G Mobile Users by Fog Computing
More informationA Column Generation Method for Spatial TDMA Scheduling in Ad Hoc Networks
A Column Generation Method for Spatial TDMA Scheduling in Ad Hoc Networks Patrik Björklund, Peter Värbrand, Di Yuan Department of Science and Technology, Linköping Institute of Technology, SE-601 74, Norrköping,
More information8th International Conference on Decision Support for Telecommunications and Information Society
A bi-objective approach for routing and wavelength assignment in multi-fibre WDM networks Carlos Simões 1,4, Teresa Gomes 2,4, José Craveirinha 2,4 and João Clímaco 3,4 1 Polytechnic Institute of Viseu,
More informationThe Path Restoration Version of the Spare Capacity Allocation Problem with Modularity Restrictions: Models, Algorithms, and an Empirical Analysis
The Path Restoration Version of the Spare Capacity Allocation Problem with Modularity Restrictions: Models, Algorithms, and an Empirical Analysis Jeffery L. Kennington Mark W. Lewis Department of Computer
More informationSolving Assembly Line Balancing Problem using Genetic Algorithm with Heuristics- Treated Initial Population
Solving Assembly Line Balancing Problem using Genetic Algorithm with Heuristics- Treated Initial Population 1 Kuan Eng Chong, Mohamed K. Omar, and Nooh Abu Bakar Abstract Although genetic algorithm (GA)
More informationEvaluation of CPU Frequency Transition Latency
Evaluation of CPU Frequency Transition Latency Abdelhafid Mazouz 1 Alexandre Laurent 1 Benoît Pradelle 1 William Jalby 1 1 University of Versailles Saint-Quentin-en-Yvelines, France ENA-HPC 2013, Dresden
More informationMulti-user Space Time Scheduling for Wireless Systems with Multiple Antenna
Multi-user Space Time Scheduling for Wireless Systems with Multiple Antenna Vincent Lau Associate Prof., University of Hong Kong Senior Manager, ASTRI Agenda Bacground Lin Level vs System Level Performance
More informationOptimal Crowdsourced Channel Monitoring in Cognitive Radio Networks
Optimal Crowdsourced Channel Monitoring in Cognitive Radio Networks Ahmed M. Salama 1, Ming Li 1, Dejun Yang 2 1 Dept. of ECE, The University of Arizona 2 Dept. of EECS, Colorado School of Mines E-mail{ahmedsalama,lim}@email.arizona.edu,
More informationHaving an Endoscopy Colonoscopy
GASTROENTEROLOGY UNDERSTANDING YOU, INSIDE OUT Having an Endoscopy Colonoscopy Serious about health. Passionate about care. This leaflet has been prepared to provide you with information about your coming
More informationNeighborhood based heuristics for a Two-level Hierarchical Location Problem with modular node capacities
Neighborhood based heuristics for a Two-level Hierarchical Location Problem with modular node capacities Bernardetta Addis, Giuliana Carello Alberto Ceselli Dipartimento di Elettronica e Informazione,
More informationAntennas and Propagation. Chapter 6b: Path Models Rayleigh, Rician Fading, MIMO
Antennas and Propagation b: Path Models Rayleigh, Rician Fading, MIMO Introduction From last lecture How do we model H p? Discrete path model (physical, plane waves) Random matrix models (forget H p and
More informationSupervisory Control for Cost-Effective Redistribution of Robotic Swarms
Supervisory Control for Cost-Effective Redistribution of Robotic Swarms Ruikun Luo Department of Mechaincal Engineering College of Engineering Carnegie Mellon University Pittsburgh, Pennsylvania 11 Email:
More informationCS 188 Introduction to Fall 2014 Artificial Intelligence Midterm
CS 88 Introduction to Fall Artificial Intelligence Midterm INSTRUCTIONS You have 8 minutes. The exam is closed book, closed notes except a one-page crib sheet. Please use non-programmable calculators only.
More informationOptimization Techniques for Alphabet-Constrained Signal Design
Optimization Techniques for Alphabet-Constrained Signal Design Mojtaba Soltanalian Department of Electrical Engineering California Institute of Technology Stanford EE- ISL Mar. 2015 Optimization Techniques
More informationHedonic Coalition Formation for Distributed Task Allocation among Wireless Agents
Hedonic Coalition Formation for Distributed Task Allocation among Wireless Agents Walid Saad, Zhu Han, Tamer Basar, Me rouane Debbah, and Are Hjørungnes. IEEE TRANSACTIONS ON MOBILE COMPUTING, VOL. 10,
More informationSCHEDULING Giovanni De Micheli Stanford University
SCHEDULING Giovanni De Micheli Stanford University Outline The scheduling problem. Scheduling without constraints. Scheduling under timing constraints. Relative scheduling. Scheduling under resource constraints.
More informationThe Multiple Part Type Cyclic Flow Shop Robotic Cell Scheduling Problem: A Novel and Comprehensive Mixed Integer Linear Programming Approach
The Multiple Part Type Cyclic Flow Shop Robotic Cell Scheduling Problem: A Novel and Comprehensive Mixed Integer Linear Programming Approach Atabak Elmi a, Asef Nazari b,, Dhananjay Thiruvady a a School
More informationInformation Theory and Communication Optimal Codes
Information Theory and Communication Optimal Codes Ritwik Banerjee rbanerjee@cs.stonybrook.edu c Ritwik Banerjee Information Theory and Communication 1/1 Roadmap Examples and Types of Codes Kraft Inequality
More informationSF2972: Game theory. Introduction to matching
SF2972: Game theory Introduction to matching The 2012 Nobel Memorial Prize in Economic Sciences: awarded to Alvin E. Roth and Lloyd S. Shapley for the theory of stable allocations and the practice of market
More informationRolling Partial Rescheduling with Dual Objectives for Single Machine Subject to Disruptions 1)
Vol.32, No.5 ACTA AUTOMATICA SINICA September, 2006 Rolling Partial Rescheduling with Dual Objectives for Single Machine Subject to Disruptions 1) WANG Bing 1,2 XI Yu-Geng 2 1 (School of Information Engineering,
More informationW CDMA Network Design
Technical Report 03-EMIS-02 W CDMA Network Design Qibin Cai 1 Joakim Kalvenes 2 Jeffery Kennington 1 Eli Olinick 1 1 {qcai,jlk,olinick}@engr.smu.edu School of Engineering Southern Methodist University
More informationA Bi-level Formulation for the Combined Dynamic Equilibrium based Traffic Signal Control
Available online at www.sciencedirect.com Procedia - Social and Behavioral Scienc es ( 13 ) 79 7 A Bi-level Formulation for the Combined Dynamic Equilibrium based Traffic Signal Control Satish Ukkusuri
More informationPerformance Characterization of IP Network-based Control Methodologies for DC Motor Applications Part II
Performance Characterization of IP Network-based Control Methodologies for DC Motor Applications Part II Tyler Richards, Mo-Yuen Chow Advanced Diagnosis Automation and Control Lab Department of Electrical
More informationBandwidth Estimation Using End-to- End Packet-Train Probing: Stochastic Foundation
Bandwidth Estimation Using End-to- End Packet-Train Probing: Stochastic Foundation Xiliang Liu Joint work with Kaliappa Ravindran and Dmitri Loguinov Department of Computer Science City University of New
More informationTD-Leaf(λ) Giraffe: Using Deep Reinforcement Learning to Play Chess. Stefan Lüttgen
TD-Leaf(λ) Giraffe: Using Deep Reinforcement Learning to Play Chess Stefan Lüttgen Motivation Learn to play chess Computer approach different than human one Humans search more selective: Kasparov (3-5
More informationTravel time uncertainty and network models
Travel time uncertainty and network models CE 392C TRAVEL TIME UNCERTAINTY One major assumption throughout the semester is that travel times can be predicted exactly and are the same every day. C = 25.87321
More informationPlanning and Optimization of Broadband Power Line Communications Access Networks: Analysis, Modeling and Solution
Technische Universität Dresden Chair for Telecommunications 1 ITG-Fachgruppe 5.2.1. Workshop Planning and Optimization of Broadband Power Line Communications Access Networks: Analysis, Modeling and Solution
More informationOptimizing Media Access Strategy for Competing Cognitive Radio Networks Y. Gwon, S. Dastangoo, H. T. Kung
Optimizing Media Access Strategy for Competing Cognitive Radio Networks Y. Gwon, S. Dastangoo, H. T. Kung December 12, 2013 Presented at IEEE GLOBECOM 2013, Atlanta, GA Outline Introduction Competing Cognitive
More informationOpportunistic Communications under Energy & Delay Constraints
Opportunistic Communications under Energy & Delay Constraints Narayan Mandayam (joint work with Henry Wang) Opportunistic Communications Wireless Data on the Move Intermittent Connectivity Opportunities
More informationOn Information Theoretic Interference Games With More Than Two Users
On Information Theoretic Interference Games With More Than Two Users Randall A. Berry and Suvarup Saha Dept. of EECS Northwestern University e-ma: rberry@eecs.northwestern.edu suvarups@u.northwestern.edu
More informationBender s Decomposition Algorithm for Model Predictive Control of a Modular Multi-level Converter
Bender s Decomposition Algorithm for Model Predictive Control of a Modular Multilevel Converter Minyue Ma, Student Member, IEEE, Lingling Fan, Senior Member, IEEE Abstract In this paper, we consider an
More informationTutorial: New Challenges in Network Optimization
Tutorial: New Challenges in Network Optimization Dimitri Papadimitriou 1 dimitri.papadimitriou@nokia-bell-labs.com 1 Bell Labs Antwerp, Belgium IEEE HPSR - Yokohama June 14-17, 2016 D.Papadimitriou IEEE
More informationPhysical Synthesis of Bus Matrix for High Bandwidth Low Power On-chip Communications
Physical Synthesis of Bus Matrix for High Bandwidth Low Power On-chip Communications Renshen Wang 1, Evangeline Young 2, Ronald Graham 1 and Chung-Kuan Cheng 1 1 University of California San Diego 2 The
More informationFast Online Learning of Antijamming and Jamming Strategies
Fast Online Learning of Antijamming and Jamming Strategies Y. Gwon, S. Dastangoo, C. Fossa, H. T. Kung December 9, 2015 Presented at the 58 th IEEE Global Communications Conference, San Diego, CA This
More informationGames and Adversarial Search II
Games and Adversarial Search II Alpha-Beta Pruning (AIMA 5.3) Some slides adapted from Richard Lathrop, USC/ISI, CS 271 Review: The Minimax Rule Idea: Make the best move for MAX assuming that MIN always
More informationCapacity Analysis and Call Admission Control in Distributed Cognitive Radio Networks
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS (TO APPEAR) Capacity Analysis and Call Admission Control in Distributed Cognitive Radio Networks SubodhaGunawardena, Student Member, IEEE, and Weihua Zhuang,
More informationA new mixed integer linear programming formulation for one problem of exploration of online social networks
manuscript No. (will be inserted by the editor) A new mixed integer linear programming formulation for one problem of exploration of online social networks Aleksandra Petrović Received: date / Accepted:
More informationOutline for this presentation. Introduction I -- background. Introduction I Background
Mining Spectrum Usage Data: A Large-Scale Spectrum Measurement Study Sixing Yin, Dawei Chen, Qian Zhang, Mingyan Liu, Shufang Li Outline for this presentation! Introduction! Methodology! Statistic and
More informationHow Data Center Size Impacts the Effectiveness of Dynamic Power Management
How Data Center Size Impacts the Effectiveness of Dynamic Power Management Anshul Gandhi and Mor Harchol-Balter Abstract Power consumption accounts for a significant portion of a data center s operating
More informationCUDA-Accelerated Satellite Communication Demodulation
CUDA-Accelerated Satellite Communication Demodulation Renliang Zhao, Ying Liu, Liheng Jian, Zhongya Wang School of Computer and Control University of Chinese Academy of Sciences Outline Motivation Related
More informationLL assigns tasks to stations and decides on the position of the stations and conveyors.
2 Design Approaches 2.1 Introduction Designing of manufacturing systems involves the design of products, processes and plant layout before physical construction [35]. CE, which is known as simultaneous
More informationUNIVERSALITY IN SUBSTITUTION-CLOSED PERMUTATION CLASSES. with Frédérique Bassino, Mathilde Bouvel, Valentin Féray, Lucas Gerin and Mickaël Maazoun
UNIVERSALITY IN SUBSTITUTION-CLOSED PERMUTATION CLASSES ADELINE PIERROT with Frédérique Bassino, Mathilde Bouvel, Valentin Féray, Lucas Gerin and Mickaël Maazoun The aim of this work is to study the asymptotic
More informationTIME- OPTIMAL CONVERGECAST IN SENSOR NETWORKS WITH MULTIPLE CHANNELS
TIME- OPTIMAL CONVERGECAST IN SENSOR NETWORKS WITH MULTIPLE CHANNELS A Thesis by Masaaki Takahashi Bachelor of Science, Wichita State University, 28 Submitted to the Department of Electrical Engineering
More informationReal Time User-Centric Energy Efficient Scheduling In Embedded Systems
Real Time User-Centric Energy Efficient Scheduling In Embedded Systems N.SREEVALLI, PG Student in Embedded System, ECE Under the Guidance of Mr.D.SRIHARI NAIDU, SIDDARTHA EDUCATIONAL ACADEMY GROUP OF INSTITUTIONS,
More informationOptimization Methods for UMTS Radio Network Planning,
Optimization Methods for UMTS Radio Network Planning, Andreas Eisenblätter 1, Armin Fügenschuh 2, Hans-Florian Geerdes 3, Daniel Junglas 2, Thorsten Koch 3, and Alexander Martin 2 1 Atesio GmbH, Berlin
More informationRelay Placement in Sensor Networks
Relay Placement in Sensor Networks Jukka Suomela 14 October 2005 Contents: Wireless Sensor Networks? Relay Placement? Problem Classes Computational Complexity Approximation Algorithms HIIT BRU, Adaptive
More informationMehrdad Amirghasemi a* Reza Zamani a
The roles of evolutionary computation, fitness landscape, constructive methods and local searches in the development of adaptive systems for infrastructure planning Mehrdad Amirghasemi a* Reza Zamani a
More informationWCFQ: an Opportunistic Wireless Scheduler with Statistical Fairness Bounds
WCFQ: AN OPPORTUNISTIC WIRELESS SCHEDULER WITH STATISTICAL FAIRNESS BOUNDS WCFQ: an Opportunistic Wireless Scheduler with Statistical Fairness Bounds Yonghe Liu, Stefan Gruhl, and Edward W. Knightly Abstract
More informationVLSI System Testing. Outline
ECE 538 VLSI System Testing Krish Chakrabarty System-on-Chip (SOC) Testing ECE 538 Krish Chakrabarty 1 Outline Motivation for modular testing of SOCs Wrapper design IEEE 1500 Standard Optimization Test
More informationEnergy Efficient Scheduling Techniques For Real-Time Embedded Systems
Energy Efficient Scheduling Techniques For Real-Time Embedded Systems Rabi Mahapatra & Wei Zhao This work was done by Rajesh Prathipati as part of his MS Thesis here. The work has been update by Subrata
More informationApplying Topological Constraint Optimization Techniques to Periodic Train Scheduling
Applying Topological Constraint Optimization Techniques to Periodic Train Scheduling M. Abril 2, M.A. Salido 1, F. Barber 2, L. Ingolotti 2, P. Tormos 3, A. Lova 3 DCCIA 1, Universidad de Alicante, Spain
More informationDISTRIBUTION NETWORK RECONFIGURATION FOR LOSS MINIMISATION USING DIFFERENTIAL EVOLUTION ALGORITHM
DISTRIBUTION NETWORK RECONFIGURATION FOR LOSS MINIMISATION USING DIFFERENTIAL EVOLUTION ALGORITHM K. Sureshkumar 1 and P. Vijayakumar 2 1 Department of Electrical and Electronics Engineering, Velammal
More informationContents. Basic Concepts. Histogram of CPU-burst Times. Diagram of Process State CHAPTER 5 CPU SCHEDULING. Alternating Sequence of CPU And I/O Bursts
Contents CHAPTER 5 CPU SCHEDULING Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple-Processor Scheduling Real-Time Scheduling Basic Concepts Maximum CPU utilization obtained with multiprogramming
More informationOptimization in container terminals
Ilaria Vacca (EPFL) - Integrated optimization in container terminal operations p. 1/23 Optimization in container terminals Hierarchical vs integrated solution approaches Michel Bierlaire Matteo Salani
More informationCIS 480/899 Embedded and Cyber Physical Systems Spring 2009 Introduction to Real-Time Scheduling. Examples of real-time applications
CIS 480/899 Embedded and Cyber Physical Systems Spring 2009 Introduction to Real-Time Scheduling Insup Lee Department of Computer and Information Science University of Pennsylvania lee@cis.upenn.edu www.cis.upenn.edu/~lee
More informationPhysical-Layer Multicasting by Stochastic Beamforming and Alamouti Space-Time Coding
Physical-Layer Multicasting by Stochastic Beamforming and Alamouti Space-Time Coding Anthony Man-Cho So Dept. of Systems Engineering and Engineering Management The Chinese University of Hong Kong (Joint
More informationLow Complexity List Successive Cancellation Decoding of Polar Codes
Low Complexity List Successive Cancellation Decoding of Polar Codes Congzhe Cao, Zesong Fei School of Information and Electronics Beijing Institute of Technology Beijing, China Email: 5, feizesong@bit.edu.cn
More informationIEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL. 58, NO. 3, MARCH
IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL. 58, NO. 3, MARCH 2010 1401 Decomposition Principles and Online Learning in Cross-Layer Optimization for Delay-Sensitive Applications Fangwen Fu, Student Member,
More informationEric J. Nava Department of Civil Engineering and Engineering Mechanics, University of Arizona,
A Temporal Domain Decomposition Algorithmic Scheme for Efficient Mega-Scale Dynamic Traffic Assignment An Experience with Southern California Associations of Government (SCAG) DTA Model Yi-Chang Chiu 1
More informationScheduling Ambulance Crews for Maximum Coverage
Scheduling Ambulance Crews for Maximum Coverage Güneş Erdoğan Erhan Erkut Armann Ingolfsson Gilbert Laporte April 14, 2008 Abstract This paper addresses the problem of scheduling ambulance crews in order
More informationHash Function Learning via Codewords
Hash Function Learning via Codewords 2015 ECML/PKDD, Porto, Portugal, September 7 11, 2015. Yinjie Huang 1 Michael Georgiopoulos 1 Georgios C. Anagnostopoulos 2 1 Machine Learning Laboratory, University
More informationA PageRank Algorithm based on Asynchronous Gauss-Seidel Iterations
Simulation A PageRank Algorithm based on Asynchronous Gauss-Seidel Iterations D. Silvestre, J. Hespanha and C. Silvestre 2018 American Control Conference Milwaukee June 27-29 2018 Silvestre, Hespanha and
More informationA GRASP HEURISTIC FOR THE COOPERATIVE COMMUNICATION PROBLEM IN AD HOC NETWORKS
A GRASP HEURISTIC FOR THE COOPERATIVE COMMUNICATION PROBLEM IN AD HOC NETWORKS C. COMMANDER, C.A.S. OLIVEIRA, P.M. PARDALOS, AND M.G.C. RESENDE ABSTRACT. Ad hoc networks are composed of a set of wireless
More informationBurst Error Correction Method Based on Arithmetic Weighted Checksums
Engineering, 0, 4, 768-773 http://dxdoiorg/0436/eng04098 Published Online November 0 (http://wwwscirporg/journal/eng) Burst Error Correction Method Based on Arithmetic Weighted Checksums Saleh Al-Omar,
More informationOptimal Multicast Routing in Ad Hoc Networks
Mat-2.108 Independent esearch Projects in Applied Mathematics Optimal Multicast outing in Ad Hoc Networks Juha Leino 47032J Juha.Leino@hut.fi 1st December 2002 Contents 1 Introduction 2 2 Optimal Multicasting
More informationON LOW-PASS RECONSTRUCTION AND STOCHASTIC MODELING OF PWM SIGNALS NOYAN CEM SEVÜKTEKİN THESIS
ON LOW-PASS RECONSTRUCTION AND STOCHASTIC MODELING OF PWM SIGNALS BY NOYAN CEM SEVÜKTEKİN THESIS Submitted in partial fulfillment of the requirements for the degree of Master of Science in Electrical and
More informationApproches basées sur les métaheuristiques pour la gestion de flotte en temps réel
Approches basées sur les métaheuristiques pour la gestion de flotte en temps réel Frédéric SEMET LAMIH, UMR CNRS, Université de Valenciennes Motivation Réseau terrestre (GSM) Telecommunication GPS laptop
More informationNear-Optimal Radio Use For Wireless Network Synch. Synchronization
Near-Optimal Radio Use For Wireless Network Synchronization LANL, UCLA 10th of July, 2009 Motivation Consider sensor network: tiny, inexpensive embedded computers run complex software sense environmental
More informationTowards Strategic Kriegspiel Play with Opponent Modeling
Towards Strategic Kriegspiel Play with Opponent Modeling Antonio Del Giudice and Piotr Gmytrasiewicz Department of Computer Science, University of Illinois at Chicago Chicago, IL, 60607-7053, USA E-mail:
More informationLocalization (Position Estimation) Problem in WSN
Localization (Position Estimation) Problem in WSN [1] Convex Position Estimation in Wireless Sensor Networks by L. Doherty, K.S.J. Pister, and L.E. Ghaoui [2] Semidefinite Programming for Ad Hoc Wireless
More information