A HyFlex Module for the Personnel Scheduling Problem
|
|
- Kenneth Simpson
- 8 years ago
- Views:
Transcription
1 A HyFle Module for the Personnel Schedulin Problem Tim Curtois, Gabriela Ochoa, Matthew Hyde, José Antonio Vázquez-Rodríuez Automated Schedulin, Optimisation and Plannin (ASAP) Group, School of Computer Science, University of Nottinham, Jubilee Campus, Wollaton Road, Nottinham. NG8 BB. UK. Problem Formulation The personnel schedulin problem basically involves decidin at which times and on which days (i.e. which shifts) each employee should work over a specific plannin period. However, the personnel schedulin problem is actually a title for a roup of very similar problems. There is no eneral personnel schedulin problem. Instead there is a roup of problems with a common structure but which differ in their constraints and objectives. This creates an additional challene in implementin a problem domain module for personnel schedulin. To overcome this we have desined a data file format for which each instance can select a combination of a objectives and constraints from a wide choice. We then implemented a software framework containin all the functions for these constraints and objectives. The framework also contains methods for parsin these data files, data structures which can be used by heuristic alorithms (such as neihbourhood searches) and libraries for visualisations of instances and solutions. As mentioned, there is a lare and diverse collection of constraints and objectives that can appear in personnel schedulin problems. For eample, in one problem there may be a constraint on the maimum number of hours a nurse can work in the plannin period. In another problem thouh this constraint may be an objective. That is, the nurse is allowed to eceed a certain number of hours but the ecess should be minimised. The objective may then also be iven a priority (relative to other objectives) usin a weiht. To be able to handle all these variations yet at the same time minimise the compleity of the file format and the amount of prorammin necessary, a key desin decision was made: All constraints are modelled as weihted objectives. When modellin a problem which contains constraints, the constraints are transformed to objectives with very hih weihts. As the weiht is very hih it is simple to tell if a solution is feasible or not just by eaminin the objective function value. The overall objective function is a weihted sum of all the sub-objectives. The objectives for nurse rosterin problems can be cateorised into two roups: Coverae objectives. These objectives aim to ensure that the preferred number of employees (possibly with skills) are workin durin each shift. Minimum and maimum levels of cover can also be set.
2 Employee workin objectives. This roup of objectives relates to the individual work patterns (schedules) for each employee. They aim to maimise the employees satisfaction with their work schedules. Eample objectives within this roup include: Minimum/maimum number of hours worked. Minimum/maimum number of days on or off. Minimum/maimum number of consecutive workin days. Minimum/maimum number of consecutive days off. Minimum/maimum number of consecutive workin weekends. Minimum/maimum number of consecutive weekends off. Minimum/maimum number of shifts of a certain type. For eample niht shifts. Minimum/maimum number of consecutive shifts of a certain type. For eample consecutive niht shifts. Shift rotations. For eample early shifts after late shifts should be avoided. Satisfyin requests for specific shifts/days on or off. To provide a more formal eplanation of the problem we have included an IP model for the ORTEC0 instance. This problem was oriinally eamined in [4] and subsequently in [8]. As accordin to our format, the constraints in the oriinal formulation have been chaned to objectives. The only constraint is that each employee can only work one shift per day. Parameters: I = Set of nurses available. I t t {,2,3} Subset of nurses that work 20, 32, 36 hours per week respectively, I = I + I 2 + I 3. J = Set of indices of the last day of each week within the schedulin period = {7, 4, 2, 28, 35}. K = Set of shift types = {(early), 2(day), 3(late), 4(niht)}. K = Set of undesirable shift type successions = {(2,), (3,), (3,2), (,4), (4,), (4,2), (4,3)}. d jk = Coverae requirement of shift type k on day j, j {,...,7 J }. m i = Maimum number of workin days for nurse i. n = Maimum number of consecutive niht shifts. n 2 = Maimum number of consecutive workin days. c k = Desirable upper bound of consecutive assinments of shift type k. t = Desirable upper bound of weekly workin days for the t-th subset of nurses. h t = Desirable lower bound of weekly workin days for the t-th subset of nurses. Decision variables: = if nurse i is assined shift type k for day j, 0 otherwise The constraints are:. A nurse may not cover more than one shift each day. 2
3 k K, i I, j {,...,7 J } The objectives are formulated as (weihted w ) oals. The overall objective function is: i 6 Min G( ) w i i i, Where the oals are:. Complete weekends (i.e. Saturday and Sunday are both workin days or both off). i ] [ ( j ) k i I j J k K 2. Minimum of two consecutive non-workin days 2 ma 0, [ i ( j ) k i ( j ) k] i I j 2 k K 3. A minimum number of days off after a series of shifts. 3( ) ma 0, [ i ( j ) k i ( j ) k] i I j 2 k K 4. A maimum number of consecutive shifts of type early and late. ck r ck 4 ma 0, i I r k {,3 } j r 5. A minimum number of consecutive shifts of type early and late. 5 ma 0, i I j 2 k {,3 } i( j ) k 6. A maimum and minimum number of workin days per week. 3 J 7w 6 ma 0, t ma 0, ht t i It w j 7w 6 k K c k i( j ) k 7w j 7w 6 k K 7. A maimum of three consecutive workin days for part time nurses. 3 r 3 7( ) ma 0, 3 i I r j r k K 8. Avoidin certain shift successions (e.. an early shift after a day shift). 8 i I 9. Maimum number of workin days. j ( k, k ) K 2 ma 0, i 7 J 9 ma 0, i I j k K 0. Maimum of three workin weekends.. Maimum of three niht shifts. 0 ma 0, ma{ i ( j ) k i I j J k K ( j ) k 2, } 3 m i 3
4 i I ma 2. A minimum of two consecutive niht shifts. 2 ma 0, i I j 2 0, 7 J j i( j )4 ij4 ij4 3 i( j )4 3. A minimum of two days off after a series of consecutive niht shifts. This is equivalent to avoidin the pattern: niht shift day off day on. 3( ) ma 0, i ( j )4 i ( j ) k i I j 2 k K k K 4. Maimum number of consecutive niht shifts. n r n 4 ma 0, i I r j r 5. Maimum number of consecutive workin days. n 2 r n2 5 ma 0, i I r j r k K 6. Shift cover requirements 6 2. Solution Initialisation j k K i I ij n 4 d jk n In the HyFle framework it is necessary to implement a method for initialisin a new solution. For the personnel schedulin domain the solution is initialised usin local search heuristic 3 described in section 3. The pseudocode for this heuristic is shown in Fiure 9. It is a hill climbin heuristic which uses a neihbourhood operator which adds new shifts to the roster. 3. Heuristics In HyFle, the heuristics are classified into four cateories: Mutation : A heuristic which randomly mutates a solution. This usually returns a solution which is worse than the oriinal solution. Crossover : A heuristic which combines two solutions to produce a new solution. Usually aimin to keep some of the ood qualities of both parent solutions in the new solution. Ruin and recreate : A perturbative heuristic which chanes part of a solution (usually makin the solution worse) and then attempts to recreate/repair it. 2 4
5 Local search : A heuristic which attempts to improve the objective function value of the solution it is applied to. The new solution will not have a worse objective function value but it may be the same as the oriinal solution s value. There are also two eneral parameters which can be set (in the rane 0.0 to.0) by the hyperheuristic. They are Depth of search and Intensity of mutation. One or both of these parameters may have an effect on each heuristic. We will now describe the heuristics in each cateory currently implemented in the personnel schedulin domain. Mutation Heuristic Mutation heuristic : randomly un-assins a number of shifts, keepin a feasible solution. The number of shifts the operator un-assins is proportional to the intensity of mutation parameter. Crossover Heuristics There are currently three crossover heuristics. Crossover heuristic was presented in [3]. It operates by identifyin the best assinments in each parent and makin these assinments in the offsprin. The best assinments are identified by measurin the chane in objective function when each shift is temporarily unassined in the roster. The best assinments are those that cause the larest increase in the objective function value when they are unassined. The parameter ranes from 4-20 and is calculated usin the intensity of mutation parameter as below: = 4 + round(( - intensityofmutation) * 6) Crossover heuristic 2 was published in [5]. It creates a new roster by usin all the assinments made in the parents. It makes those that are common to both parents first and then alternately selects an assinment from each parent and makes it in the offsprin unless the cover objective is already satisfied. Crossover heuristic 3 creates the new roster by makin assinments which are only common to both parents. Local Search Heuristics A number of neihbourhood operators have been previously proposed for the personnel schedulin problem. They can be classified into three roups: Vertical swaps, Horizontal swaps and New swaps. The New swaps are so called because they introduce new shifts into the roster (or oppositely delete shifts). Eamples of these swaps are iven in Fiure and Fiure 2. 5
6 Fiure Fiure 2 Horizontal swaps move shifts in sinle employee s work pattern hence the shifts move horizontally in the roster. Eamples are iven in Fiure 3 and Fiure 4. Fiure 3 Fiure 4 Vertical swaps move shifts between two employees hence the shifts move vertically in the roster. Eamples are iven in Fiure 5 and Fiure 6. 6
7 Fiure 5 Fiure 6 For all of these neihbourhood operators it is possible to move/swap shifts over a block of adjacent days. For eample the swaps/moves shown in Fiure, Fiure 3 and Fiure 5 can be considered moves over a block of days of lenth one day. Fiure 2 and Fiure 6 show moves over blocks of lenth three days and Fiure 4 illustrates a swap usin blocks of lenth two days. The lenth of the block to test is a parameter which can be set for each neihbourhood operator. Local search heuristics -3 are hill climbers which each use one of these types of neihbourhood operator. Note that, technically they are actually hill descenders as we are minimisin the objective function, but we will use the term hill climber as it tends to be more familiar. Heuristic uses the vertical neihbourhood operator, heuristic 2 uses the horizontal neihbourhood operator and heuristic 3 uses the new neihbourhood operator. The pseudocode for these heuristics is shown in Fiure 7, Fiure 8 and Fiure 9 respectively. For each heuristic, the moves/swaps that are tested rane in size of block lenth one up to a maimum block lenth (MaBlockLenth). This parameter is set to a value of 5. Previous investiations suest that this is a ood choice with reard to the balance between solution quality and computation time (see for eample [6]).. WHILE there are untried swaps 2. FOR BlockLenth= up to MaBlockLenth 3. FOR each employee (E) in the roster 4. FOR each day (D) in the plannin period 5. FOR each employee (E2) in the roster 6. Swap all assinments between E and E2 on D up to D+BlockLenth 7. IF an improvement in roster penalty THEN 8. Break from this loop and move on to the net day 9. ELSE 0. Reverse the swap. ENDIF 2. ENDFOR 3. ENDFOR 4. ENDFOR 5. ENDFOR 6. ENDWHILE 7
8 Fiure 7 Pseudocode for 'vertical' hill climber. WHILE there are untried swaps 2. FOR BlockLenth= up to MaBlockLenth 3. FOR each employee (E) in the roster 4. FOR each day (D) in the plannin period 5. FOR D2 := D+BlockLenth, up to num days in plannin period 6. Swap all assinments for E on D up to D+BlockLenth with all assinments for E on D2 up to D2+BlockLenth 7. IF an improvement in roster penalty THEN 8. Break from this loop and move on to the net day (D+) 9. ELSE 0. Reverse the swap. ENDIF 2. ENDFOR 3. ENDFOR 4. ENDFOR 5. ENDFOR 6. ENDWHILE Fiure 8 Pseudocode for 'horizontal' hill climber. WHILE there are untried swaps 2. FOR BlockLenth= up to MaBlockLenth 3. FOR each employee (E) in the roster 4. FOR each day (D) in the plannin period 5. FOR each shift type (S) (includin day off) 6. Remove all assinments for E on D up to D+BlockLenth and assin shifts of type S to E on D up to D+BlockLenth 7. IF an improvement in roster penalty THEN 8. Break from this loop and move on to the net day (D+) 9. ELSE 0. Reverse the swap. ENDIF 2. ENDFOR 3. ENDFOR 4. ENDFOR 6. ENDFOR 7. ENDWHILE Fiure 9 Pseudocode for 'new shifts hill climber Local search heuristics 4 and 5 are variants of the variable depth search described in [6]. The first version is similar to the one presented in that paper. The main difference is that it also uses new moves such as the ones shown in Fiure and Fiure 2 as links in the ejection chain (the oriinal version only tests vertical swaps as it was oriinally desined for instances where the cover requirements were a hard constraint rather than an objective). In the second version, as well as usin the moves shown in Fiure and Fiure 2, as potential links in the ejection chains, it also tests replacin an entire work pattern for a sinle employee as a link in the chain. These patterns are enerated usin a reedy heuristic method. The maimum search time for these two heuristics is set as: the depth of search parameter multiplied by a maimum time of 5 seconds. Ruin and Recreate Heuristics The ruin and recreate heuristics implemented are based on the one presented in [4]. 8
9 Ruin and Recreate Heuristic : The heuristic works by un-assinin all the shifts in one or more randomly selected employees schedules before heuristically rebuildin them. They are rebuilt by firstly satisfyin objectives related to requests to work certain days or shifts and then by satisfyin objectives related to weekends. For eample min/ma weekends on/off, min/ma consecutive workin or non workin weekends, both days of the weekend on or off etc. Other shifts are then added to the employee s schedule in a reedy fashion, attemptin to satisfy the rest of the objectives. Finally, shifts in this schedule are then swapped/moved by hill climber heuristics which use the horizontal and new neihbourhood operators. In [4] it was observed that it was best to un-assin and rebuild only 2-6 work patterns at a time (for instances of all sizes). For this reason the first ruin and recreate heuristic unassins schedules where is calculated usin the intensity of mutation parameter as follows: = Round(intensityOfMutation * 4) + 2 Ruin and Recreate Heuristic 2: The second heuristic provides a larer chane to the solution by settin usin: = Round(intensityOfMutation * Number of employees in roster) Ruin and Recreate Heuristic 3: The third variant of the heuristic creates a small perturbation in the solution by usin =. 4. Instances The instances have been collected from a number of sources. Some of the instances are from industrial collaborators. These include: ORTEC an international consultancy and software company who specialise in workforce plannin solutions and SINTEF, the larest independent research oranisation in Scandinavia. Other instances have been provided by other researchers or taken from various publications. The collection is a very diverse data set drawn from eleven different countries. The majority of the instances are real world scenarios. Table lists the instances. As can be seen, they vary in the lenth of the plannin horizon, the number of employees and the number of shift types. Each instance also varies in the number and priority of objectives present. Instance Best known Staff Shift types Lenth (days) Ref. BCV [2, 7] BCV [2, 7] BCV [2, 7] BCV [2, 7] BCV [2, 7] BCV [2, 7] BCV [2, 7] 9
10 BCV [2, 7] BCV [2, 7] BCV [2, 7] BCV [2, 7] BCV [2, 7] BCV [2, 7] BCV [2, 7] BCV [2, 7] BCV-A [2, 7] BCV-A [2, 7] ORTEC [4] ORTEC [4] GPost GPost-B QMC QMC Ikeami-2Shift-DATA [9] Ikeami-3Shift-DATA [9] Ikeami-3Shift-DATA [9] Ikeami-3Shift-DATA [9] Millar-2Shift-DATA [9] Millar-2Shift-DATA [9] Valouis [3] WHPP [4] LLR [0] Musa 75 4 [] Ozkarahan [2] Azaiez [] SINTEF CHILD-A ERMGH-A ERMGH-B ERRVH-A ERRVH-B MER-A Table Problem Instances 0
11 The instances can be downloaded from New results, instances and other related information and software are also be published at this location. 5. Conclusion We have described the implementation of a personnel schedulin problem domain for the hyperheuristic software framework HyFle. Within this domain we have implemented a number of heuristics for this problem. These heuristics have appeared in various publications on personnel schedulin and have be shown to be successful methods. The benchmark instances available are diverse and challenin. The majority are real world and have been taken from scenarios worldwide. References. Azaiez, M.N. and S.S. Al Sharif, A 0- oal prorammin model for nurse schedulin. Computers and Operations Research, (3): pp Brucker, P., E.K. Burke, T. Curtois, R. Qu, and G. Vanden Berhe, A Shift Sequence Based Approach for Nurse Schedulin and a New Benchmark Dataset. Journal of Heuristics, Accepted for publication, Burke, E.K., P. Cowlin, P. De Causmaecker, and G. Vanden Berhe, A Memetic Approach to the Nurse Rosterin Problem. Applied Intellience, (3): pp Burke, E.K., T. Curtois, G. Post, R. Qu, and B. Veltman, A Hybrid Heuristic Orderin and Variable Neihbourhood Search for the Nurse Rosterin Problem. European Journal of Operational Research, (2): pp Burke, E.K., T. Curtois, R. Qu, and G. Vanden Berhe, A Scatter Search for the Nurse Rosterin Problem. 200, Journal of the Operational Research Society, 6: pp Burke, E.K., T. Curtois, R. Qu, and G. Vanden Berhe, A Time Predefined Variable Depth Search for Nurse Rosterin. 2007, School of Computer Science and IT, University of Nottinham. Technical Report. Available from: 7. Burke, E.K., T. Curtois, R. Qu, and G. Vanden Berhe. Problem Model for Nurse Rosterin Benchmark Instances. 2008; Available from: 8. Burke, E.K., J. Li, and R. Qu, A Hybrid Model of Inteer Prorammin and Variable Neihbourhood Search for Hihly-constrained Nurses Rosterin Problems. European Journal of Operational Research, 2008 (accepted for publication). 9. Ikeami, A. and A. Niwa, A Subproblem-centric Model and Approach to the Nurse Schedulin Problem. Mathematical Prorammin, (3): pp
12 0. Li, H., A. Lim, and B. Rodriues. A Hybrid AI Approach for Nurse Rosterin Problem. in Proceedins of the 2003 ACM symposium on Applied computin pp Musa, A. and U. Saena, Schedulin nurses usin oal-prorammin techniques. IIE transactions, : pp Ozkarahan, I. The Zero-One Goal Prorammin Model of a Fleible Nurse Schedulin Support System, in Proceedins of International Industrial Enineerin Conference. in Proceedins of International Industrial Enineerin Conference pp Valouis, C. and E. Housos, Hybrid optimization techniques for the workshift and rest assinment of nursin personnel. Artificial Intellience in Medicine, : pp Weil, G., K. Heus, P. Francois, and M. Poujade, Constraint prorammin for nurse schedulin. IEEE Enineerin in Medicine and Bioloy Maazine, (4): pp
Novel Heuristic and Metaheuristic Approaches to the Automated Scheduling of Healthcare Personnel
Novel Heuristic and Metaheuristic Approaches to the Automated Scheduling of Healthcare Personnel Timothy Curtois A thesis submitted to The University of Nottingham for the degree of Doctor of Philosophy
More informationIntelligent Search Heuristics for Cost Based Scheduling. Murphy Choy Michelle Cheong. Abstract
Intelligent Search Heuristics for Cost Based Scheduling Murphy Choy Michelle Cheong Abstract Nurse scheduling is a difficult optimization problem with multiple constraints. There is extensive research
More informationACO and PSO Algorithms Applied to Gateway Placement Optimization in Wireless Mesh Networks
2012 International Conference on Networks and Information (ICNI 2012) IPCSIT vol. 57 (2012) (2012) IACSIT Press, Sinapore DOI: 10.7763/IPCSIT.2012.V57.02 ACO and PSO Alorithms Applied to Gateway Placement
More informationReal-time Scheduling to Minimize Machine Busy Times
Real-time Schedulin to Minimize Machine Busy Times Rohit Khandekar Baruch Schieber Hadas Shachnai Tami Tamir Abstract Consider the followin schedulin problem. We are iven a set of jobs, each havin a release
More informationTraffic Efficiency Guidelines for Temporary Traffic Management
Traffic Efficiency Guidelines for Temporary Traffic Manaement Version 3.1 Final July 2013 1 Contents 1 Glossary of Terms... 3 2 Settin the Scene... 4 2.1 COPTTM TMP Principle... 4 3 Traffic Volumes...
More informationBanerjea-Brodeur, Monica (2013) Selection hyperheuristics for healthcare scheduling. PhD thesis, University of Nottingham.
Banerjea-Brodeur, Monica (2013) Selection hyperheuristics for healthcare scheduling. PhD thesis, University of Nottingham. Access from the University of Nottingham repository: http://eprints.nottingham.ac.uk/14395/1/595287.pdf
More informationA hybrid approach for solving real-world nurse rostering problems
Presentation at CP 2011: A hybrid approach for solving real-world nurse rostering problems Martin Stølevik (martin.stolevik@sintef.no) Tomas Eric Nordlander (tomas.nordlander@sintef.no) Atle Riise (atle.riise@sintef.no)
More informationA Constraint Programming based Column Generation Approach to Nurse Rostering Problems
Abstract A Constraint Programming based Column Generation Approach to Nurse Rostering Problems Fang He and Rong Qu The Automated Scheduling, Optimisation and Planning (ASAP) Group School of Computer Science,
More informationA Multiagent Based System for Resource Allocation and Scheduling of Distributed Projects
International Journal of Modelin and Optimization, Vol. 2, No., Auust 2012 A Multiaent Based System for Resource Allocation and Schedulin of Distributed Projects Sunil Adhau and M. L. Mittal Abstract In
More informationA Brief Study of the Nurse Scheduling Problem (NSP)
A Brief Study of the Nurse Scheduling Problem (NSP) Lizzy Augustine, Morgan Faer, Andreas Kavountzis, Reema Patel Submitted Tuesday December 15, 2009 0. Introduction and Background Our interest in the
More informationNurse Rostering. Jonathan Johannsen CS 537. Scheduling Algorithms
Nurse Rostering Jonathan Johannsen CS 537 Scheduling Algorithms Most hospitals worldwide create schedules for their staff by hand, spending hours trying to optimally assign workers to various wards at
More informationHPC Scheduling & Job Prioritization WHITEPAPER
HPC Schedulin & Job Prioritization WHITEPAPER HPC Schedulin & Job Prioritization Table of contents 3 Introduction 3 The Schedulin Cycle 5 Monitorin The Schedulin Cycle 6 Conclusion 2 HPC Schedulin & Job
More informationHardware Resource Allocation for Hardware/Software Partitioning in the LYCOS System
Downloaded from orbit.dtu.dk on: Feb 02, 2016 Hardware Resource Allocation for Hardware/Software Partitionin in the LYCOS System Grode, Jesper Nicolai Riis; Knudsen, Peter Voit; Madsen, Jan Published in:
More informationOn the Influence of the Prediction Horizon in Dynamic Matrix Control
International Journal of Control Science and Enineerin 203, 3(): 22-30 DOI: 0.5923/j.control.203030.03 On the Influence of the Prediction Horizon in Dynamic Matrix Control Jose Manue l Lope z-gue de,*,
More informationSIMPLIFICATION OF WATER SUPPLY NETWORK MODELS THROUGH LINEARISATION
SIMPLIFICATIO OF WATER SUPPLY ETWORK MODELS THROUGH LIEARISATIO Tobias Maschler and Draan A. Savic D.Savic@exeter.ac.uk Report umber:99/ 999 Centre for Water Systems, University of Exeter, orth Park Road,
More informationA Flexible Mixed Integer Programming framework for Nurse Scheduling
A Flexible Mixed Integer Programming framework for Nurse Scheduling Murphy Choy Michelle Cheong Abstract In this paper, a nurse-scheduling model is developed using mixed integer programming model. It is
More informationA Shift Sequence for Nurse Scheduling Using Linear Programming Problem
IOSR Journal of Nursing and Health Science (IOSR-JNHS) e-issn: 2320 1959.p- ISSN: 2320 1940 Volume 3, Issue 6 Ver. I (Nov.-Dec. 2014), PP 24-28 A Shift Sequence for Nurse Scheduling Using Linear Programming
More informationAn Organisational Perspective on Collaborative Business Processes
An Oranisational Perspective on Collaborative Business Processes Xiaohui Zhao, Chenfei Liu, and Yun Yan CICEC - Centre for Internet Computin and E-Commerce Faculty of Information and Communication Technoloies
More informationSolving Equations and Inequalities Graphically
4.4 Solvin Equations and Inequalities Graphicall 4.4 OBJECTIVES 1. Solve linear equations raphicall 2. Solve linear inequalities raphicall In Chapter 2, we solved linear equations and inequalities. In
More informationA Privacy Mechanism for Mobile-based Urban Traffic Monitoring
A Privacy Mechanism for Mobile-based Urban Traffic Monitorin Chi Wan, Hua Liu, Bhaskar Krishnamachari, Murali Annavaram Tsinhua University, Beijin, China sonicive@mail.com University of Southern California,
More informationBespoke Shuffled Frog Leaping Algorithm and its Engineering Applications
I.J. Intellient Systems and Applications, 5,, - Published Online March 5 in MECS (http://www.mecs-press.or/ DOI:.585/ijisa.5.. Bespoke Shuffled Fro Leapin Alorithm and its Enineerin Applications Anura
More informationTWO-PHASE SAMPLING OF TAX RECORDS FOR BUSINESS SURVEYS
TWO-PHASE SAMPLING OF TAX RECORDS FOR BUSINESS SURVEYS KEY WORDS: optimal allocation, convex prorammin, efficiency 1. Introduction In the last few years, there has been an increase in the use of administrative
More informationEfficient and Provably Secure Ciphers for Storage Device Block Level Encryption
Efficient and Provably Secure Ciphers for Storae Device Block evel Encryption Yulian Zhen SIS Department, UNC Charlotte yzhen@uncc.edu Yone Wan SIS Department, UNC Charlotte yonwan@uncc.edu ABSTACT Block
More informationRISK ASSESSMENT OF LIFE INSURANCE CONTRACTS: A COMPARATIVE STUDY IN A LÉVY FRAMEWORK
RISK ASSESSMENT OF LIFE INSURANCE CONTRACTS: A COMARATIVE STUDY IN A LÉVY FRAMEWORK Nadine Gatzert University of St. Gallen, Institute of Insurance Economics, Kirchlistrasse, 9010 St. Gallen, Switzerland,
More informationA KERNEL MAXIMUM UNCERTAINTY DISCRIMINANT ANALYSIS AND ITS APPLICATION TO FACE RECOGNITION
A KERNEL MAXIMUM UNCERTAINTY DISCRIMINANT ANALYSIS AND ITS APPLICATION TO FACE RECOGNITION Carlos Eduardo Thomaz Department of Electrical Enineerin, Centro Universitario da FEI, FEI, Sao Paulo, Brazil
More informationStrategies for Reducing the Risk of ecommerce Fraud
October 2010 Strateies for Reducin the Risk of ecommerce Fraud Fraud techniques are constantly evolvin, and new data breaches are reported every day are your online security practices adaptin rapidly enouh?
More informationA Survey on Privacy Preserving Decision Tree Classifier
A Survey on Classifier Tejaswini Pawar*, Prof. Snehal Kamalapur ** * Department of Computer Enineerin, K.K.W.I.E.E&R, Nashik, ** Department of Computer Enineerin, K.K.W.I.E.E&R, Nashik, ABSTRACT In recent
More informationON AN APPROACH TO STATEMENT OF SQL QUESTIONS IN THE NATURAL LANGUAGE FOR CYBER2 KNOWLEDGE DEMONSTRATION AND ASSESSMENT SYSTEM
216 International Journal "Information Technoloies & Knowlede" Volume 9, Number 3, 2015 ON AN APPROACH TO STATEMENT OF SQ QUESTIONS IN THE NATURA ANGUAGE FOR CYBER2 KNOWEDGE DEMONSTRATION AND ASSESSMENT
More informationHow To Write A Mathematical Model Of Ship Hydrodynamics In An Inland Shiphandlin Simulator Of Smu Insim
Scientific Journals Maritime University of Szczecin Zeszyty Naukowe Akademia Morska w Szczecinie 14, 37(19) pp. 1 15 14, 37(19) s. 1 15 ISSN 1733-867 Ship manoeuvrin hydrodynamics in a new inland shiphandlin
More informationTechnical Report Documentation Page 2. Government Accession No. 3. Recipient s Catalog No.
1. Report No. Technical Report Documentation Pae 2. Government Accession No. 3. Recipient s Catalo No. FHWA/TX-03/4386-1 4. Title and Subtitle DEVELOPMENT OF A TOOL FOR EXPEDITING HIGHWAY CONSTRUCTION
More informationTotal Portfolio Performance Attribution Methodology
Total ortfolio erformance Attribution Methodoloy Morninstar Methodoloy aper May 31, 2013 2013 Morninstar, Inc. All rihts reserved. The information in this document is the property of Morninstar, Inc. Reproduction
More informationOptime: Integrating Research Expertise with Institutional Requirements
Optime: Integrating Research Expertise with Institutional Requirements Edmund K. Burke 1,3, Graham Kendall 1,3, Barry McCollum 2,3, Paul McMullan 2,3, Jim Newall 3 1 School of Computer Science and IT University
More informationAdaptive Learning Resources Sequencing in Educational Hypermedia Systems
Karampiperis, P., & Sampson, D. (2005). Adaptive Learnin Resources Sequencin in Educational Hypermedia Systems. Educational Technoloy & Society, 8 (4), 28-47. Adaptive Learnin Resources Sequencin in Educational
More informationFitness Evaluation for Nurse Scheduling Problems
Fitness Evaluation for Nurse Scheduling Problems Edmund K. Burke University of Nottingham School of Computer Science & IT Nottingham NG8 1BB, UK ekb@cs.nott.ac.uk Patrick De Causmaecker KaHo St.-Lieven
More informationSolving on-premise email management challenges with on-demand services
Solvin on-premise email manaement challenes with on-demand services Dell IT Manaement Software as a Service 1 Applications Business Process Consultin Infrastructure Support Introduction The rowin reliance
More informationThe Application of Bayesian Optimization and Classifier Systems in Nurse Scheduling
The Application of Bayesian Optimization and Classifier Systems in Nurse Scheduling Proceedings of the 8th International Conference on Parallel Problem Solving from Nature (PPSN VIII), LNCS 3242, pp 581-590,
More informationAEROSOL STATISTICS LOGNORMAL DISTRIBUTIONS AND dn/dlogd p
Concentration (particle/cm3) [e5] Concentration (particle/cm3) [e5] AEROSOL STATISTICS LOGNORMAL DISTRIBUTIONS AND dn/dlod p APPLICATION NOTE PR-001 Lonormal Distributions Standard statistics based on
More informationAn Advanced Model and Novel Meta-heuristic Solution Methods to Personnel Scheduling in Healthcare. Greet Vanden Berghe
An Advanced Model and Novel Meta-heuristic Solution Methods to Personnel Scheduling in Healthcare Greet Vanden Berghe 2 Contents I The Nurse Rostering Problem 21 1 Introduction 23 2 Problem Description
More informationCase-Based Reasoning as a Heuristic Selector in a Hyper-Heuristic for Course Timetabling Problems
Knowledge-Based Intelligent Information Engineering Systems and Allied Technologies, Volume 82. Proceedings of KES'02, 336-340. Sep, 2002 Case-Based Reasoning as a Heuristic Selector in a Hyper-Heuristic
More informationIN the last decade, vehicular ad-hoc networks (VANETs) Prefetching-Based Data Dissemination in Vehicular Cloud Systems
1 Prefetchin-Based Data Dissemination in Vehicular Cloud Systems Ryansoo Kim, Hyuk Lim, and Bhaskar Krishnamachari Abstract In the last decade, vehicular ad-hoc networks VANETs have been widely studied
More informationBPO. COMPEtitive BUSINESS PROCESS
BPO BUSINESS PROCESS outsourcin COMPEtitive INTELlience SmartBPO is a unique, innovative business process outsourcin (BPO) and competitive intellience model that helps companies to simplify their operations
More informationA Constraint Programming Application for Rotating Workforce Scheduling
A Constraint Programming Application for Rotating Workforce Scheduling Markus Triska and Nysret Musliu Database and Artificial Intelligence Group Vienna University of Technology {triska,musliu}@dbai.tuwien.ac.at
More informationGenerating Personnel Schedules in an Industrial Setting Using a Tabu Search Algorithm
Generating Personnel Schedules in an Industrial Setting Using a Tabu Search Algorithm Pascal Tellier 1 and George White 2 1 PrairieFyre Software Inc., 555 Legget Dr., Kanata K2K 2X3, Canada pascal@prairiefyre.com
More informationLightSweep. Modular Lighting Control System. imagination at work. Description. Specifications
Lihtin Controls LihtSweep Modular Lihtin Control System GE s modular indoor lihtin control solution is scalable and hihly flexible makin it easier to meet specification without havin to over-enineer the
More informationSafety & Environmental Assurance Centre
International Commission on Microbioloical Specifications for Foods (ICMSF) Outline Workin with Risk-based Metrics in the Food Industry LEON GORRIS Risk-based food safety manaement Risk Analysis & Microbioloical
More informationGRANULAR MODELLING OF EXAM TO SLOT ALLOCATION Siti Khatijah Nor Abdul Rahim 1, Andrzej Bargiela 1, Rong Qu 2 1 School of Computer Science
GRANULAR MODELLING OF EXAM TO SLOT ALLOCATION Siti Khatijah Nor Abdul Rahim 1, Andrzej Bargiela 1, Rong Qu 2 1 School of Computer Science University of Nottingham, Malaysia Campus E-mail: abb@cs.nott.ac.uk,
More informationRoulette wheel Graph Colouring for Solving Examination Timetabling Problems
Roulette wheel Graph Colouring for Solving Examination Timetabling Problems Nasser R. Sabar 1, Masri Ayob 2, Graham Kendall 3 and Rong Qu 4 1, 2 Jabatan Sains Komputer, Fakulti Teknologi dan Sains Maklumat,
More informationTechnical Publication
Technical Publication Advancin Thermal Mass Gas Flow Meters By Gerardo Varas, Sr. Member Technical Staff Fluid Components International (FCI) Visit FCI online at www.fluidcomponents.com FCI is ISO 9001:2000
More informationListwise Approach to Learning to Rank - Theory and Algorithm
Fen Xia* fen.xia@ia.ac.cn Institute of Automation, Chinese Academy of Sciences, Beijin, 100190, P. R. China. Tie-Yan Liu tyliu@microsoft.com Microsoft Research Asia, Sima Center, No.49 Zhichun Road, Haidian
More informationDesigning Difficult Office Space Allocation Problem Instances with Mathematical Programming
Designing Difficult Office Space Allocation Problem Instances with Mathematical Programming Özgür Ülker and Dario Landa-Silva Automated Scheduling, Optimisation and Planning (ASAP) Research Group School
More informationHYBRID GENETIC ALGORITHMS FOR SCHEDULING ADVERTISEMENTS ON A WEB PAGE
HYBRID GENETIC ALGORITHMS FOR SCHEDULING ADVERTISEMENTS ON A WEB PAGE Subodha Kumar University of Washington subodha@u.washington.edu Varghese S. Jacob University of Texas at Dallas vjacob@utdallas.edu
More informationInternet Connectivity for Mobile Ad Hoc Networks Using Hybrid Adaptive Mobile Agent Protocol
The International Arab Journal of Information Technoloy, Vol. 5, No. 1, January 2008 25 Internet Connectivity for Mobile Ad Hoc Networks Usin Hybrid Adaptive Mobile Aent Protocol Velmuruan Ayyadurai 1
More information(General article) Ethical Issues in Advertising. Rahul Singal a* & Geeta Kamra a. a CSE Deptt. OITM. Accepted 7 July 2012, Available online 1Sept 2012
ijesm www.ijesm.com International Journal of Enineerin, Science and Metallury (General article) Ethical Issues in Rahul Sinal a* & Geeta Kamra a a CSE Deptt. OITM Accepted 7 July 2012, Available online
More informationVariety Gains from Trade Integration in Europe
Variety Gains from Trade Interation in Europe d Artis Kancs a,b,c,, Damiaan Persyn a,b,d a IPTS, European Commission DG Joint Research Centre, E-41092 Seville, Spain b LICOS, University of Leuven, B-3000,
More informationDELEG8. Infrastructure Project Specialists
DELEG8 Infrastructure Project Specialists CAPABILITY STATEMENT 2015 ABOUT US Who are Dele8 Dele8 is a specialist team of experienced enineerin professionals who provide manaement, advisory and technical
More information1.Unisex Provision : Desin Criteria (see diaram on p.3) The cubicle must meet the followin criteria: Measure at least 2.2 m by 1.5m with an outward op
dds 12 Toilets Key Principles Accessible unisex toilets must always be available which are suitable for all the disabled people usin the buildin, in accordance with section one below. Separately, any sinle
More informationSave thousands with the complete e-document distribution solution
Albany econnect Save thousands with the complete e-document distribution solution The UK s leadin provider of electronic document distribution software Since 1989, Albany Software has been developin software
More informationChapter. The Role of the Paralegal
Chapter ONE The Role of the Paraleal The Lawyer-Paraleal Relationship Paraleals today perform many tasks that once were performed only by lawyers, such as preparin, filin, or producin documents. Law firms
More informationRelaxation of Coverage Constraints in Hospital Personnel Rostering
Relaxation of Coverage Constraints in Hospital Personnel Rostering Patrick De Causmaecker, Peter Demeester and Greet Vanden Berghe KaHo St.-Lieven, Information Technology, Gebr. Desmetstraat 1, 9000 Gent,
More informationEVALUATING THE IMPACTS OF WIND FARMS ON POWER SYSTEM OPERATION GÜÇ SİSTEMİ ÜZERİNDE RÜZGAR SANTRALLERİNİN ETKİLERİNİN DEĞERLENDİRİLMESİ
Journal of Naval Science and Enineerin 2010, Vol. 6, No.2, pp. 166-185 EVALUATING THE IMPACTS OF WIND FARMS ON POWER SYSTEM OPERATION Ph.D.Özür Salih MUTLU, Lt. Ministry of National Defence, İzmir Construction
More informationS i m p l i c i t y c o n t r o l P o w e r. Alcatel-Lucent OmniTouch Contact Center Premium Edition
Alcatel-Lucent OmniTouch Contact Center Premium Edition Enablin onoin visual trackin of contact center activities S i m p l i c i t y c o n t r o l P o w e r Can you UNDERSTAND, ANTICIPATE and RESPOND
More informationLEADERSHIP DEVELOPMENT FRAMEWORK. Program Bulletin
LEADERSHIP DEVELOPMENT FRAMEWORK Proram Bulletin Prorams for Leadership Development The NBOGroup Leadership Development prorams provide emerin, middle and senior manaement an opportunity to be the chane
More informationAmerican Fidelity Assurance Company s. Long Term Care. Insurance. Life on Your Terms
American Fidelity Assurance Company s Lon Term Care Insurance Life on Your Terms Life on Your Terms What is Lon Term Care? Lon Term Care insurance helps protect your financial independence should you ever
More informationThe Projman Application: Allowing SAS to Manage Your Project Jon Patton, Miami University, Oxford, Ohio
1 Abstract Paper TU13 The Projman Application: Allowin SAS to Manae Your Project Jon Patton, Miami University, Oxford, Ohio SAS/OR software has four major procedures that can be used to manae your projects.
More informationFramework for negotiation in Distributed Nurse Rostering Problems
Framework for negotiation in Distributed Nurse Rostering Problems Stefaan Haspeslagh 1, Patrick De Causmaecker 1, and Greet Vanden Berghe 2 1 K.U.Leuven Campus Kortrijk, Department of Computer Science,
More informationTSM ASSESSMENT PROTOCOL
TSM ASSESSMENT PROTOCOL A Tool for Assessin External Outreach Performance Introduction Launched in 2004, Towards Sustainable Minin (TSM) is an initiative of the Minin Association of Canada desined to enhance
More informationPrice as Indicator for Quality?
Price as Indicator for Quality? by Jøren Drud Hansen and Jøren Ulff-Møller Nielsen Department of Economics Aarhus School of Business University of Aarhus Denmark Abstract This paper examines the relation
More information1 Introduction. 2 Electric Circuits and Kirchoff s Laws. J.L. Kirtley Jr. 2.1 Conservation of Charge and KCL
Massachusetts Institute of Technoloy Department of Electrical Enineerin and Computer Science 6.061 Introduction to Power Systems Class Notes Chapter 6 Manetic Circuit Analo to Electric Circuits J.L. Kirtley
More informationDebit or Credit You Decide A lesson on payment methods
A lesson on payment methods Lesson by Lis Turner, Federal Reserve Bank of Richmond Lesson Description In early aricultural societies, farmers often bouht oods or services usin credit and paid for them
More informationSTUDY OF PROJECT SCHEDULING AND RESOURCE ALLOCATION USING ANT COLONY OPTIMIZATION 1
STUDY OF PROJECT SCHEDULING AND RESOURCE ALLOCATION USING ANT COLONY OPTIMIZATION 1 Prajakta Joglekar, 2 Pallavi Jaiswal, 3 Vandana Jagtap Maharashtra Institute of Technology, Pune Email: 1 somanprajakta@gmail.com,
More informationPersonnel Scheduling: Models and Complexity
Noname Personnel Scheduling: Models and Complexity Peter Brucker Rong Qu Edmund Burke Abstract Due to its complexity, its challenging features, and its practical relevance, personnel scheduling has been
More informationA High Productivity/Low Maintenance Approach to Highperformance Computation for Biomedicine: Four Case Studies
90 CARRIERO ET AL., Facilitatin HPC in Biomedicine Case Report j A Hih Productivity/Low Maintenance Approach to Hihperformance Computation for Biomedicine: Four Case Studies NICHOLASCARRIERO,PHD, MICHAEL
More information1 Background. 2 Martin C. Rinard
Journal of Prorammin Lanuaes 6 (199), 1 35 Implicitly synchronized abstract data types: data structures for modular parallel prorammin Martin C. Rinard Department of Computer Science, University of California
More informationAn Integer Programming Model for the School Timetabling Problem
An Integer Programming Model for the School Timetabling Problem Geraldo Ribeiro Filho UNISUZ/IPTI Av. São Luiz, 86 cj 192 01046-000 - República - São Paulo SP Brazil Luiz Antonio Nogueira Lorena LAC/INPE
More informationHewlett-Packard 12C Tutorial
To bein, look at the ace o the calculator. Every key (except the arithmetic unction keys in the ar riht column and the ive keys on the bottom let row) has two or three unctions: each key s primary unction
More informationScheduling Algorithm with Optimization of Employee Satisfaction
Washington University in St. Louis Scheduling Algorithm with Optimization of Employee Satisfaction by Philip I. Thomas Senior Design Project http : //students.cec.wustl.edu/ pit1/ Advised By Associate
More informationLECTURE - 3 RESOURCE AND WORKFORCE SCHEDULING IN SERVICES
LECTURE - 3 RESOURCE AND WORKFORCE SCHEDULING IN SERVICES Learning objective To explain various work shift scheduling methods for service sector. 8.9 Workforce Management Workforce management deals in
More informationHow To Write A Report In Xbarl
XBRL Generation, as easy as a database. Christelle BERNHARD - christelle.bernhard@addactis.com Consultant & Deputy Product Manaer of ADDACTIS Pillar3 Copyriht 2015 ADDACTIS Worldwide. All Rihts Reserved
More informationProjectile Motion THEORY. r s = s r. t + 1 r. a t 2 (1)
Projectile Motion The purpose of this lab is to study the properties of projectile motion. From the motion of a steel ball projected horizontally, the initial velocity of the ball can be determined from
More informationOccupational segregation of immigrant women in Spain
Workin Paper Series Occupational sereation of immirant women in Spain Coral del Río Ola Alonso-Villar ECINEQ WP 2010 165 ECINEQ 2010-165 March 2010 www.ecineq.or Occupational sereation of immirant women
More informationWeb Conferencing, Q2 2006
Vendor card: WebEx Communications Weihtin CURRENT OFFERING 5% 4.36 Architecture What is the product's architecture? these subattributes: Cross-platform support, Browser support, Plu-ins, and Firewall penetration.
More informationDecimal Fractions. Decimal Fractions. Curriculum Ready. www.mathletics.com
Decimal Fractions Curriculum Ready www.mathletics.com Decimal fractions allow us to be more accurate with our calculations and measurements. Because most of us have ten finers, it is thouht that this
More informationResearch Article Well Screen and Optimal Time of Refracturing: A Barnett Shale Well
Journal of Petroleum Enineerin Volume 13, Article ID 81793, 1 paes http://dx.doi.or/1.1155/13/81793 Research Article Well Screen and Optimal Time of Refracturin: A Barnett Shale Well Shayan Tavassoli,
More informationEmployers of Yavapai College 2004-05 Nursing Graduates Executive Summary Conducted Summer 2006
Employers of Yavapai Collee 00-0 Nursin Graduates Executive Summary Conducted Summer 00 Nursin and Allied Health Proram Christine Witbeck, Interim Division Assistant Dean The Office of Academic Affairs
More informationAchieving Dramatic Improvements in Financial Operations through BPM
Achievin Dramatic Improvements in Financial Operations throuh BPM Easy to Deploy Technoloy Quickly Fills Gaps and Replaces Manual Processes Published February 2011 Executive Summary This paper is intended
More informationTHE SIMPLE PENDULUM. Objective: To investigate the relationship between the length of a simple pendulum and the period of its motion.
THE SIMPLE PENDULUM Objective: To investiate the relationship between the lenth of a simple pendulum and the period of its motion. Apparatus: Strin, pendulum bob, meter stick, computer with ULI interface,
More informationHow many i s in Art? the Interna5onal, Intersectoral and Interdisciplinary Dimensions in Ar5s5c Doctorates in Music Jeremy Cox AEC Chief Execu5ve
How many i s in Art? the Interna5onal, Intersectoral and Interdisciplinary Dimensions in Ar5s5c Doctorates in Music Jeremy Cox AEC Chief Execu5ve About the AEC: The Association Académies de Musique is
More informationthermometer as simple as a styrofoam cup and a thermometer. In a calorimeter the reactants are placed into the
Thermochemistry Readin assinment: Chan, Chemistry 10 th edition, pp. 249-258. Goals We will become familiar with the principles of calorimetry in order to determine the heats of reaction for endothermic
More informationOptimised Realistic Test Input Generation
Optimised Realistic Test Input Generation Mustafa Bozkurt and Mark Harman {m.bozkurt,m.harman}@cs.ucl.ac.uk CREST Centre, Department of Computer Science, University College London. Malet Place, London
More informationOptimising Patient Transportation in Hospitals
Optimising Patient Transportation in Hospitals Thomas Hanne 1 Fraunhofer Institute for Industrial Mathematics (ITWM), Fraunhofer-Platz 1, 67663 Kaiserslautern, Germany, hanne@itwm.fhg.de 1 Introduction
More informationCyclic preference scheduling of nurses using a Lagrangian-based heuristic
J Sched (2007) 10:5 23 DOI 10.1007/s10951-006-0323-7 Cyclic preference scheduling of nurses using a Lagrangian-based heuristic Jonathan F. Bard Hadi W. Purnomo C Science + Business Media, LLC 2007 Abstract
More informationChapter 6 A Case Study: The Eiht Queens Puzzle This chapter presents the ærst of several case studies èor paradims, in the oriinal sense of the wordè of prorams written in an object-oriented style. The
More informationAbstract Title: Planned Preemption for Flexible Resource Constrained Project Scheduling
Abstract number: 015-0551 Abstract Title: Planned Preemption for Flexible Resource Constrained Project Scheduling Karuna Jain and Kanchan Joshi Shailesh J. Mehta School of Management, Indian Institute
More information5 INTEGER LINEAR PROGRAMMING (ILP) E. Amaldi Fondamenti di R.O. Politecnico di Milano 1
5 INTEGER LINEAR PROGRAMMING (ILP) E. Amaldi Fondamenti di R.O. Politecnico di Milano 1 General Integer Linear Program: (ILP) min c T x Ax b x 0 integer Assumption: A, b integer The integrality condition
More informationBusiness Agility in the Mobile Age
Business Aility in the Mobile Ae Published Auust 2011 Executive Summary Movement towards the mobile enterprise is ainin momentum based on the clear business value afforded by better leverain today s increasinly
More informationHow To Design An Integrated Workforce Management System
PATAT 2010 Towards an Integrated Workforce Management System Dario Landa-Silva Arturo Castillo Leslie Bowie Hazel Johnston Received: 30 May 2010 Abstract We describe progress towards a workforce management
More informationBridging the gap between self schedules and feasible schedules in staff scheduling
Bridging the gap between self schedules and feasible schedules in staff scheduling Eyjólfur Ingi Ásgeirsson Abstract Every company that has employees working on irregular schedules must deal with the difficult
More informationA FRAMEWORK FOR MONITORING PROGRAM EXECUTION
A FRAMEWORK FOR MONITORING PROGRAM EXECUTION Clinton Lewis Jeffery TR 93-21 July 30, 1993 Department of Computer Science The University of Arizona Tucson, Arizona 85721 This work was supported in part
More informationThe exact probability distribution of the rank product statistics for replicated experiments
The exact probability distribution of the rank product statistics for replicated experiments Rob Eisina a,*, Rainer Breitlin b, Tom Heskes c FEBS Letters, 2013, 587: 677-682 doi:10.1016/j.febslet.2013.01.037
More informationChapter 28B - EMF and Terminal P.D. A PowerPoint Presentation by Paul E. Tippens, Professor of Physics Southern Polytechnic State University
Chapter 28B - EMF and Terminal P.D. A PowerPoint Presentation by Paul E. Tippens, Professor of Physics Southern Polytechnic State University 2007 Objectives: After completin this module, you should be
More information