Introduction to Operations Research (II)

Slides:

Advertisements

Similar presentations

Session II – Sequencing

Advertisements

Scheduling in Distributed Systems Gurmeet Singh CS 599 Lecture.

Production and Operations Management Systems

A 2 L Heuristic Algorithm for Scheduling Tasks on Non-Identical Machines Alexander C. Tubbs Alison L. Steppig Laura A. Hemker Southern Illinois University.

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.

© J. Christopher Beck Lecture 7: Shifting Bottleneck.

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.

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.

Operations Scheduling

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

Operations Scheduling

Scheduling Chapter 19.

D1: Quick Sort. The quick sort is an algorithm that sorts data into a specified order. For a quick sort, select the data item in the middle of the list.

Short Term Scheduling Introduction What – Scheduling or timing of operations Where – Timing of operations affects the overall strategy Why – Reduce costs,

Inputs and Outputs to Aggregate Production Planning

5. Operations Scheduling

MODELING AND ANALYSIS OF MANUFACTURING SYSTEMS Session 6 SCHEDULING E

1 IOE/MFG 543 Chapter 7: Job shops Sections 7.1 and 7.2 (skip section 7.3)

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.

A processor is a person, machine, computer, or robot etc., which works on a task. To solve a scheduling problem typically the tasks are scheduled to minimize.

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

Copyright 2009, John Wiley & Sons, Inc. Beni Asllani University of Tennessee at Chattanooga Scheduling Operations Management - 5 th Edition Chapter 17.

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

Chapter 15: Production Scheduling TM 663 Operations Planning November 28,2011 Paula Jensen.

Operations Scheduling

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.

Exercise Find a schedule that minimises makespan..

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

1 Operations Scheduling Act I – The Single Machine Problem General problem: given processing times, setups times, due dates, and job flows on machines.

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.

Preparing for the next Midterm Adventures in production engineering.

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

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

Lecture 9: Simplified Shifting Bottleneck

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

Scheduling for Low-volume Operations

1 Searching and Sorting Searching algorithms with simple arrays Sorting algorithms with simple arrays –Selection Sort –Insertion Sort –Bubble Sort –Quick.

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.

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

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

 Allocation of resources over time to accomplish specific tasks.  Scheduling is done in the short term time horizon i.e. months, weeks or days.  Effective.

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.

Production Activity Control

Scheduling Operations

Searching and Sorting Searching algorithms with simple arrays

Inputs and Outputs to Aggregate Production Planning

Algorithm Design Methods

CPU scheduling 6. Schedulers, CPU Scheduling 6.1. Schedulers

Scheduling Scheduling is an important tool for manufacturing and service industries, where it can have a major impact on the productivity of a process.

Introduction to Scheduling Chapter 1

Chapter 5: CPU Scheduling

8 Job Sequencing & Operations Scheduling CHAPTER Arranged by

Process Scheduling B.Ramamurthy 2/23/2019.

Algorithm Design Methods

Table of contents 1. Introduction – your product, sketch, description, functionality, variants 2. Bill of materials 3. Manufacturing process- block diagram.

Algorithm Design Methods

IE 3265 – POM R. Lindeke Spring 2005

Inputs and Outputs to Aggregate Production Planning

Presentation transcript:

Introduction to Operations Research (II) Z. Max Shen IEOR, Berkeley Last update September 7, 1999

Production Scheduling Let all things be done decently and in order. – I Corinthians

Goals of Production Scheduling High Customer Service: on-time delivery Low Inventory Levels: WIP and FGI High Utilization: of machines UTILIZATION SERVICE INVENTORY

QUICK WASH AND DRY There are 3 jobs (dirty plates and utensils) that need to be processed (washed and dried) on two machines. These jobs need to be done first on machine 1 (wash) and then on machine 2 (dry). These jobs can be done only one at a time at each machine and at one machine at a time. The times needed to process these 3 jobs on machines 1 and 2 are given below.

QUICK WASH AND DRY Find a sequence to process these jobs on machine 1 and machine 2 so that the time at which the last job on machine 2 is finished is minimized.

QUICK WASH AND DRY There are 6 jobs (dirty plates and utensils) that need to be processed (washed and dried) on two machines. These jobs need to be done first on machine 1 (wash) and then on machine 2 (dry). These jobs can be done only one at a time at each machine and at one machine at a time. The times needed to process these 6 jobs on machines 1 and 2 are given below.

Classic Multi Machine Results Minimizing “Makespan” on Two Machines: given a set of jobs that must go through a sequence of two machines, what sequence will yield the minimum makespan? Mapespan is sequence dependent. Simple algorithm (Johnson 1954): 1. Sort the times of the jobs on the two machines in two lists. 2. Find the shortest time in either list and remove job from both lists. If time came from first list, place job in first available position. If time came from second list, place job in last available position in sequence. 3. Repeat until lists are exhausted. The resulting sequence will minimize makespan.

Johnson’s Algorithm Example Data: Iteration 1: min time is 4 (job 1 on M1); place this job first and remove from lists:

Johnson’s Algorithm Example (cont.) Iteration 2: min time is 5 (job 3 on M2); place this job last and remove from lists: Iteration 3: only job left is job 2; place in remaining position (middle). Final Sequence: 1-2-3 Makespan: 28

Gantt Chart for Johnson’s Algorithm Example Short task on M2 to “clear out” quickly. Short task on M1 to “load up” quickly.