1 By: Prof. Y. Peter Chiu Materials Management Scheduling ~ HOMEWORK SOLUTION ~

Slides:

Advertisements

Similar presentations

Machine scheduling Job 1Job 3 Job 4 Job 5Machine 1 Machine 2 time 0C max Job 2.

Advertisements

Lecture 6: Job Shop Scheduling Introduction

FLOW SHOPS: F2||Cmax. FLOW SHOPS: JOHNSON'S RULE2 FLOW SHOP SCHEDULING (n JOBS, m MACHINES) n JOBS BANK OF m MACHINES (SERIES) n M1 M2Mm.

Properties of SPT schedules Eric Angel, Evripidis Bampis, Fanny Pascual LaMI, university of Evry, France MISTA 2005.

1 IOE/MFG 543 Chapter 8: Open shops Section 8.1 (you may skip Sections 8.2 – 8.5)

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.

Operations Scheduling

ISE480 Sequencing and Scheduling Izmir University of Economics ISE Fall Semestre.

Operations Scheduling

1-1 McGraw-Hill/Irwin ©2009 The McGraw-Hill Companies, All Rights Reserved 1 Chapter 19 Operations Scheduling.

Scheduling. Production Planning Process Process Planning Strategic Capacity Planning Aggregate Planning Master Production Scheduling Material Requirements.

Introduction to Operations Research (II)

1 IOE/MFG 543 Chapter 5: Parallel machine models (Sections )

Completion Time Scheduling Notes from Hall, Schulz, Shmoys and Wein, Mathematics of Operations Research, Vol 22, , 1997.

Inputs and Outputs to Aggregate Production Planning

Chapter 2: Model of scheduling problem Components of any model: Decision variables –What we can change to optimize the system, i.e., model output Parameters.

5. Operations Scheduling

21st European Conference on Operational Research Algorithms for flexible flow shop problems with unrelated parallel machines, setup times and dual criteria.

1 IOE/MFG 543 Chapter 6: Flow shops Sections 6.1 and 6.2 (skip section 6.3)

1 By: Prof. Y. Peter Chiu Materials Management Inventory Management ~ HOMEWORK SOLUTION ~ Xtra 4.29, 4.30, 4.45.

1 By: Prof. Y. Peter Chiu Scheduling ~ HOMEWORK SOLUTION ~

Scheduling THE SCHEDULING ACTIVITY AT MACHINE SHOP.

Material Management 2010 Mid-Term Exam-#2 Solution By: Prof. Y. Peter Chiu 5 / 2010.

1 ISQA 459/559 Mellie Pullman Scheduling Shop Floor.

Scheduling – Day 2. Production Planning Process Process Planning Strategic Capacity Planning Aggregate Planning Master Production Scheduling Material.

Lecture 8: Dispatch Rules

Introduction to LEKIN Gareth Beddoe

Job-shop Scheduling n jobs m machines No recirculation – Jobs do not revisit the same machine (i, j) is referred to as an operation in which job j is processed.

A Study on Two-machine Flowshop Scheduling Problem with an Availability Constraint Team: Tianshu Guo Yixiao Sha Jun Tian.

An algorithm for a Parallel Machine Problem with Eligibility and Release and Delivery times, considering setup times Manuel Mateo Management.

Scheduling (Part II) Mohd Zaidan bin Abdul Aziz B

Exercise Find a schedule that minimises makespan..

1 Short Term Scheduling. 2  Planning horizon is short  Multiple unique jobs (tasks) with varying processing times and due dates  Multiple unique jobs.

Preparing for the next Midterm Adventures in production engineering.

1 Operation Scheduling- II The Multi-Machine Case Look! There are two machines.

Combine Like terms Simplify 3x+2x= 3x+2y+2x+7y= 3x+5x-2= 14x+y-2x+4y-7= Slide 1- 2.

1 Material Management Class Note # 3-B ~ Multiple product EPQ analysis ~ Prof. Yuan-Shyi Peter Chiu Feb

Outline Introduction Minimizing the makespan Minimizing total flowtime

HW # 41- Basic Exponents Worksheet Warm up Week 12, Day Three Evaluate b 2 for b = 4 4. n 2 r for n = 3 and r = 2.

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

Advanced Operating Systems - Spring 2009 Lecture 14 – February 25, 2009 Dan C. Marinescu Office: HEC 439 B. Office.

