SCHEDULING Critical Activities are: B, F, I, M, Q.

Slides:

Advertisements

Similar presentations

Project Management Concepts

Advertisements

Chapter 7 - Resource Access Protocols (Critical Sections) Protocols: No Preemptions During Critical Sections Once a job enters a critical section, it cannot.

Copyright © 2008 Pearson Education, Inc. Slide 13-1 Unit 13C Scheduling Problems.

Algorithm Design Methods (I) Fall 2003 CSE, POSTECH.

Algorithm Design Methods Spring 2007 CSE, POSTECH.

4/12/2015 Management of Engineering Projects Limited Resources Dr. L. K. Gaafar.

Greedy Algorithms.

ES=32 EF=34 LS=33 LF=35 ES=10 EF=16 LS=10 LF=16 ES=4+6=10 EF=10 LS=4

Chapter 3: Planning and Scheduling Lesson Plan

Johnson’s Rule Johnson’s rule: A procedure that minimizes makespan when scheduling a group of jobs on two workstations. Step 1. Find the shortest processing.

D1: Critical Events And Critical Paths. D1: Critical Events And Paths A critical path is the list of activities on an activity network that, if they are.

Operations Scheduling

إدارة المشروعات Projects Management

Resource Management Chapter 12.

Chapter 4: Schedule, cost, and situation analysis (pt. 1) ISE 443 / ETM 543 Fall 2013.

USC Viterbi School of Engineering Ewa Deelman Resource Management.

Operations Research Assignment Problem.

Activity networks – Example 1 TaskDuration (hours)Immediate predecessors A3- B4- C6- D5A E1B F6B G7C, D, E The table below shows the tasks involved in.

Critical Paths.

1 Swiss Federal Institute of Technology Computer Engineering and Networks Laboratory Embedded Systems Exercise 2: Scheduling Real-Time Aperiodic Tasks.

Project Management (2) Chapter 16, Part 2. EJR 2006 Review of Project Management, Part 1 What is a project? Examples of projects Project performance expectations.

1 Project Scheduling Contents 1. Problem Statement 2. Critical Path Method 3. Extensions to the classical project scheduling problems Literature Operations.

15C Backward scanning and crashing

Projmgmt-1/14 DePaul University Project Management I - Realistic Scheduling Instructor: David A. Lash.

CSE 421 Algorithms Richard Anderson Lecture 6 Greedy Algorithms.

Deterministic Scheduling

1 Set # 4 Dr. LEE Heung Wing Joseph Phone: Office : HJ639.

ON-LINE SCHEDULING AND W.I.P. REGULATION Jean-Marie PROTH.

Iterative Flattening in Cumulative Scheduling. Cumulative Scheduling Problem Set of Jobs Each job consists of a sequence of activities Each activity has.

Sequencing Problem.

Construction Scheduling and Estimating.  Someone gets an IDEA  The IDEA inspires a PLAN to be created  The PLAN is used to build the SCHEDULE  The.

Called as the Interval Scheduling Problem. A simpler version of a class of scheduling problems. – Can add weights. – Can add multiple resources – Can ask.

Lecture 5 – Gantt Chart GANTT Charts Constructing GANTT Charts

Project Management OPER 576 Resource Allocation Greg Magnan, Ph.D. May 6, 2004.

Resource Management. Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall12-2 Types of Constraints  Time  Resource  Mixed Copyright.

CPA A group of workers is involved in a building project. The table shows the activities involved. Each worker can perform any of the given activities.

Spring 2015 Mathematics in Management Science Machine Scheduling Problem Statement of MSP Assumptions & Goals Priority Lists List Processing Algorithm.

Line Balancing Problem

Irwin/McGraw-Hill © The McGraw-Hill Companies, Inc., 1999 PROJECT MANAGEMENT 18-1 Project Management.

Scheduling Process and Production Management.

Scheduling CTC-415. Short Interval Scheduling Plan & manage day to day activities Focus on individual activities Goal Oriented to get activity done Two.

Spring 2015 Mathematics in Management Science Critical Path Scheduling Critical Paths & Times Backflow Algorithm Critical Times PL Critical Path Algorithm.

