Job sequencing on 3 machines.

Slides:



Advertisements
Similar presentations
SCHEDULING Chapter 6 Summarized from course EK ABWL Produktion & Logistik and KFK Production Analysis 1.
Advertisements

Session II – Sequencing
Developing a Project Plan CHAPTER SIX Copyright © 2011 by The McGraw-Hill Companies, Inc. All rights reserved. McGraw-Hill/Irwin.
Chapter 6: Developing a Project Plan
Developing the Project Plan
Developing a Project Plan
3.3 Solving Multi-Step Equations. A multi-step equation requires more than two steps to solve. To solve a multi-step equation: you may have to simplify.
Add / Subtract Rational Numbers: Unlike Fractions.
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.
Grade 7 Mid Unit Quiz 1. c Solution: = 40 40/4=10
Sequencing Problem.
Estimating Sums and Differences
Lesson 5 -1:. A benchmark is a number that is easy to use when you estimate. When estimating the sums and differences of fractions, we use the benchmarks.
Consecutive Numbers Algebra I.
Notes Over 11.3 Geometric Sequences
Measures Of Central Tendency “AVERAGES”. Measures Of Central Tendency In finding the single number that you felt best described the position at which.
Least Common Multiple (LCM)
DO NOW Evaluate the following and find the absolute value. Then identify whether your solution is a prime or composite number. If it is composite, find.
Which point is located at 3½ ? A B CD Point C is located at 3½.
Unit 9.2_Lesson 2_CD Resource 2f_Plenary Gantt charts From the Gantt Chart answer the question.
Mean, Median, Mode & Range. Mean A number that represents the centre, or average, of a set of numbers; to find the mean, add the numbers in the set, then.
Styling in HTML PowerPoint How to style in HTML. Styling in HTML Styling tags can be added to HTML to place emphasis or add appeal – These tags must be.
Stats Rock Using Pet Rocks to Find the Mean, Median and Mode.
Geometry Mini Quiz 12/10/15 1) 3) Fill in the chart. Write the name of the point of concurrency (where they meet). 2) AltitudesAngle Bisector MediansPerpendicular.
Scheduling Operations IDS 605 Spring Data Collection for Scheduling l Jobs l Activities l Employees l Equipment l Facilities Transparency 18.1.
Chapter 16 & 9 Scheduling Work & Employees. Scheduling Outline What needs to be scheduled? –doctor’s office, restaurant, mfg. plant, hospital –employees.
Transparency Masters to accompany Heizer/Render – Principles of Operations Management, 5e, and Operations Management, 7e © 2004 by Prentice Hall, Inc.,
Measures of Central Tendency Mean, Median, Mode, and Range.
Calculating with Negatives THE FOUR RULES AND NEGATIVE NUMBERS.
Divisibility Rules 01 Number Theory
Series A series is the sum of the terms of a sequence.
Least Common Multiple Greatest Common Factor
Math – Least Common Multiple 1. The __________________________ of two numbers is the ___________ number that is a __________ of both the original.
Numeration Test Wednesday November 5 th.  Understanding whole and decimal numbers  Whole numbers to  Decimals to hundredths 0.99  You need.
Production Activity Control
Confidential1 Exploring Fractions Review. Confidential2 Warm up! 1.25 x x x
Lesson 2.3 Subtracting Integers View in “Slide Show” mode.
Multiplication Facts.
Arithmetic and Geometric
Consecutive Numbers Algebra I.
Warm Up Identify the slope and y-intercept of each equation. Then graph. 1. Y = -5X X + 5Y = X = Y = 12.
Let’s Begin!!! .
Estimating Sums and Differences
10.3 Quadratic Equations from their solutions
Ways to Check for Divisibility
Team member, Team member and Team member
GANTT CHART Text Text Example
BACK SOLUTION:
قانون المنافسة ومنع الاحتكار
Let’s Begin!!! .
Triangle Inequalities
در تجزیه و تحلیل شغل باید به 3 سوال اساسی پاسخ دهیم Job analysis تعریف کارشکافی، مطالعه و ثبت جنبه های مشخص و اساسی هر یک از مشاغل عبارتست از مراحلی.
Sequences and Series Arithmetic series..
Measures of Central Tendency (Mean, Median, & Mode)
Polynomials A polynomial is a sum of monomials. Common polynomials:
Estimating Sums and Differences
TRIANGLE INEQUALITY THEOREM
Law of Sines Goal: To solve triangles which aren’t necessarily
Team member, Team member and Team member
TRIANGLE INEQUALITY THEOREM
How do we know when we can divide one number into another exactly?
TRIANGLE INEQUALITY THEOREM
Let’s Review Functions
Every number has its place!
Mean, Median, Mode, Range, Outlier, & Mean Deviation
Divisibility Rules.
Mean.
Divisibility Rules Dividing by 2
15.) sequence 16.) term of a sequence 17.) arithmetic sequence
Presentation transcript:

