Reactive Scheduling in Practice
|
|
- Herbert Parks
- 6 years ago
- Views:
Transcription
1 Reactive Scheduling in Practice Petridis Iason School of Mechanical Engineering National Technical University of Athens Athens, Greece Rokou Elena School of Mechanical Engineering National Technical University of Athens Athens, Greece Kirytopoulos Konstantinos School of Natural and Built Environments Barbara Hardy Institute University of South Australia Adelaide, Australia Abstract Uncertainty is inherent in project management, most, if not all, project schedules tend to get disrupted and are therefore in need of rescheduling in order to continue. The use of normal scheduling methods in such cases tends to create new schedules that are either too different from the baseline schedule or relatively unstable to further disruptions. The objective of this paper is to propose a reactive scheduling process that may be used to revise or re-optimize a previously developed baseline schedule when unexpected events occur, taking in consideration the existing schedule and the work already done or currently in progress. The proposed approach is based on a hybrid algorithm that combines genetic algorithms with simulated annealing and particle swarm optimization and aims at providing quick response and multiple solution scenarios to the project manager so as to efficiently handle the experienced or forecasted disruptions. KEYWORDS Project scheduling, reactive scheduling, genetic algorithm, RCPSP. 1. INTRODUCTION The vast majority of the research efforts in project scheduling over the past several years has concentrated on the development of exact and suboptimal processes for the generation of a baseline schedule assuming complete information and a deterministic environment (Herroelen and Leus 2004). In practice, during execution, projects are often subject of considerable uncertainty, which may lead to numerous minor or major schedule disruptions. In project scheduling, uncertainty can take many different forms. Activity duration estimates may be poor, resources may become unavailable (e.g. break down, illness, etc.), work may be interrupted due to weather conditions, new unanticipated activities may be added due to changes in project s scope, etc. All of these types of uncertainty may result in the violation of the project baseline schedule. In general, project management wants to avoid these schedule deviations. This can be achieved by generating a baseline schedule in a proactive way, trying to anticipate certain types of disruptions so as to minimize their effect if they occur. If the schedule would still break down despite these proactive planning efforts, a reactive scheduling policy will be needed to repair the infeasible schedule (Deblaere et al. 2011). The objective of this paper is to propose a reactive scheduling process that may be used to revise or reoptimize a previously developed baseline schedule when unexpected events occur. More precisely, given a baseline scheduling that has been followed and updated with actual data from the project manager in a timely manner, we assume that at a specific point in time, one or more disruptions on the schedule have been noticed or even forecasted due to new data and/or changes of one or more environmental variables. For example, a shortage of materials is expected due to upcoming strikes. In this case, the developed 10
2 baseline schedule becomes infeasible during project execution, due to the occurrence of one or more resource or activity disruptions. Therefore, we need a reactive policy that dictates how to revert to a feasible schedule that deviates as little as possible from the original baseline and resolves the schedule infeasibilities caused by the disturbances that occurred during schedule execution. This paper describes a new heuristic for reactive project scheduling that may be used to repair multi-mode resource-constrained project baseline schedules with variable resource availabilities and requirements that suffer from multiple activity durations and/or resource disruptions during project execution. The aim is to generate a new schedule that it is adapted to the emerged situations that are time and resource disruptions, not only taking into consideration the baseline schedule but also trying to minimize the deviations from it. The proposed approach is based on a genetic algorithm that moderates the schedule generation process which aims at providing quick response and multiple solution scenarios to the project manager so as to efficiently handle the experienced or forecasted disruptions. Finally, we discuss the computational results obtained by applying the proposed approach on a set of randomly generated project instances and on an illustrative example based on an actual construction project. More specifically, the rest of this paper is organized as follows: in Section 2, a brief review of the problem s domain and the solutions proposed in the literature is presented. In Section 3, the proposed method is in depth analyzed. In Section 4, the design of the experiment used to verify the applicability and effectiveness of the proposed method along with the preliminary computational results are presented. Section 5, concludes the paper. 2. LITERATURE REVIEW The classical Resource-Constraint Project Scheduling Problem (RCPSP) has been studied and developed extensively over the last decades (Demeulemeester and Herroelen 2002). In RCPSP we have a project of n real activities, that represent actual work, plus 2 dummy activities, that represent the start and finish of the project. This specific problem is constrained both by time and resource availability. The time constraint is created by the relationships between each activity and the durations of the activities. For example, when an activity j has a start to finish relationship with an activity i, then j cannot begin before i has finished. Therefore, if activity i has a duration of d and has started at time S i then activity j cannot be scheduled before S i + d. The resource constraints have as source the relation between the availability of a resource type at a given time and the resource demand of all the activities being executed at that time based on a specific project schedule. For example, a resource k has an availability of R kt at time t and an activity j requires r kj amount of that resource at that time. Activity j should be scheduled at time t if and only if R kt r kj. The RCPSP can be solved keeping in mind those two constrain types in order to create an activity schedule for a specific project. Usually, the variables of the constraints are deterministic, having been estimated up to a specific error margin by the project management. Because the variables of duration, resource need and resource availability are based on estimation, they may change during the project span. Changes like those create disruptions on the flow of the schedule that must be addressed quickly in order for the project to resume. Reactive scheduling is the use of a reactive procedure in order to create a new schedule that is feasible after having been adapted to the new information given by the disruptions (Deblaere et al. 2011). There are multiple types of reactive scheduling, such as schedule repair and rescheduling (Herroelen and Leus 2004). Schedule repair is the easiest method of reactive scheduling, which involves simple control rules like the right-shift rule ((Sadeh et al. 1993), (Smith 1995)), where the activities are simply shifted to future dates to 11
3 accommodate the changes caused by the disruptions without any additional change to optimize the schedule of the remaining activities. This method can lead to poor results, as it does not re-sequence activities, at all. Rescheduling on the other hand, generates a totally new schedule based on the newly emerged circumstances. Because of that you may get as result a schedule that differs considerably from the baseline schedule which can raise issues related for example to previously scheduled deliveries of materials or rental of equipment and usage of external sub-contractors.. Frequent rescheduling can result in instability and lack of continuity in detailed plans. For that reason many researchers prefer reactive procedures that change schedules locally to global regeneration of the schedule. A very well accepted approach, focusing on processing time uncertainties, refers to the development of efficient and effective procedures that can be used during project execution to repair the initial project schedule when needed (Van de Vonder et al. 2007). The four reactive procedures are: priority list scheduling, fixed resource allocation, sampling and weighted earliness-tardiness WET. Priority list scheduling consists of two distinct priority rules, the static priority rule and the dynamic priority rule to create the equivalent list. Those rules are used to order the activities of a project into a list that is in turn used as the order in which the activities are to be scheduled. The Fixed Resource Allocation relies on the procedure developed by Artigues et al. (2003) and generates a feasible resource flow network, which shows how the resources are passed on among the activities, by extending a parallel schedule generation scheme. The Sampling approach consists of two reactive scheduling schemes that rely on different priority lists combined with different schedule generation schemes, basic sampling and time-window sampling. The heuristic WET procedure is a customized version of a population-based iterated local search algorithm for the weighted earliness-tardiness RCPSP with minimum and maximum time lags described in Ballestin and Trautman (2006) which is an adapted version of the procedure based on the metaheuristic Iterated Local Search (Lourenço et al. 2001) that omits some of the original features in order to reduce the computational requirements of the algorithm. Reactive procedures can also be tree-based exact search techniques instead of mathematical algorithms (Deblaere et al. 2011), that are similar to those devised for solving the basic MRCPSP. In this class falls the branching scheme procedure proposed by Deblaere et al (2011) that is based on mode and delaying alternatives. In the same class is the lower bound method, where after a first feasible solution has been found (upper bound), we work backwards on the search tree to find a new path that will lead to a better solution (lower bound), and the usage of dominance like the data reduction (Sprecher et al. 1997), the left-shift (Hartmann and Drexl 1998), (Demeulemeester and Herroelen 1992), the cutset (Demeulemeester and Herroelen 1992, Demeulemeester and Herroelen 2000, Hartmann and Drexl 1998)and the resource infeasibility (Deblaere et al. 2008). Finally, there are the search strategies, like regular branch-and-bound algorithms as well as a branch-and-bound with tabu search (Glover 1989, Glover 1990), iterative deepening A* or IDA (Korf 1985) as well as a binary search procedures. Summarizing, the solution methods that have been most commonly used for reactive scheduling are either based on priority rules or on algorithms computing local optimum solutions, in order to find a feasible new schedule. On this paper we are introducing a hybrid genetic algorithm based procedure in order to find the best overall solution to the new schedule. 3. SUGGESTED METHOD The solution method (Figure 1) introduced on this paper has three distinct stages of operations: 1. Creation of a subproject 2. Hybrid Genetic algorithm (GA) on the subproject 3. Scheduling of the subproject and optimization by comparing it to the baseline. 12
4 Since we are working on a reactive procedure, it is logical to infer that part of the original baseline schedule will be already completed. Because of that, it is required before starting the process of scheduling the unfinished activities to remove from the project the activities that have already been completed either fully or partially. This raises the question what will happen to the partially completed activities? The subproject is actually the answer to this question. The project manager is responsible for deciding whether the activities that are partially completed will be continued immediately after the disruptions or will be split and therefore can be scheduled at a later date on a best fit basis. The splitting of an activity although it might produce better results mathematically, might create problems for the project itself in practical situations, e.g. changing worker schedules, storing materials for a longer period, etc., therefore should be left to the project manager and even more should not be a per project decision but per activity, to accommodate the specific characteristics of each activity. After the subproject has been created the newly created input is passed to the hybrid GA in order to search for a near optimal solution. It should be noted that in reactive scheduling there are two optimization objectives, the minimization of the total duration of the remaining project ( subproject )the minimization of the deviations from the baseline schedule.. The hybrid GA used on this paper is based on the algorithm proposed by Hartmann (1998). The chromosome of the GA is an n+1-sized vector, where n is the number of activities in the subproject. The first gene (0) of the chromosome is used to represent the solution algorithm (GA, SA, PSO) that will be used for the rest of the activity list. The 1..n+1 genes of the chromosome represent an activity and the sequence of the genes is the scheduling priority of the activities. Also we are using the 2-point crossover, as it has been found to provide better shuffling of the genes (Hartmann, 1998). For the first generation of parents for the algorithm we are using randomly generated feasible schedules. For the selection of chromosomes between parents and offspring a fitness based selection is used. The fitness is calculated by the following formula: where, T N is the new finish time, T B is the finish time of the baseline schedule, and n is the number of activities that have been rescheduled more than half their duration away from their baseline schedule. Figure 1 Flow of events of the proposed approach 13
5 4. EXPERIMENTAL RESULTS The experimental verification of the suggest method was done using the datasets from PSPLIB (Kolisch and Sprecher 1997). We experimented with the J30 and J60 sets of data and created random disruptions (50% of time and 30% of resource disruptions) for the projects and then used the proposed method to reschedule the projects. The baseline schedule of the project was created using serial SGS and normal priority rules. We used the sampling approach to find the best solution for each project. The next step is the comparison of the results to those found by the best in class algorithms referred in the literature. Furthermore, in Figures 2 and 3 an illustrative case before and after the application of the proposed method is presented. It is a project with 30 activities and baseline schedule with makespan of 45 time units. At time 11, the schedule is disrupted. More specifically, at time 11 the project manager checks the progress of the project and finds out that there are the following disruptions: at activity 15 we have a new duration of 12 time units instead of 10, at activity 21 we have a new resource need of 4 units of resource 1 instead of 2 and at activity 24 we have a new duration of 6 time units instead of 3. Furthermore, activities 2, 3, 6 and 8 have been completed, activities 1, 7, 9 and 11 are in progress and the rest of the activities have not been started yet. After deciding that all the in progress activities will not be split, the proposed method is applied and gives the schedule shown in Figure 3. The generated schedule has a makespan of x days and an average of start times deviation from the corresponding in the baseline schedule of 20%. Figure 2 Pre disrupted schedule 14
6 Figure 3 Post disrupted schedule 5. CONCLUSIONS Uncertainty is part of project management, there are always going to be disruptions in a project s schedule, the more complicated and lengthy the project, the bigger the consequences of these disruptions. For that reason the need of a fast and reliable reactive process that will generate schedules easily applicable in practice is great. The applicability of a schedule, generated to accommodate time and resource disruptions, is highly related to the degree that already taken commitments are taken into consideration, which are reflected in the initial baseline schedule. Furthermore, the minimization of the total project duration remains of uppermost importance but should not overpower the need of minimal number of activities that are scheduled far apart from their original scheduling times. REFERENCES Artigues, C., Michelon, P. and Reusser, S. (2003) Insertion techniques for static and dynamic resource-constrained project scheduling. European Journal of Operational Research, 149(2), pp Ballestín, F. and Trautmann, N. (2008) An iterated-local-search heuristic for the resource-constrained weighted earlinesstardiness project scheduling problem. International Journal of Production Research, 46(22), pp Deblaere, F., Demeulemeester, E. and Herroelen, W. (2008) Exact and heuristic reactive planning procedures for multimode resource-constrained projects. Available at SSRN Deblaere, F., Demeulemeester, E. and Herroelen, W. (2011) Reactive scheduling in the multi-mode RCPSP. Computers & Operations Research, 38(1), pp Demeulemeester, E. and Herroelen, W. (1992) A branch-and-bound procedure for the multiple resource-constrained project scheduling problem. Management science, 38(12), pp
7 Demeulemeester, E. and Herroelen, W. (2000) The discrete time/resource trade-off problem in project networks: a branch-and-bound approach. IIE transactions, 32(11), pp Demeulemeester, E. L. and Herroelen, W. (2002) Project scheduling : a research handbook, International series in operations research & management science, Boston: Kluwer Academic Publishers. Glover, F. (1989) Tabu search part I. ORSA Journal on computing, 1(3), pp Glover, F. (1990) Tabu search part II. ORSA Journal on computing, 2(1), pp Hartmann, S. and Drexl, A. (1998) Project scheduling with multiple modes: A comparison of exact algorithms. Networks, 32(4), pp Herroelen, W. and Leus, R. (2004) Robust and reactive project scheduling: a review and classification of procedures. International Journal of Production Research, 42(8), pp Kolisch, R. and Sprecher, A. (1997) PSPLIB-a project scheduling problem library: OR software-orsep operations research software exchange program. European Journal of Operational Research, 96(1), pp Korf, R. E. (1985) Depth-first iterative-deepening: An optimal admissible tree search. Artificial intelligence, 27(1), pp Lourenço, H. R., Martin, O. C. and Stutzle, T. (2001) Iterated local search. arxiv preprint math/ Sadeh, N., Otsuka, S. and Schnelbach, R. (1993) Predictive and reactive scheduling with the Micro-Boss production scheduling and control system. in Proceedings, IJCAI-93 Workshop on Knowledge-Based Production Planning, Scheduling and Control. Smith, S. F. (1995) Reactive scheduling systems. in Intelligent scheduling systems: Springer. pp Sprecher, A., Hartmann, S. and Drexl, A. (1997) An exact algorithm for project scheduling with multiple modes. Operations-Research-Spektrum, 19(3), pp Van de Vonder, S., Ballestín, F., Demeulemeester, E. and Herroelen, W. (2007) Heuristic procedures for reactive project scheduling. Computers & Industrial Engineering, 52(1), pp
A theoretic and practical framework for scheduling in a stochastic environment
J Sched (2009) 12: 315 344 DOI 10.1007/s10951-008-0080-x A theoretic and practical framework for scheduling in a stochastic environment Julien Bidot Thierry Vidal Philippe Laborie J. Christopher Beck Received:
More informationSeminar - Organic Computing
Seminar - Organic Computing Self-Organisation of OC-Systems Markus Franke 25.01.2006 Typeset by FoilTEX Timetable 1. Overview 2. Characteristics of SO-Systems 3. Concern with Nature 4. Design-Concepts
More informationThe Good Judgment Project: A large scale test of different methods of combining expert predictions
The Good Judgment Project: A large scale test of different methods of combining expert predictions Lyle Ungar, Barb Mellors, Jon Baron, Phil Tetlock, Jaime Ramos, Sam Swift The University of Pennsylvania
More informationM55205-Mastering Microsoft Project 2016
M55205-Mastering Microsoft Project 2016 Course Number: M55205 Category: Desktop Applications Duration: 3 days Certification: Exam 70-343 Overview This three-day, instructor-led course is intended for individuals
More informationReinforcement Learning by Comparing Immediate Reward
Reinforcement Learning by Comparing Immediate Reward Punit Pandey DeepshikhaPandey Dr. Shishir Kumar Abstract This paper introduces an approach to Reinforcement Learning Algorithm by comparing their immediate
More informationResearch Article Hybrid Multistarting GA-Tabu Search Method for the Placement of BtB Converters for Korean Metropolitan Ring Grid
Mathematical Problems in Engineering Volume 2016, Article ID 1546753, 9 pages http://dx.doi.org/10.1155/2016/1546753 Research Article Hybrid Multistarting GA-Tabu Search Method for the Placement of BtB
More informationUniversity of Groningen. Systemen, planning, netwerken Bosman, Aart
University of Groningen Systemen, planning, netwerken Bosman, Aart IMPORTANT NOTE: You are advised to consult the publisher's version (publisher's PDF) if you wish to cite from it. Please check the document
More informationMajor Milestones, Team Activities, and Individual Deliverables
Major Milestones, Team Activities, and Individual Deliverables Milestone #1: Team Semester Proposal Your team should write a proposal that describes project objectives, existing relevant technology, engineering
More informationExecutive Guide to Simulation for Health
Executive Guide to Simulation for Health Simulation is used by Healthcare and Human Service organizations across the World to improve their systems of care and reduce costs. Simulation offers evidence
More informationLearning Methods for Fuzzy Systems
Learning Methods for Fuzzy Systems Rudolf Kruse and Andreas Nürnberger Department of Computer Science, University of Magdeburg Universitätsplatz, D-396 Magdeburg, Germany Phone : +49.39.67.876, Fax : +49.39.67.8
More informationA GENERIC SPLIT PROCESS MODEL FOR ASSET MANAGEMENT DECISION-MAKING
A GENERIC SPLIT PROCESS MODEL FOR ASSET MANAGEMENT DECISION-MAKING Yong Sun, a * Colin Fidge b and Lin Ma a a CRC for Integrated Engineering Asset Management, School of Engineering Systems, Queensland
More informationAn Introduction to Simio for Beginners
An Introduction to Simio for Beginners C. Dennis Pegden, Ph.D. This white paper is intended to introduce Simio to a user new to simulation. It is intended for the manufacturing engineer, hospital quality
More informationGuidelines for Writing an Internship Report
Guidelines for Writing an Internship Report Master of Commerce (MCOM) Program Bahauddin Zakariya University, Multan Table of Contents Table of Contents... 2 1. Introduction.... 3 2. The Required Components
More informationACTL5103 Stochastic Modelling For Actuaries. Course Outline Semester 2, 2014
UNSW Australia Business School School of Risk and Actuarial Studies ACTL5103 Stochastic Modelling For Actuaries Course Outline Semester 2, 2014 Part A: Course-Specific Information Please consult Part B
More informationCS Machine Learning
CS 478 - Machine Learning Projects Data Representation Basic testing and evaluation schemes CS 478 Data and Testing 1 Programming Issues l Program in any platform you want l Realize that you will be doing
More informationBMBF Project ROBUKOM: Robust Communication Networks
BMBF Project ROBUKOM: Robust Communication Networks Arie M.C.A. Koster Christoph Helmberg Andreas Bley Martin Grötschel Thomas Bauschert supported by BMBF grant 03MS616A: ROBUKOM Robust Communication Networks,
More informationSoftware Maintenance
1 What is Software Maintenance? Software Maintenance is a very broad activity that includes error corrections, enhancements of capabilities, deletion of obsolete capabilities, and optimization. 2 Categories
More informationIntroduction to Simulation
Introduction to Simulation Spring 2010 Dr. Louis Luangkesorn University of Pittsburgh January 19, 2010 Dr. Louis Luangkesorn ( University of Pittsburgh ) Introduction to Simulation January 19, 2010 1 /
More informationOPTIMIZATINON OF TRAINING SETS FOR HEBBIAN-LEARNING- BASED CLASSIFIERS
OPTIMIZATINON OF TRAINING SETS FOR HEBBIAN-LEARNING- BASED CLASSIFIERS Václav Kocian, Eva Volná, Michal Janošek, Martin Kotyrba University of Ostrava Department of Informatics and Computers Dvořákova 7,
More informationA Reinforcement Learning Variant for Control Scheduling
A Reinforcement Learning Variant for Control Scheduling Aloke Guha Honeywell Sensor and System Development Center 3660 Technology Drive Minneapolis MN 55417 Abstract We present an algorithm based on reinforcement
More informationGiven a directed graph G =(N A), where N is a set of m nodes and A. destination node, implying a direction for ow to follow. Arcs have limitations
4 Interior point algorithms for network ow problems Mauricio G.C. Resende AT&T Bell Laboratories, Murray Hill, NJ 07974-2070 USA Panos M. Pardalos The University of Florida, Gainesville, FL 32611-6595
More informationA student diagnosing and evaluation system for laboratory-based academic exercises
A student diagnosing and evaluation system for laboratory-based academic exercises Maria Samarakou, Emmanouil Fylladitakis and Pantelis Prentakis Technological Educational Institute (T.E.I.) of Athens
More informationLearning From the Past with Experiment Databases
Learning From the Past with Experiment Databases Joaquin Vanschoren 1, Bernhard Pfahringer 2, and Geoff Holmes 2 1 Computer Science Dept., K.U.Leuven, Leuven, Belgium 2 Computer Science Dept., University
More informationRule-based Expert Systems
Rule-based Expert Systems What is knowledge? is a theoretical or practical understanding of a subject or a domain. is also the sim of what is currently known, and apparently knowledge is power. Those who
More informationPractice Examination IREB
IREB Examination Requirements Engineering Advanced Level Elicitation and Consolidation Practice Examination Questionnaire: Set_EN_2013_Public_1.2 Syllabus: Version 1.0 Passed Failed Total number of points
More informationRule Learning With Negation: Issues Regarding Effectiveness
Rule Learning With Negation: Issues Regarding Effectiveness S. Chua, F. Coenen, G. Malcolm University of Liverpool Department of Computer Science, Ashton Building, Ashton Street, L69 3BX Liverpool, United
More informationDocument number: 2013/ Programs Committee 6/2014 (July) Agenda Item 42.0 Bachelor of Engineering with Honours in Software Engineering
Document number: 2013/0006139 Programs Committee 6/2014 (July) Agenda Item 42.0 Bachelor of Engineering with Honours in Software Engineering Program Learning Outcomes Threshold Learning Outcomes for Engineering
More informationVisit us at:
White Paper Integrating Six Sigma and Software Testing Process for Removal of Wastage & Optimizing Resource Utilization 24 October 2013 With resources working for extended hours and in a pressurized environment,
More informationExercise Format Benefits Drawbacks Desk check, audit or update
Guidance Note 6 Exercising for Resilience With critical activities, resources and recovery priorities established, and preparations made for crisis management, all preparations and plans should be tested
More informationModule 12. Machine Learning. Version 2 CSE IIT, Kharagpur
Module 12 Machine Learning 12.1 Instructional Objective The students should understand the concept of learning systems Students should learn about different aspects of a learning system Students should
More informationLecture 1: Machine Learning Basics
1/69 Lecture 1: Machine Learning Basics Ali Harakeh University of Waterloo WAVE Lab ali.harakeh@uwaterloo.ca May 1, 2017 2/69 Overview 1 Learning Algorithms 2 Capacity, Overfitting, and Underfitting 3
More informationImplementation of Genetic Algorithm to Solve Travelling Salesman Problem with Time Window (TSP-TW) for Scheduling Tourist Destinations in Malang City
Journal of Information Technology and Computer Science Volume 2, Number 1, 2017, pp. 1-10 Journal Homepage: www.jitecs.ub.ac.id Implementation of Genetic Algorithm to Solve Travelling Salesman Problem
More informationA Comparison of Annealing Techniques for Academic Course Scheduling
A Comparison of Annealing Techniques for Academic Course Scheduling M. A. Saleh Elmohamed 1, Paul Coddington 2, and Geoffrey Fox 1 1 Northeast Parallel Architectures Center Syracuse University, Syracuse,
More informationAxiom 2013 Team Description Paper
Axiom 2013 Team Description Paper Mohammad Ghazanfari, S Omid Shirkhorshidi, Farbod Samsamipour, Hossein Rahmatizadeh Zagheli, Mohammad Mahdavi, Payam Mohajeri, S Abbas Alamolhoda Robotics Scientific Association
More informationOn the Combined Behavior of Autonomous Resource Management Agents
On the Combined Behavior of Autonomous Resource Management Agents Siri Fagernes 1 and Alva L. Couch 2 1 Faculty of Engineering Oslo University College Oslo, Norway siri.fagernes@iu.hio.no 2 Computer Science
More informationGuidelines for Project I Delivery and Assessment Department of Industrial and Mechanical Engineering Lebanese American University
Guidelines for Project I Delivery and Assessment Department of Industrial and Mechanical Engineering Lebanese American University Approved: July 6, 2009 Amended: July 28, 2009 Amended: October 30, 2009
More informationEvolutive Neural Net Fuzzy Filtering: Basic Description
Journal of Intelligent Learning Systems and Applications, 2010, 2: 12-18 doi:10.4236/jilsa.2010.21002 Published Online February 2010 (http://www.scirp.org/journal/jilsa) Evolutive Neural Net Fuzzy Filtering:
More informationAbstract. Janaka Jayalath Director / Information Systems, Tertiary and Vocational Education Commission, Sri Lanka.
FEASIBILITY OF USING ELEARNING IN CAPACITY BUILDING OF ICT TRAINERS AND DELIVERY OF TECHNICAL, VOCATIONAL EDUCATION AND TRAINING (TVET) COURSES IN SRI LANKA Janaka Jayalath Director / Information Systems,
More informationGeo Risk Scan Getting grips on geotechnical risks
Geo Risk Scan Getting grips on geotechnical risks T.J. Bles & M.Th. van Staveren Deltares, Delft, the Netherlands P.P.T. Litjens & P.M.C.B.M. Cools Rijkswaterstaat Competence Center for Infrastructure,
More informationDiscriminative Learning of Beam-Search Heuristics for Planning
Discriminative Learning of Beam-Search Heuristics for Planning Yuehua Xu School of EECS Oregon State University Corvallis,OR 97331 xuyu@eecs.oregonstate.edu Alan Fern School of EECS Oregon State University
More informationGenerating Test Cases From Use Cases
1 of 13 1/10/2007 10:41 AM Generating Test Cases From Use Cases by Jim Heumann Requirements Management Evangelist Rational Software pdf (155 K) In many organizations, software testing accounts for 30 to
More informationSoftware Development Plan
Version 2.0e Software Development Plan Tom Welch, CPC Copyright 1997-2001, Tom Welch, CPC Page 1 COVER Date Project Name Project Manager Contact Info Document # Revision Level Label Business Confidential
More informationSelf Study Report Computer Science
Computer Science undergraduate students have access to undergraduate teaching, and general computing facilities in three buildings. Two large classrooms are housed in the Davis Centre, which hold about
More informationRadius STEM Readiness TM
Curriculum Guide Radius STEM Readiness TM While today s teens are surrounded by technology, we face a stark and imminent shortage of graduates pursuing careers in Science, Technology, Engineering, and
More informationPython Machine Learning
Python Machine Learning Unlock deeper insights into machine learning with this vital guide to cuttingedge predictive analytics Sebastian Raschka [ PUBLISHING 1 open source I community experience distilled
More informationA Pipelined Approach for Iterative Software Process Model
A Pipelined Approach for Iterative Software Process Model Ms.Prasanthi E R, Ms.Aparna Rathi, Ms.Vardhani J P, Mr.Vivek Krishna Electronics and Radar Development Establishment C V Raman Nagar, Bangalore-560093,
More informationPH.D. IN COMPUTER SCIENCE PROGRAM (POST M.S.)
PH.D. IN COMPUTER SCIENCE PROGRAM (POST M.S.) OVERVIEW ADMISSION REQUIREMENTS PROGRAM REQUIREMENTS OVERVIEW FOR THE PH.D. IN COMPUTER SCIENCE Overview The doctoral program is designed for those students
More information1 Use complex features of a word processing application to a given brief. 2 Create a complex document. 3 Collaborate on a complex document.
National Unit specification General information Unit code: HA6M 46 Superclass: CD Publication date: May 2016 Source: Scottish Qualifications Authority Version: 02 Unit purpose This Unit is designed to
More informationFirms and Markets Saturdays Summer I 2014
PRELIMINARY DRAFT VERSION. SUBJECT TO CHANGE. Firms and Markets Saturdays Summer I 2014 Professor Thomas Pugel Office: Room 11-53 KMC E-mail: tpugel@stern.nyu.edu Tel: 212-998-0918 Fax: 212-995-4212 This
More informationKnowledge based expert systems D H A N A N J A Y K A L B A N D E
Knowledge based expert systems D H A N A N J A Y K A L B A N D E What is a knowledge based system? A Knowledge Based System or a KBS is a computer program that uses artificial intelligence to solve problems
More informationSoftware Development: Programming Paradigms (SCQF level 8)
Higher National Unit Specification General information Unit code: HL9V 35 Superclass: CB Publication date: May 2017 Source: Scottish Qualifications Authority Version: 01 Unit purpose This unit is intended
More informationLahore University of Management Sciences. FINN 321 Econometrics Fall Semester 2017
Instructor Syed Zahid Ali Room No. 247 Economics Wing First Floor Office Hours Email szahid@lums.edu.pk Telephone Ext. 8074 Secretary/TA TA Office Hours Course URL (if any) Suraj.lums.edu.pk FINN 321 Econometrics
More informationNCEO Technical Report 27
Home About Publications Special Topics Presentations State Policies Accommodations Bibliography Teleconferences Tools Related Sites Interpreting Trends in the Performance of Special Education Students
More informationWhat is PDE? Research Report. Paul Nichols
What is PDE? Research Report Paul Nichols December 2013 WHAT IS PDE? 1 About Pearson Everything we do at Pearson grows out of a clear mission: to help people make progress in their lives through personalized
More informationGenerative models and adversarial training
Day 4 Lecture 1 Generative models and adversarial training Kevin McGuinness kevin.mcguinness@dcu.ie Research Fellow Insight Centre for Data Analytics Dublin City University What is a generative model?
More informationWE GAVE A LAWYER BASIC MATH SKILLS, AND YOU WON T BELIEVE WHAT HAPPENED NEXT
WE GAVE A LAWYER BASIC MATH SKILLS, AND YOU WON T BELIEVE WHAT HAPPENED NEXT PRACTICAL APPLICATIONS OF RANDOM SAMPLING IN ediscovery By Matthew Verga, J.D. INTRODUCTION Anyone who spends ample time working
More informationAn Estimating Method for IT Project Expected Duration Oriented to GERT
An Estimating Method for IT Project Expected Duration Oriented to GERT Li Yu and Meiyun Zuo School of Information, Renmin University of China, Beijing 100872, P.R. China buaayuli@mc.e(iuxn zuomeiyun@263.nct
More information3. Improving Weather and Emergency Management Messaging: The Tulsa Weather Message Experiment. Arizona State University
3. Improving Weather and Emergency Management Messaging: The Tulsa Weather Message Experiment Kenneth J. Galluppi 1, Steven F. Piltz 2, Kathy Nuckles 3*, Burrell E. Montz 4, James Correia 5, and Rachel
More informationSuccess Factors for Creativity Workshops in RE
Success Factors for Creativity s in RE Sebastian Adam, Marcus Trapp Fraunhofer IESE Fraunhofer-Platz 1, 67663 Kaiserslautern, Germany {sebastian.adam, marcus.trapp}@iese.fraunhofer.de Abstract. In today
More information10.2. Behavior models
User behavior research 10.2. Behavior models Overview Why do users seek information? How do they seek information? How do they search for information? How do they use libraries? These questions are addressed
More informationEconomics 201 Principles of Microeconomics Fall 2010 MWF 10:00 10:50am 160 Bryan Building
Economics 201 Principles of Microeconomics Fall 2010 MWF 10:00 10:50am 160 Bryan Building Professor: Dr. Michelle Sheran Office: 445 Bryan Building Phone: 256-1192 E-mail: mesheran@uncg.edu Office Hours:
More informationSolving Combinatorial Optimization Problems Using Genetic Algorithms and Ant Colony Optimization
University of Tennessee, Knoxville Trace: Tennessee Research and Creative Exchange Doctoral Dissertations Graduate School 8-2012 Solving Combinatorial Optimization Problems Using Genetic Algorithms and
More informationGeorgetown University at TREC 2017 Dynamic Domain Track
Georgetown University at TREC 2017 Dynamic Domain Track Zhiwen Tang Georgetown University zt79@georgetown.edu Grace Hui Yang Georgetown University huiyang@cs.georgetown.edu Abstract TREC Dynamic Domain
More informationConstructing a support system for self-learning playing the piano at the beginning stage
Alma Mater Studiorum University of Bologna, August 22-26 2006 Constructing a support system for self-learning playing the piano at the beginning stage Tamaki Kitamura Dept. of Media Informatics, Ryukoku
More informationLearning and Transferring Relational Instance-Based Policies
Learning and Transferring Relational Instance-Based Policies Rocío García-Durán, Fernando Fernández y Daniel Borrajo Universidad Carlos III de Madrid Avda de la Universidad 30, 28911-Leganés (Madrid),
More informationAviation English Solutions
Aviation English Solutions DynEd's Aviation English solutions develop a level of oral English proficiency that can be relied on in times of stress and unpredictability so that concerns for accurate communication
More informationOn Human Computer Interaction, HCI. Dr. Saif al Zahir Electrical and Computer Engineering Department UBC
On Human Computer Interaction, HCI Dr. Saif al Zahir Electrical and Computer Engineering Department UBC Human Computer Interaction HCI HCI is the study of people, computer technology, and the ways these
More informationSpecification and Evaluation of Machine Translation Toy Systems - Criteria for laboratory assignments
Specification and Evaluation of Machine Translation Toy Systems - Criteria for laboratory assignments Cristina Vertan, Walther v. Hahn University of Hamburg, Natural Language Systems Division Hamburg,
More informationKnowledge-Based - Systems
Knowledge-Based - Systems ; Rajendra Arvind Akerkar Chairman, Technomathematics Research Foundation and Senior Researcher, Western Norway Research institute Priti Srinivas Sajja Sardar Patel University
More informationEECS 571 PRINCIPLES OF REAL-TIME COMPUTING Fall 10. Instructor: Kang G. Shin, 4605 CSE, ;
EECS 571 PRINCIPLES OF REAL-TIME COMPUTING Fall 10 Instructor: Kang G. Shin, 4605 CSE, 763-0391; kgshin@umich.edu Number of credit hours: 4 Class meeting time and room: Regular classes: MW 10:30am noon
More informationPAST EXPERIENCE AS COORDINATION ENABLER IN EXTREME ENVIRONMENT: THE CASE OF THE FRENCH AIR FORCE AEROBATIC TEAM
PAST EXPERIENCE AS COORDINATION ENABLER IN EXTREME ENVIRONMENT: THE CASE OF THE FRENCH AIR FORCE AEROBATIC TEAM Cécile Godé Responsable de l équipe de management des organisations de Défense (EMOD) Chercheur
More informationCHAPTER 4: REIMBURSEMENT STRATEGIES 24
CHAPTER 4: REIMBURSEMENT STRATEGIES 24 INTRODUCTION Once state level policymakers have decided to implement and pay for CSR, one issue they face is simply how to calculate the reimbursements to districts
More informationSTABILISATION AND PROCESS IMPROVEMENT IN NAB
STABILISATION AND PROCESS IMPROVEMENT IN NAB Authors: Nicole Warren Quality & Process Change Manager, Bachelor of Engineering (Hons) and Science Peter Atanasovski - Quality & Process Change Manager, Bachelor
More informationA simulated annealing and hill-climbing algorithm for the traveling tournament problem
European Journal of Operational Research xxx (2005) xxx xxx Discrete Optimization A simulated annealing and hill-climbing algorithm for the traveling tournament problem A. Lim a, B. Rodrigues b, *, X.
More informationRule Learning with Negation: Issues Regarding Effectiveness
Rule Learning with Negation: Issues Regarding Effectiveness Stephanie Chua, Frans Coenen, and Grant Malcolm University of Liverpool Department of Computer Science, Ashton Building, Ashton Street, L69 3BX
More informationMinistry of Education, Republic of Palau Executive Summary
Ministry of Education, Republic of Palau Executive Summary Student Consultant, Jasmine Han Community Partner, Edwel Ongrung I. Background Information The Ministry of Education is one of the eight ministries
More informationISFA2008U_120 A SCHEDULING REINFORCEMENT LEARNING ALGORITHM
Proceedings of 28 ISFA 28 International Symposium on Flexible Automation Atlanta, GA, USA June 23-26, 28 ISFA28U_12 A SCHEDULING REINFORCEMENT LEARNING ALGORITHM Amit Gil, Helman Stern, Yael Edan, and
More informationWhat to Do When Conflict Happens
PREVIEW GUIDE What to Do When Conflict Happens Table of Contents: Sample Pages from Leader s Guide and Workbook..pgs. 2-15 Program Information and Pricing.. pgs. 16-17 BACKGROUND INTRODUCTION Workplace
More informationAutomating the E-learning Personalization
Automating the E-learning Personalization Fathi Essalmi 1, Leila Jemni Ben Ayed 1, Mohamed Jemni 1, Kinshuk 2, and Sabine Graf 2 1 The Research Laboratory of Technologies of Information and Communication
More informationA Case Study: News Classification Based on Term Frequency
A Case Study: News Classification Based on Term Frequency Petr Kroha Faculty of Computer Science University of Technology 09107 Chemnitz Germany kroha@informatik.tu-chemnitz.de Ricardo Baeza-Yates Center
More informationModified Systematic Approach to Answering Questions J A M I L A H A L S A I D A N, M S C.
Modified Systematic Approach to Answering J A M I L A H A L S A I D A N, M S C. Learning Outcomes: Discuss the modified systemic approach to providing answers to questions Determination of the most important
More informationBADM 641 (sec. 7D1) (on-line) Decision Analysis August 16 October 6, 2017 CRN: 83777
BADM 641 (sec. 7D1) (on-line) Decision Analysis August 16 October 6, 2017 CRN: 83777 SEMESTER: Fall 2017 INSTRUCTOR: Jack Fuller, Ph.D. OFFICE: 108 Business and Economics Building, West Virginia University,
More informationWhat is a Mental Model?
Mental Models for Program Understanding Dr. Jonathan I. Maletic Computer Science Department Kent State University What is a Mental Model? Internal (mental) representation of a real system s behavior,
More informationActive Learning. Yingyu Liang Computer Sciences 760 Fall
Active Learning Yingyu Liang Computer Sciences 760 Fall 2017 http://pages.cs.wisc.edu/~yliang/cs760/ Some of the slides in these lectures have been adapted/borrowed from materials developed by Mark Craven,
More informationClassification Using ANN: A Review
International Journal of Computational Intelligence Research ISSN 0973-1873 Volume 13, Number 7 (2017), pp. 1811-1820 Research India Publications http://www.ripublication.com Classification Using ANN:
More informationCLASSIFICATION OF PROGRAM Critical Elements Analysis 1. High Priority Items Phonemic Awareness Instruction
CLASSIFICATION OF PROGRAM Critical Elements Analysis 1 Program Name: Macmillan/McGraw Hill Reading 2003 Date of Publication: 2003 Publisher: Macmillan/McGraw Hill Reviewer Code: 1. X The program meets
More informationProbabilistic Latent Semantic Analysis
Probabilistic Latent Semantic Analysis Thomas Hofmann Presentation by Ioannis Pavlopoulos & Andreas Damianou for the course of Data Mining & Exploration 1 Outline Latent Semantic Analysis o Need o Overview
More informationProject Leadership in the Future
Project Leadership in the Future Todd Little and Ole Jepsen The story behind the Agile Project Leadership Network (APLN) and the Declaration Of Interdependence (DOI) Introduction Over the past couple of
More informationEuropean Cooperation in the field of Scientific and Technical Research - COST - Brussels, 24 May 2013 COST 024/13
European Cooperation in the field of Scientific and Technical Research - COST - Brussels, 24 May 2013 COST 024/13 MEMORANDUM OF UNDERSTANDING Subject : Memorandum of Understanding for the implementation
More informationThe 9 th International Scientific Conference elearning and software for Education Bucharest, April 25-26, / X
The 9 th International Scientific Conference elearning and software for Education Bucharest, April 25-26, 2013 10.12753/2066-026X-13-154 DATA MINING SOLUTIONS FOR DETERMINING STUDENT'S PROFILE Adela BÂRA,
More informationLaboratorio di Intelligenza Artificiale e Robotica
Laboratorio di Intelligenza Artificiale e Robotica A.A. 2008-2009 Outline 2 Machine Learning Unsupervised Learning Supervised Learning Reinforcement Learning Genetic Algorithms Genetics-Based Machine Learning
More informationDeveloping an Assessment Plan to Learn About Student Learning
Developing an Assessment Plan to Learn About Student Learning By Peggy L. Maki, Senior Scholar, Assessing for Learning American Association for Higher Education (pre-publication version of article that
More informationLecture 10: Reinforcement Learning
Lecture 1: Reinforcement Learning Cognitive Systems II - Machine Learning SS 25 Part III: Learning Programs and Strategies Q Learning, Dynamic Programming Lecture 1: Reinforcement Learning p. Motivation
More informationAUTOMATIC DETECTION OF PROLONGED FRICATIVE PHONEMES WITH THE HIDDEN MARKOV MODELS APPROACH 1. INTRODUCTION
JOURNAL OF MEDICAL INFORMATICS & TECHNOLOGIES Vol. 11/2007, ISSN 1642-6037 Marek WIŚNIEWSKI *, Wiesława KUNISZYK-JÓŹKOWIAK *, Elżbieta SMOŁKA *, Waldemar SUSZYŃSKI * HMM, recognition, speech, disorders
More informationRule discovery in Web-based educational systems using Grammar-Based Genetic Programming
Data Mining VI 205 Rule discovery in Web-based educational systems using Grammar-Based Genetic Programming C. Romero, S. Ventura, C. Hervás & P. González Universidad de Córdoba, Campus Universitario de
More informationLearning to Schedule Straight-Line Code
Learning to Schedule Straight-Line Code Eliot Moss, Paul Utgoff, John Cavazos Doina Precup, Darko Stefanović Dept. of Comp. Sci., Univ. of Mass. Amherst, MA 01003 Carla Brodley, David Scheeff Sch. of Elec.
More informationWhile you are waiting... socrative.com, room number SIMLANG2016
While you are waiting... socrative.com, room number SIMLANG2016 Simulating Language Lecture 4: When will optimal signalling evolve? Simon Kirby simon@ling.ed.ac.uk T H E U N I V E R S I T Y O H F R G E
More informationRunning head: FINAL CASE STUDY, EDCI Addressing a Training Gap. Final Case Study. Anna Siracusa. Purdue University
Running head: FINAL CASE STUDY, EDCI531 1 Addressing a Training Gap Final Case Study Anna Siracusa Purdue University FINAL CASE STUDY, EDCI531 2 Introduction I tried all three options and this is the one
More informationActivities, Exercises, Assignments Copyright 2009 Cem Kaner 1
Patterns of activities, iti exercises and assignments Workshop on Teaching Software Testing January 31, 2009 Cem Kaner, J.D., Ph.D. kaner@kaner.com Professor of Software Engineering Florida Institute of
More informationMASTER OF SCIENCE (M.S.) MAJOR IN COMPUTER SCIENCE
Master of Science (M.S.) Major in Computer Science 1 MASTER OF SCIENCE (M.S.) MAJOR IN COMPUTER SCIENCE Major Program The programs in computer science are designed to prepare students for doctoral research,
More information