HKOI 2014 Senior Pharmaceutical Company Problem Prepared by : Gary Wong.

Scheduling. Scheduling: The allocation of resources over time to accomplish specific tasks. Demand scheduling: A type of scheduling whereby customers.

1 Chapter 10 Scheduling 1 Chapter 10 SCHEDULING McGraw-Hill/Irwin © 2003 The McGraw-Hill Companies, Inc., All Rights Reserved.

Chapter 16 & 9 Scheduling Work & Employees. Scheduling Outline What needs to be scheduled? –doctor’s office, restaurant, mfg. plant, hospital –employees.

Algorithm Design Methods 황승원 Fall 2011 CSE, POSTECH.

1 540f07reviews9sep25 Pert and Reviews Reviews S&G Chapter 5.

Project Management – Part 1. Overview What is a project? Project management techniques Activity lists Network diagrams Critical path analysis Gant charts.

Planning and Scheduling.  A job can be made up of a number of smaller tasks that can be completed by a number of different “processors.”  The processors.

Critical Paths and Scheduling Tasks Circuits, Paths, and Schedules.

1 Job Shop Scheduling. 2 Job shop environment: m machines, n jobs objective function Each job follows a predetermined route Routes are not necessarily.

Multiple Access By, B. R. Chandavarkar, CSE Dept., NITK, Surathkal Ref: B. A. Forouzan, 5 th Edition.

HNC_D Project Management

Activity networks – Example 1

Algorithm Design Methods

Operating Systems Lecture 15.

Critical Path Analysis

Operating System Concepts

תזמון פרויקטים.

AQR Unit 7 Discrete Mathematics

Richard Anderson Lecture 6 Greedy Algorithms

Planning and Scheduling

Richard Anderson Lecture 7 Greedy Algorithms

Planning and Scheduling

Algorithm Design Methods

Algorithm Design Methods

Richard Anderson Autumn 2015 Lecture 7

Chapter 3: Planning and Scheduling Lesson Plan

Algorithm Design Methods

Presentation transcript:

SCHEDULING Critical Activities are: B, F, I, M, Q

RULES No worker may remain idle if there is an activity that can be started. Once a worker starts an activity he must continue until he finishes that activity. The objective is to complete the project with as few workers as possible or to complete the project with the available workers in a minimum time. There is no algorithm that guarantees an optimal solution. Adopt this procedure: When a worker completes an activity, consider all the activities that have not been started but that can now be started. Assign the worker to the activity whose latest start time is the smallest - this is in a sense the “most critical” activity. If there are no activities that can be started at this time, the worker will have to wait until an activity can be assigned.

In order to assign the workers in the correct order, it is a good idea to make a list of the earliest and latest start times for each activity. E(4) 3510 For example: The earliest that activity E can start is 3 The latest that activity E can finish is The duration of activity E is 4 So the latest that activity E can start is 6

AActivity Duration Earliest Start Latest Start B C D 8 14 E F G 3 9 H I J K L M 8 27 N 9 28 P 8 29 Q 2 35

ActivityABCDEFGHIJKLMNPQ Duration Earliest Start Latest Start Latest Start time that is the smallest is: B B Next Latest Start time that is the smallest is: C C A A F F Earliest Start 7 E Hours E The latest E can start without delays is 9 G 9 The latest G can start without delays is 13 G but G can start at 10 D 10 The latest D can start without delays is 14 but D can start at 13 D H 9 The latest H can start without delays is 15 So another worker is needed to avoid delays H H starts as early as possible I 16 I J The latest J can start without delays is 17 J starts as early as possible J 20 The latest L can start without delays is 22 L cannot start at 21 because it is dependent on E L

ActivityABCDEFGHIJKLMNPQ Duration Earliest Start Latest Start Hours B C A F E GD H I J Next Latest Start time that is the smallest is: K Earliest Start L 20 The latest K can start without delays is 25 K cannot start at 21 because it is dependent on E

ActivityABCDEFGHIJKLMNPQ Duration Earliest Start Latest Start Hours B C A F E GD H I J Next Latest Start time that is the smallest is: M Earliest Start L 27 K M N N P 28 P Q 35 Q The job needs 5 workers to complete it in a minimum time of 37 hours Scheduling completed!