Do Now 1) Factor. 3a2 – 26a + 35.

By: Prof. Y.P. Chiu1 Extra -2 Review of Linear Systems Extra -2 Review of Linear Systems Prof. Y. Peter Chiu By: Prof. Y. Peter Chiu 9 / / 2011.

Parallel Machine Scheduling

Instructor Neelima Gupta Table of Contents Factor 2 algorithm for Bin Packing Factor 2 algorithm for Minimum Makespan Scheduling Reference:

Warm-up 4-1. x – y = 33x + y = 52y = 6 – x x + y = 5x – 2y = 43x – 2y = 6 Graphs:

Scheduling Operations IDS 605 Spring Data Collection for Scheduling l Jobs l Activities l Employees l Equipment l Facilities Transparency 18.1.

Prof. Yuan-Shyi Peter Chiu

1 By: Prof. Y. Peter Chiu POM Chap-8: Scheduling ~ Homework Problems ~

16 Scheduling (focus on sequencing; FCFS, SPT, EDD pages , and Johnson’s rule pages ) Homework; 6, 7, 11.

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

Flow Shop Scheduling.

BIS 219 Complete Class Check this A+ tutorial guideline at Complete-Class. For more classes visit

Lecture 8: Dispatch Rules

*No Checking Account Payday Loans* Gain Advance Cash to Meet Your Financial Woes

Do Now Factor. 18a5b2 – 30a3b7 64 – x2 x2 – 10x + 24.

2012 סיכום מפגש 2 שלב המשכי תהליך חזוני-אסטרטגי של המועצה העליונה של הפיזיותרפיה בישראל.

ניהול הייצור למערכות מידע – תורת התורים

Chapter 6: Flow shops Sections 6.1 and 6.2 (skip section 6.3)

Congruent Figures and Isosceles Triangles

Skill Check over Solving Systems by Graphing after Homework Check

Questions over HW?. Skills Check Radical Operations and Solving by Square Roots after HW Check.

Sequencing Sequencing: Determine the order in which jobs at a work center will be processed. Workstation: An area where one person works, usually with.

PW With Inflation Two ways to account for inflation in PW calculations: (1) Convert cash flow into constant-value dollars(CVD) and use regular i Where:

Warm Up Solve by graphing Solve by substitution.

Warm-up 1. 5x – 4 = 2x (x + 2) + 3x = 2 Solve for the variable 1. 5x – 4 = 2x (x + 2) + 3x = 2.

Warm-up 1. 5x – 4 = 2x (x + 2) + 3x = 2 Solve for the variable 1. 5x – 4 = 2x (x + 2) + 3x = 2.

Inputs and Outputs to Aggregate Production Planning

Solve by Substitution 2x + y = 7 3x + 3y = - 3.

Presentation transcript:

1 By: Prof. Y. Peter Chiu Materials Management Scheduling ~ HOMEWORK SOLUTION ~

2 To minimize the total time required Applies Johnson’s Rule Secretary Time → Accountant Time(in hours) or #40

3 AiAi BiBi Checking (1) #40

4 甘特圖 #40

5 AiAi BiBi Checking (2) #40

6 甘特圖 #40

7 Parallel processing 2 machines either on Machine #1 or Machine #2 By SPT m/c #1titi FiFi m/c #2titi FiFi Total makespan for SPT = 187 #39

8 m/c #1titi FiFi m/c #2titi FiFi Total makespan for LPT = 162 Parallel processing 2 machines either on Machine #1 or Machine #2 By LPT #39

9 3 M/C’s To Minimize the makespan. Min.Ci ≧ Max. Bi JobABC MaxBi=5Ci=6 HW # 14

10 2 M/C’s Johnson’s 2 – 1 – 4 – 3 JobA’B’ 16*6*8 25*5* *7*12 HW # 14 Convert it to a two-machine problem : 1 2 3

Fi F’=( )/4 = 22 Total Flow Time = 32 HW # 14 A B C

12 HW # 15 Total time = =135 Total time = = 160 ∴ Total makespan =135

13 HW # 15 F 1 = 120 F 2 = 135

14 Total time = 18+5 = 23 Total time = 18+2 = 20 HW # 16 ∴ Total makespan = 20

15 F 1 = 20 F 2 = 14 HW # 16 Total makespan being minimized = 20 The End