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.

Slides:

Advertisements

Similar presentations

Controlling a manufacturing system efficiently IE450 Fall 2005 Dr. Richard A. Wysk.

Advertisements

Production and Operations Management Systems

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

Scheduling for Low-volume Operations Chapter 15 Operations Management by R. Dan Reid & Nada R. Sanders 2nd Edition © Wiley 2005 PowerPoint Presentation.

© The McGraw-Hill Companies, Inc., 1998 Irwin/McGraw-Hill Module 11 Operations Scheduling Chapter 16 (pp ) Work Center and definitions  Objectives.

PowerPoint presentation to accompany Operations Management, 6E (Heizer & Render) © 2001 by Prentice Hall, Inc., Upper Saddle River, N.J Operations.

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

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

Operations Scheduling

Scheduling Chapter 19.

Operations Scheduling

Introduction to Operations Research (II)

Chapter 16 Scheduling Scheduling

© 2007 Pearson Education Scheduling Chapter 16. © 2007 Pearson Education Scheduling  Scheduling: The allocation of resources over time to accomplish.

5. Operations Scheduling

MODELING AND ANALYSIS OF MANUFACTURING SYSTEMS Session 6 SCHEDULING E

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

1 ISQA 459/559 Mellie Pullman Scheduling Shop Floor.

Sequencing Problem.

1 Chapter 15 Scheduling. 2 Scheduling: Establishing the timing of the use of equipment, facilities and human activities in an organization Answering “when”

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

CHAPTER 19 Scheduling Operations Management, Eighth Edition, by William J. Stevenson Copyright © 2005 by The McGraw-Hill Companies, Inc. All rights reserved.

Chapter 16: Learning Objectives

Operations Management Contemporary Concepts and Cases Chapter Thirteen Scheduling Operations Copyright © 2011 by The McGraw-Hill Companies, Inc. All rights.

OPERATIONS SCHEDULING AND SEQUENCING

Industrial Systems Engineering Dept. İzmir University of Economics

1. Facility size 2. Equipment procurement Long-term

McGraw-Hill/Irwin Copyright © 2007 by The McGraw-Hill Companies, Inc. All rights reserved. 16 Scheduling.

To Accompany Krajewski & Ritzman Operations Management: Strategy and Analysis, Sixth Edition © 2002 Prentice Hall, Inc. All rights reserved. Chapter 17.

15-1Scheduling William J. Stevenson Operations Management 8 th edition.

15-1Scheduling William J. Stevenson Operations Management 8 th edition.

15-1Scheduling Operations Scheduling Chapter Scheduling The Hierarchy of Production Decisions The logical sequence of operations in factory planning.

1 1 Slide Short – Term Scheduling Professor Ahmadi.

Operations Scheduling Supplement J Copyright ©2013 Pearson Education, Inc. publishing as Prentice Hall J - 01.

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 Chapter 15 Operations Management by R. Dan Reid & Nada R. Sanders 2nd Edition © Wiley 2005 PowerPoint Presentation.

Chapter 17 Scheduling. Management 3620Chapter 17 Schedule17-2 Overview of Production Planning Hierarchy Capacity Planning 1. Facility size 2. Equipment.

10/6 Production Sequencing Roll call/collect homework issues w/ Excel for CPM lecture: production sequencing small groups assign homework.

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.

Scheduling for Low-volume Operations

Bonus Round Assembly Line Scheduling Assume Assembly Line is used for multiple products 1.

Parallel Machine Scheduling

Scheduling Seminar exercises Process and Production Management.

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

Scheduling McGraw-Hill/Irwin Copyright © 2012 by The McGraw-Hill Companies, Inc. All rights reserved.

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

To Accompany Krajewski & Ritzman Operations Management: Strategy and Analysis, Seventh Edition © 2004 Prentice Hall, Inc. All rights reserved. Scheduling.

To Accompany Ritzman & Krajewski Foundations of Operations Management, © 2003 Prentice Hall, Inc. All rights reserved. Supplement J Operations Scheduling.

Scheduling Copyright © 2015 McGraw-Hill Education. All rights reserved. No reproduction or distribution without the prior written consent of McGraw-Hill.

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.

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.

Scheduling Operations

Lecture 8: Dispatch Rules

OPERATIONS SCHEDULING AND SEQUENCING

Chap 11 Learning Objectives

8 Job Sequencing & Operations Scheduling CHAPTER Arranged by

Planning and Scheduling

Branch and Bound Example

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

Production and Operations Management

Scheduling Seminar exercises

Presentation transcript:

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 time among the jobs not yet scheduled. If two or more jobs are tied, choose one job arbitrarily. Step 2. If the shortest processing time is on workstation 1, schedule the corresponding job as early as possible. If the shortest processing time is on workstation 2, schedule the corresponding job as late as possible. Step 3. Eliminate the last job scheduled from further consideration. Repeat steps 1 and 2 until all jobs have been scheduled.

Example 16.5 Johnson’s Rule at the Morris Machine Co. Time (hr) Motor Workstation 1 Workstation 2 M1 12 22 M2 4 5 M3 5 3 M4 15 16 M5 10 8 Eliminate M5 from consideration. The next shortest time is M1 at workstation #1, so schedule M1 next. Eliminate M3 from consideration. The next shortest time is M2 at Workstation 1, so schedule M2 first. Shortest time is 3 hours at workstation 2, so schedule job M3 last. Eliminate M1 and the only job remaining to be scheduled is M4. Eliminate M2 from consideration. The next shortest time is M5 at workstation #2, so schedule M5 next to last. Sequence = M2 M1 M4 M5 M3 61

Example 16.5 Johnson’s Rule at the Morris Machine Co. The schedule minimizes the idle time of workstation 2 and gives the fastest repair time for all five motors. No other sequence will produce a lower makespan. Workstation M2 (4) M1 (12) M4 (15) M5 (10) M3 (5) Idle—available for further work 5 10 15 20 25 30 Day 35 40 45 50 55 60 65 Idle 2 (22) (16) (8) (3) 1 Gantt Chart for the Morris Machine Company Repair Schedule 88

Johnson’s 2 M/c Algorithm Job 1 2 3 4 5 6 7 8 A 10 B Schedule 1 2 6 8 7 5 4 3

Johnson’s 2 M/c Algorithm Optimal Sequence Job 1 2 6 8 7 5 4 3 Total Dur (A) 10 54 Dur(B) 48 Start on A 9 14 20 30 36 46 End on A Start on B 12 22 29 35 41 End on B 50 56 Idle Time

Homework Find the Optimal Make-span for the following problems using Johnson's Algorithm Problem 1 Job 1 2 3 4 5 6 7 8 9 10 A B Problem 2

2 Job m Machine case – Akers Method 1 2 3 4 5 6 Total Job1 M/C M1 M3 M2 M5 M4 M6 Duration 7 9 33 Job2 8 35