Nurse scheduling problem 25 nurses ( Team A:13, B:12 ) Experienced nurses and new nurses 3 shifts ( day, evening, night ), meetings, days off Time span.

Slides:



Advertisements
Similar presentations
1 Material to Cover  relationship between different types of models  incorrect to round real to integer variables  logical relationship: site selection.
Advertisements

Chapter 3 Workforce scheduling.
1 Lecture 2 Shortest-Path Problems Assignment Problems Transportation Problems.
Branch and Bound Example. Initial lower bound Jrpd Use 1 machine preemptive schedule as lower bound Job 2 has a lateness of 5,
Normal Programs with Cardinality Constraints C = L {a 1,..., a n, not b 1,..., not b m } U L lower bound, U upper bound (missing L: 0, missing U: n+m)
WOOD 492 MODELLING FOR DECISION SUPPORT Lecture 6 LP Assumptions.
© J. Christopher Beck Lecture 24: Workforce Scheduling 2.
One-Way ANOVA Model Y ij denotes the ith observation within the jth of m groups. n j is the number of observations in the jth group. n =  n j is the total.
INTRODUCTION TO LINEAR PROGRAMMING
Using Areas to Approximate to Sums of Series In the previous examples it was shown that an area can be represented by the sum of a series. Conversely the.
1 Nurse Rostering with CARE. Jonathan Thompson 1, Kath Dowsland 2 & Bill Dowsland Cardiff University 2.Gower Optimal Algorithms Ltd. These slides.
New Jersey Transit Fatigue Risk Report Assignments for 27 th October December
Constraint Satisfaction Definition. A constraint is a formula of the form: (x = y) (x  y) (x = red) (x  red) Where x and y are variables that can take.
Building “ Problem Solving Engines ” for Combinatorial Optimization Toshi Ibaraki Kwansei Gakuin University (+ M. Yagiura, K. Nonobe and students, Kyoto.
The Organizing Function. Organizing Distributing or allocating resources toward the accomplishment of the objectives defined in the plans –Requires the.
MIT and James Orlin © More Linear Programming Models.
Integer Programming Key characteristic of an Integer Program (IP) or Mixed Integer Linear Program (MILP): One or more of the decision variable must be.
Holiday Mentors Build Season Discussion December 18, 2006.
Operational Research & ManagementOperations Scheduling Workforce Scheduling 1.Days-Off Scheduling 2.Shift Scheduling 3. Cyclic Staffing Problem (& extensions)
Workforce scheduling – Days off scheduling 1. n is the max weekend demand n = max(n 1,n 7 ) Surplus number of employees in day j is u j = W – n j for.
Lecture 6 – Integer Programming Models Topics General model Logic constraint Defining decision variables Continuous vs. integral solution Applications:
Constraint Satisfaction Problems/Programming ZUI 2012/2013.
4.7 Define & Use Sequences & Series. Vocabulary  A sequence is a function whose domain is a set of consecutive integers. If not specified, the domain.
Lesson 8.1 Page #1-25(EOO), 33, 37, (ODD), 69-77(EOO), (ODD), 99, (ODD)
© J. Christopher Beck Lecture 24: Workforce Scheduling.
CP Summer School Modelling for Constraint Programming Barbara Smith 4. Combining Viewpoints, Modelling Advice.
Production Planning Basic Inventory Model Workforce Scheduling Enhance Modeling Skills Dynamic Models.
Integer LP In-class Prob
Parallel Machine Scheduling
EMIS 8373: Integer Programming Mathematical Programming Example 5: Reallocating Students to Achieve Racial Balance updated 18 January 2005.
8/14/04 J. Bard and J. W. Barnes Operations Research Models and Methods Copyright All rights reserved Lecture 6 – Integer Programming Models Topics.
Lecture 6 Knapsack Problem Quadratic Assignment Problem
Integration Substitution Method. Please integrate … You Can’t … at least not now, right?! There are several integration techniques we can employ … the.
1 Lecture 7 Linearization of a Quadratic Assignment Problem Indicator Variables.
Lecture 6 – Integer Programming Models Topics General model Logic constraint Defining decision variables Continuous vs. integral solution Applications:
N-queens problem Original problem: How to place 8 queens on an 8x8 chessboard so that no two queens attack each other N-queen problem: Generalization for.
9.1 Sequences and Series. Definition of Sequence  An ordered list of numbers  An infinite sequence is a function whose domain is the set of positive.
1 Chapter 2 Notation and Definitions Data Structures Transformations.
1 Review for Quiz 1. 2 Summations 3 Binomial expansion.
The minimum cost flow problem. Solving the minimum cost flow problem.
Assignment Problem. Concepts What is the Assignment Problem? The assignment problem deals with assigning machines to tasks, workers to jobs, soccer players.
-114- HMP654/EXECMAS Linear Programming Linear programming is a mathematical technique that allows the decision maker to allocate scarce resources in such.
Weingartner’s Horizon Model. Primal Model Description.
Constraint Satisfaction Problems/Programming ZUI 2012/2013.
1 Linear Programming Design of mathematical model.
1 Chapter 5 Branch-and-bound Framework and Its Applications.
Презентацию подготовила Хайруллина Ч.А. Муслюмовская гимназия Подготовка к части С ЕГЭ.
Nursing homework help BEST ASSIGNMENT.
Andrey Markov, public domain image
Arithmetic Sequences and Series
4.5 Locating Zeros of a Polynomial Function
Bonds Valuation Team DJS Dan DeWees Samuel Djahanbani Justin Widjaja.
Sect.R10 Geometric Sequences and Series
Employee Timetabling Contents
Presentation by Team 2.
Proposals for Research Directions
ASSIGNMENT NO.-2.
Team 1: 32 responses Team 2: 55 responses Team 3: 29 responses
פחת ורווח הון סוגיות מיוחדות תהילה ששון עו"ד (רו"ח) ספטמבר 2015
Nurse Scheduling Problems
Lecture 23: Workforce Scheduling 1
Introduction Basic formulations Applications
Sequences (9.1) February 23rd, 2017.
Year 11 Mini-Assessment 13 HIGHER Estimation.
Rounded Off Values Upper and Lower Bounds.
Box Plots.
Branch and Bound Example
Blakemore (1988) studied workers at a chemical plant in Utah who worked a three weekly schedule: the first week a night shift, the next week an evening.
Lecture 6 – Integer Programming Models

Presentation transcript:

Nurse scheduling problem 25 nurses ( Team A:13, B:12 ) Experienced nurses and new nurses 3 shifts ( day, evening, night ), meetings, days off Time span : 30 days

Nurse scheduling problem Constraints Required numbers of shifts D, E, N in each day Upper and lower bounds on the numbers of shifts and OFF’s assigned to each nurse in a month Predetermined M’s and OFF’s At least one OFF and one D in 7 days Prohibited patterns: 3 consecutive N ; 4 consecutive E ; 5 consecutive D ; D, E or M after N; D or M after E ; OFF -work- OFF N should be done in the form NN ; at least 6 days before the next NN Balance between teams A and B Many others

Nurse scheduling problem 25 nurses ( Team A:13, B:12 ) Experienced nurses and new nurses 3 shifts ( day, evening, night ), meetings, days off Time span : 30 days Formulation to CSP : Variables X ij ( nurse i, j-th day ) Domain D ij ={ D, E, N, M, OFF }