Job sequencing on 3 machines. Two conditions for a easy solution: 1. The smallest duration on machine #1 is at least as great as the largest duration on machine #2. 2. The smallest duration on machine #3 is at least as great as the largest duration on machine #2.

Conditions for an easy solution: T1,smallest >= T2,largest AND/OR T3,smallest >= T2,largest

The easy solution: how-to... Add: T1 + T2 & T2 + T3 Use these sums to do Johnson’s rule.

Example: 3 machines Duration (hrs.) Job Mach 1 Mach 2 Mach 3 B 5 3 7

Example: 3 machines Duration (hrs.) Job Mach 1 Mach 2 Mach 3 A 13 5 9 One of the conditions is met. Duration (hrs.) Job Mach 1 Mach 2 Mach 3 A 13 5 9 B 5 3 7 C 6 4 5 D 7 2 6

Example: 3 machines Duration (hrs.) Job Mach 1+2 Mach 2+3 A 13+5 5+9

Example: 3 machines Duration (hrs.) Job Mach 1+2 Mach 2+3 A 18 14

Example: 3 machines Duration (hrs.) Job Mach 1+2 Mach 2+3 A 18 14 B goes first.

Example: 3 machines Duration (hrs.) Job Mach 1+2 Mach 2+3 B 8 10 D goes last.

Example: 3 machines Duration (hrs.) Job Mach 1+2 Mach 2+3 B 8 10 C goes next-to-last.

Example: 3 machines Duration (hrs.) Job Mach 1+2 Mach 2+3 B 8 10 B goes 3rd-to-last.

Ex: 3 machines: Gantt Chart Duration (hrs.) Job Mach 1 Mach 2 Mach 3 B 5 3 7 A 13 5 9 C 6 4 5 D 7 2 6 Time (hrs.) => B B B

Ex: 3 machines: Gantt Chart Duration (hrs.) Job Mach 1 Mach 2 Mach 3 B 5 3 7 A 13 5 9 C 6 4 5 D 7 2 6 Time (hrs.) => B A B A B A

Ex: 3 machines: Gantt Chart Duration (hrs.) Job Mach 1 Mach 2 Mach 3 B 5 3 7 A 13 5 9 C 6 4 5 D 7 2 6 Time (hrs.) => B A C B A C B A C

Ex: 3 machines: Gantt Chart Duration (hrs.) Job Mach 1 Mach 2 Mach 3 B 5 3 7 A 13 5 9 C 6 4 5 D 7 2 6 Time (hrs.) => B A C D B A C D B A C D

Ex: 3 machines: Gantt Chart Duration (hrs.) Job Mach 1 Mach 2 Mach 3 B 5 3 7 A 13 5 9 C 6 4 5 D 7 2 6 31 33 43 24 28 37 5 8 15 18 23 32 B A C D B A C D B A C D