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

Slides:



Advertisements
Similar presentations
Solving IPs – Cutting Plane Algorithm General Idea: Begin by solving the LP relaxation of the IP problem. If the LP relaxation results in an integer solution,
Advertisements

Nonlinear Programming
Production and Operations Management Systems
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.
MVCP Exercise solving class. Capacity calculations.
1 By: Prof. Y. Peter Chiu 10 / 31 / 2010 POM Oct-2010 – Mid-Term Exam. #1 - A 卷 ~ SOLUTION 2 of 2 ~ #12 ~ #20.
Operations Scheduling
Operations Scheduling
Genetic Algorithms Contents 1. Basic Concepts 2. Algorithm
Lateness Models Contents
Spring, Scheduling Operations. Spring, Scheduling Problems in Operations Job Shop Scheduling. Personnel Scheduling Facilities Scheduling.
1 Tardiness Models Contents 1. Moor’s algorithm which gives an optimal schedule with the minimum number of tardy jobs 1 ||  U j 2. An algorithm which.
Lecture 14 Go over midterm results Algorithms Efficiency More on prime numbers.
21st European Conference on Operational Research Algorithms for flexible flow shop problems with unrelated parallel machines, setup times and dual criteria.
MODELING AND ANALYSIS OF MANUFACTURING SYSTEMS Session 6 SCHEDULING E
1 Set # 3 Dr. LEE Heung Wing Joseph Phone: Office : HJ639.
1 By: Prof. Y. Peter Chiu Materials Management Scheduling ~ HOMEWORK SOLUTION ~
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 ~
Lecture 36 CSE 331 Dec 2, Graded HW 8 END of the lecture.
1 IOE/MFG 543 Chapter 14: General purpose procedures for scheduling in practice Section 14.4: Local search (Simulated annealing and tabu search)
1 Wagner – Whitin Algorithm Prof. Yuan-Shyi Peter Chiu Feb Material Management Class Note #1-B.
Lecture 37 CSE 331 Dec 1, A new grading proposal Towards your final score in the course MAX ( mid-term as 25%+ finals as 40%, finals as 65%) .
Using Simulated Annealing and Evolution Strategy scheduling capital products with complex product structure By: Dongping SONG Supervisors: Dr. Chris Hicks.
1 IOE/MFG 543 Chapter 10: Single machine stochastic models Sections 10.1 and 10.4 You may skip Sections
1 Chapter 15 Scheduling. 2 Scheduling: Establishing the timing of the use of equipment, facilities and human activities in an organization Answering “when”
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.
Operational Research & ManagementOperations Scheduling Introduction Operations Scheduling 1.Setting up the Scheduling Problem 2.Single Machine Problems.
Scheduling Process and Production Management.
1 Short Term Scheduling. 2  Planning horizon is short  Multiple unique jobs (tasks) with varying processing times and due dates  Multiple unique jobs.
Scheduling for Low-volume Operations
& 6.855J & ESD.78J Algorithm Visualization The Ford-Fulkerson Augmenting Path Algorithm for the Maximum Flow Problem.
The Ford-Fulkerson Augmenting Path Algorithm for the Maximum Flow Problem Thanks to Jim Orlin & MIT OCW.
Optimization. I. Textbook Examples How did we know that the domain of A is [0,100]
Prof. Yuan-Shyi Peter Chiu
Production SchedulingP.C. Chang, IEM, YZU. 1 Hybrid Algorithm for mean T Hybrid Algorithm : Dominance matrix to decompose problem in to sub-problems. Branch.
1 By: Prof. Y. Peter Chiu POM Chap-8: Scheduling ~ Homework Problems ~
Production SchedulingP.C. Chang, IEM, YZU. 1 How to schedule ?? How to find 1. an efficient Heuristic? 2. the optimal solution?
1 Exercise 1. (a) Find all optimal sequences for the scheduling problem 1 ||  w j C j with the following jobs. (b) Determine the effect of a change in.
Raunak Singh (ras2192) IEOR 4405: Production Scheduling 28 th April 2009.
Polyhedral Optimization Lecture 5 – Part 3 M. Pawan Kumar Slides available online
Product A Product B Product C A1A1 A2A2 A3A3 B1B1 B2B2 B3B3 B4B4 C1C1 C3C3 C4C4 Turret lathes Vertical mills Center lathes Drills From “Fundamentals of.
ENGM 631 Maximum Flow Solutions. Maximum Flow Models (Flow, Capacity) (0,3) (2,2) (5,7) (0,8) (3,6) (6,8) (3,3) (4,4) (4,10)
16 Scheduling (focus on sequencing; FCFS, SPT, EDD pages , and Johnson’s rule pages ) Homework; 6, 7, 11.
Arithmetic and Geometric Means
From: Cost-Optimized FPSO Mooring Design Via Harmony Search
CHAPTER 8 Operations Scheduling
Randomized Algorithm (Lecture 2: Randomized Min_Cut)
Lecture 21 Primal-Dual in Algorithms
BACK SOLUTION:
Maximum Flow Solutions
در تجزیه و تحلیل شغل باید به 3 سوال اساسی پاسخ دهیم Job analysis تعریف کارشکافی، مطالعه و ثبت جنبه های مشخص و اساسی هر یک از مشاغل عبارتست از مراحلی.
Edmonds-Karp Algorithm
WELCOME.
If we increase b2 from 10 to 20 will the optimal basis change?
optimal basis will not change
Problem Solving 4.
4n + 2 1st term = 4 × = 6 2nd term = 4 × = 10 3rd term
Solving Systems of Equation by Substitution
Lecture 34 CSE 331 Nov 21, 2016.
optimal basis will not change
X y y = x2 - 3x Solutions of y = x2 - 3x y x –1 5 –2 –3 6 y = x2-3x.
7. Ford-Fulkerson Algorithm with multiple optimal solutions
COMP108 Algorithmic Foundations Searching
1 1 Find a maximum Matching ? Women Men.
Lecture 6 Dynamic Programming
COMP108 Algorithmic Foundations Searching

IE 3265 – POM R. Lindeke Spring 2005
Presentation transcript:

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

#1 (a) By SPT: 1 – 3 – 6 – 2 – 7 – 5 – 4 Total Flow time= 171 ∴ Mean Flow Time= 171 / 7 = #1 (b) By EDD: 1 – 6 – 3 – 2 – 5 – 7 – 4 Total Flow time= 173 Total Tardiness=12 ∴ Maximum Tardiness = 8

#1 (c) 1st by EDD: 1 – 6 – 3 – 2 – 5 – 7 – 4 According to Moore’s algorithm Delete Job #5 First #1 (c) 2nd iteration: 1 – 6 – 3 – 2 – 7 – 4 According to Moore’s algorithm According to Moore’s algorithm Done! ∴ 1 – 6 – 3 – 2 – 7 – 4 – 5 & Number of Tardy Job = 1 ; That is Job #5

By Chiu’s algorithm V 1 ={3,6,8} max D i → 6 V 2 ={3,5,8} max D i → 5 V 3 ={2,3,8} → 8 V 4 ={2,3,7} → 7 V 5 ={2,3,4} → 2 V 6 ={1,3,4} → 4 V 7 ={1,3} → 3 Last → 1  The Optimal sequence is #2

#3 Finite Production Rate Model

(a) (b) #4  (c)

# 5 W-82R X-37R P-64R $ $ $

The End