Operations Research Management Science ( 경영과학 ) 2014 년 1 학기 담당교수 : 윤 석 훈 산업공학개론 0.

Slides:



Advertisements
Similar presentations
Network Models Robert Zimmer Room 6, 25 St James.
Advertisements

Network Models Robert Zimmer Room 6, 25 St James.
1 Material to Cover  relationship between different types of models  incorrect to round real to integer variables  logical relationship: site selection.
BU BU Decision Models Networks 1 Networks Models Summer 2013.
Operations Research Assistant Professor Dr. Sana’a Wafa Al-Sayegh 2 nd Semester ITGD4207 University of Palestine.
Transportation Problem (TP) and Assignment Problem (AP)
1 1 Slides by John Loucks St. Edward’s University Modifications by A. Asef-Vaziri.
Chapter 10, Part A Distribution and Network Models
Transportation, Transshipment and Assignment Models and Assignment Models.
Transportation and Assignment Models
1Transportation ModelsLesson 4 LECTURE FOUR Transportation Models.
Assignment Meeting 15 Course: D Deterministic Optimization Year: 2009.
Operations Research Assignment Problem.
Production Scheduling
The Transportation and Assignment Problems
To accompany Quantitative Analysis for Management, 8e by Render/Stair/Hanna 10-1 © 2003 by Prentice Hall, Inc. Upper Saddle River, NJ Chapter 10.
Computational Methods for Management and Economics Carla Gomes
Supply Chain Operations: Making and Delivering
Transportation-1 Operations Research Modeling Toolset Linear Programming Network Programming PERT/ CPM Dynamic Programming Integer Programming Nonlinear.
Linear Programming Applications
Chapter 7 Transportation, Assignment & Transshipment Problems Part 1 ISE204/IE252 Prof. Dr. Arslan M. ÖRNEK.
Operational Research & Management By Mohammad Shahid Khan M.Eco., MBA, B.Cs., B.Ed Lecturer in Economics and Business Administration Department of Economics.
Operations Research I Lecture 1-3 Chapter 1
 Group 3 Vahe Karapetyan Dena Rad Eidin Balali Patrick Njathi Zhong Zheng Damilare Adeoye Operations Research & Linear Programming Agenda Introduction.
Transportation Model Lecture 16 Dr. Arshad Zaheer
Supply Chain Planning Dinesh Garg Indian Institute of Science Bangalore-India September 27, 2003 Foundations of Global Supply Chain Management.
1 1 Slide © 2008 Thomson South-Western. All Rights Reserved Slides by JOHN LOUCKS St. Edward’s University.
1 1 Slide © 2009 South-Western, a part of Cengage Learning Slides by John Loucks St. Edward’s University.
Chapter 5 Network Models. Thomson/South-Western 2007 © South-Western/Cengage Learning © 2012 Practical Management Science, 4e Winston/Albright Introduction.
1 Botond Kovari: Crew Planning 1 st Int. Conf. on Research in Air Transportation - Zilina, Nov 22-24, 2004 Cost Optimisation Methods in Air Crew Planning.
Transportation Transportation models deals with the transportation of a product manufactured at different plants or factories supply origins) to a number.
Slide 1 of 27 Assignment Problem: Hungarian Algorithm and Linear Programming collected from the Internet and edited by Longin Jan Latecki.
Chapter 7 Transportation, Assignment & Transshipment Problems
Supply Chain Management AN INITIATIVE BY: VAINY GOEL BBA 1 MODI COLLEGE.
 Consists of nodes representing a set of origins and a set of destinations.  An arc is used to represent the route from each origins to each destinations.
Scheduling Copyright © 2015 McGraw-Hill Education. All rights reserved. No reproduction or distribution without the prior written consent of McGraw-Hill.
. 1 Transportation and Assignment Problems. . 2 Applications Physical analog of nodes Physical analog of arcs Flow Communication systems phone exchanges,
Assignment Problem. Definition Assignment Problem is a balanced transportation problem in which all supplies and demand are equal to 1.
QUANTITATIVE ANALYSIS FOR MANAGERS TRANSPORTATION MODEL
DISTRIBUTION AND NETWORK MODELS (1/2)
1 Network Models Transportation Problem (TP) Distributing any commodity from any group of supply centers, called sources, to any group of receiving.
1 1 Slide © 2008 Thomson South-Western. All Rights Reserved Slides by JOHN LOUCKS St. Edward’s University.
Log Truck Scheduling Problem
Network Flow Problems Example of Network Flow problems:
Network Flow Problems – The Assignment Problem
1 Optimization Techniques Constrained Optimization by Linear Programming updated NTU SY-521-N SMU EMIS 5300/7300 Systems Analysis Methods Dr.
Transportation Problems Joko Waluyo, Ir., MT., PhD Dept. of Mechanical and Industrial Engineering.
TM 631 Optimization Assignment Problems. Prototype Problem K-Corp has 3 parts, each of which can be assigned to 1 of 3 machines. The problem is to assign.
1 1 Slide © 2008 Thomson South-Western. All Rights Reserved © 2011 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or.
DEPARTMENT/SEMESTER ME VII Sem COURSE NAME Operation Research Manav Rachna College of Engg.
QUANTITATIVE METHODS FOR MANAGERS ASSIGNMENT MODEL.
Distribution Model Meaning Types Transportation Model Assignment Model.
Assignment Problem: Hungarian Algorithm and Linear Programming collected from the Internet and extended by Longin Jan Latecki.
The Transportation and Assignment Problems
Process Economics Factors that affect profitability
ENGM 535 Optimization Assignment Problems.
Introduction First established as Federal Express, today’s FedEx Corporation is one of the most recognized brands for their express delivery system, FedEx.
Special Cases In Linear Programming
Assignment Problem: Hungarian Algorithm and Linear Programming collected from the Internet and extended by Longin Jan Latecki.
Assignment Problem A balanced transportation problem in which
1.206J/16.77J/ESD.215J Airline Schedule Planning
Assignment Problem: Hungarian Algorithm and Linear Programming collected from the Internet and extended by Longin Jan Latecki.
Chapter 7 Transportation, Assignment & Transshipment Problems
Scheduling Scheduling is an important tool for manufacturing and service industries, where it can have a major impact on the productivity of a process.
Transportation Problems
Chapter 5 Transportation, Assignment, and Transshipment Problems
Production and Operations Management
Collaborative Decision Making “Developing A Collaborative Framework”
Decision Science Chapter 6 Assignment Models.
Assignment Problem: Hungarian Algorithm and Linear Programming collected from the Internet and extended by Longin Jan Latecki.
Presentation transcript:

Operations Research Management Science ( 경영과학 ) 2014 년 1 학기 담당교수 : 윤 석 훈 산업공학개론 0

담당교수 : 윤석훈산업공학개론 (2014/S) Operations Research? The beginning of the activity called operations research has generally been attributed to the military services early in World War II. Because of the war effort, there was an urgent need to allocate scarce resources to the various military operations and to the activities within each operation in an effective manner. 1

담당교수 : 윤석훈산업공학개론 (2014/S) Operations Research? 2 Therefore, the British and then the U.S. military management called upon a large number of scientists to apply a scientific approach to dealing with this and other strategic and tactical problems. In effect, they were asked to do research on (military) operations. These teams of scientists were the first OR teams.

담당교수 : 윤석훈산업공학개론 (2014/S) Operations Research? 3 By developing effective methods of using the new tool of radar, these teams were instrumental in winning the Air Battle of Britain. Through their research on how to better manage convoy and antisubmarine operations, they also played a major role in winning the Battle of the North Atlantic. Similar efforts assisted the Island Campaign in the Pacific.

담당교수 : 윤석훈산업공학개론 (2014/S) World War II 4

담당교수 : 윤석훈산업공학개론 (2014/S) Submarine 5 A Russian Navy Thphoon-class submarine

담당교수 : 윤석훈산업공학개론 (2014/S) Submarine 6

담당교수 : 윤석훈산업공학개론 (2014/S) Under the sea 7

담당교수 : 윤석훈산업공학개론 (2014/S) Missile 8

담당교수 : 윤석훈산업공학개론 (2014/S) Missile 9 1) Targeting and/or guidance 2) Flight system 3) Engine 4) Warhead

담당교수 : 윤석훈산업공학개론 (2014/S) Elevator Problem 10

담당교수 : 윤석훈산업공학개론 (2014/S) Federal Express 11 Federal Express (FedEx) is the world’s largest express transportation company. Every working day, it delivers more than 6.5 million documents, packages, and other items throughout the United States and more than 220 countries and territories around the world. In some cases, these shipments can be guaranteed overnight delivery by 10:30 A.M. the next morning.

담당교수 : 윤석훈산업공학개론 (2014/S) Federal Express 12 The logistical challenges involved in providing this service are staggering. These millions of daily shipments must be individually sorted and routed to the correct general location (usually by aircraft) and then delivered to the exact destination (usually by motorized vehicle) in an amazingly short period of time. How is all this possible?

담당교수 : 윤석훈산업공학개론 (2014/S) Federal Express 13 Operations research (OR) is the technological engine that drives this company. Ever since its founding in 1973, OR has helped make its major business decisions, including equipment investment, route structure, scheduling, finances, and location of facilities. After OR was credited with literally saving the company during its early years, it became the custom to have OR represented at the weekly senior management meetings and, indeed, several of the senior corporate vice presidents have come up from the outstanding FedEx OR group.

담당교수 : 윤석훈산업공학개론 (2014/S) Federal Express 14 FedEx has come to be acknowledged as a world-class company. It routinely ranks among the top companies on Fortune Magazine’s annual listing of the “World’s Most Admired Companies.” It also was the first winner (in 1991) of the prestigious prize now known as the INFORMS Prize, which is awarded annually for the effective and repeated integration of OR into organizational decision making in pioneering, varied, novel, and lasting ways.

담당교수 : 윤석훈산업공학개론 (2014/S) Scheduling 15 MC 1 MC 2 BDECA BDECA MC 1 MC 2 BDECA BDECA Idle time Minimize makespan Optimal Schedule

담당교수 : 윤석훈산업공학개론 (2014/S) Location Problem 16

담당교수 : 윤석훈산업공학개론 (2014/S) Optimization Shortest Path Problem 2. Minimum Cost Network Problem 1. Traveling Salesman Problem 3. Maximal Flow Problem sourcesink

담당교수 : 윤석훈산업공학개론 (2014/S) Transportation Problem 18 sourcedestination The transportation problem is concerned with distributing any commodity from any group of supply centers, called sources, to any group of receiving centers, called destinations, in such a way as to minimize the total distribution cost.

담당교수 : 윤석훈산업공학개론 (2014/S) Transportation Problem 19 supply … demand … c ij : unit transportation cost from i to j x ij : number of items from i to j

담당교수 : 윤석훈산업공학개론 (2014/S) Continental Airlines 20 Continental Airlines is a major U.S. air carrier that transports passengers, cargo, and mail. It operates more than 2,000 daily departures to well over 100 domestic destinations and nearly 100 foreign destinations.

담당교수 : 윤석훈산업공학개론 (2014/S) Continental Airlines 21 Airlines like Continental face schedule disruptions daily because of unexpected events, including inclement weather, aircraft mechanical problems, and crew unavailability. These disruptions can cause flight delays and cancellations. As a result, crews may not be in position to service their remaining scheduled flights. Airlines must reassign crews quickly to cover open flights and to return them to their original schedules in a cost- effective manner while honoring all government regulations, contractual obligations, and quality-of-life requirements.

담당교수 : 윤석훈산업공학개론 (2014/S) Continental Airlines 22 To address such problems, an OR team at Continental Airlines developed a detailed mathematical model for reassigning crews to flights as soon as such emergencies arise. Because the airline has thousands of crews and daily flights, the model needed to be huge to consider all possible pairings of crews with flights. Therefore, the model has millions of decision variables and many thousands of constraints. In its first year of use (mainly in 2001), the model was applied four times to recover from major schedule disruptions (two snowstorms, a flood, and the September 11 terrorist attacks). This led to savings of approximately $40 million. Subsequent applications extended to many daily minor disruptions as well.

담당교수 : 윤석훈산업공학개론 (2014/S) Continental Airlines 23 Although other airlines subsequently scrambled to apply operations research in a similar way, this initial advantage over other airlines in being able to recover more quickly from schedule disruptions with fewer delays and cancelled flights left Continental Airlines in a relatively strong position as the airline industry struggled through a difficult period during the initial years of the 21st century. This initiative led to Continental winning the prestigious First Prize in the 2002 international competition for the Franz Edelman Award for Achievement in Operations Research and the Management Sciences.

담당교수 : 윤석훈산업공학개론 (2014/S) Assignment Problem 24 The assignment problem is a special type of linear programming problem where assignees are being assigned to perform tasks.

담당교수 : 윤석훈산업공학개론 (2014/S) Hungarian Method Subtract the smallest number in each row from every number in the row. (This is called row reduction.) Enter the results in a new table. 2. Subtract the smallest number in each column of the new table from every number in the column. (This is called column reduction.) Enter the results in another table.

담당교수 : 윤석훈산업공학개론 (2014/S) Hungarian Method Test whether an optimal set of assignments can be made. You do this by determining the minimum number of lines needed to cover (i.e., cross out) all zeros. Since this minimum number of lines equals the maximum number of assignments that can be made to zero element positions, if the minimum number of lines equals the number of rows, an optimal set of assignments is possible. (If you find that a complete set of assignments to zero element positions is not possible, this means that you did not reduce the number of lines covering all zeros down to the minimum number.) In that case, go to step 6. Otherwise go on to step 4.

담당교수 : 윤석훈산업공학개론 (2014/S) Hungarian Method If the number of lines is less than the number of rows, modify the table in the following way: a. Subtract the smallest uncovered number from every uncovered number in the table. b. Add the smallest uncovered number to the numbers at intersections of covering lines. c. Numbers crossed out but not at the intersections of cross-out lines carry over unchanged to the next table. 5. Repeat steps 3 and 4 until an optimal set of assignments is possible.

담당교수 : 윤석훈산업공학개론 (2014/S) Hungarian Method Make the assignments one at a time in positions that have zero elements. Begin with rows or columns that have only one zero. Since each row and each column needs to receive exactly one assignment, cross out both the row and the column involved after each assignment is made. Then move on to the rows and columns that are not yet crossed out to select the next assignment, with preference again given to any such row or column that has only one zero that is not crossed out. Continue until every row and every column has exactly one assignment and so has been crossed out. The complete set of assignments made in this way is an optimal solution for the problem.

담당교수 : 윤석훈산업공학개론 (2014/S) Hungarian Method 29 min 1 – 1 – 2 1

담당교수 : 윤석훈산업공학개론 (2014/S) Hungarian Method 30 Subtract row’s minimum min

담당교수 : 윤석훈산업공학개론 (2014/S) Hungarian Method 31 Subtract column’s minimum The minimum uncovered element is 1.

담당교수 : 윤석훈산업공학개론 (2014/S) Hungarian Method 32 Modify the reduced matrix: The minimum uncovered element is 1.

담당교수 : 윤석훈산업공학개론 (2014/S) Hungarian Method 33 Optimal solution: (1,2), (2,1), (3,5), (4,4), (5,3) The associated optimal cost is 3 – = 5.

담당교수 : 윤석훈산업공학개론 (2014/S) Assignment Problem 34 … … c ij : assignment cost from i to j x ij = 1 if assign job i to machine j

담당교수 : 윤석훈산업공학개론 (2014/S) Swift & Company 35 Swift & Company is a diversified protein-producing business based in Greeley, Colorado. With annual sales of over $8 billion, beef and related products are by far the largest portion of the company’s business.

담당교수 : 윤석훈산업공학개론 (2014/S) Swift & Company 36 To improve the company’s sales and manufacturing performance, upper management concluded that it needed to achieve three major objectives. One was to enable the company’s customer service representatives to talk to their more than 8,000 customers with accurate information about the availability of current and future inventory while considering requested delivery dates and maximum product age upon delivery. A second was to produce an efficient shift- level schedule for each plant over a 28-day horizon. A third was to accurately determine whether a plant can ship a requested order-line-item quantity on the requested date and time given the availability of cattle and constraints on the plant’s capacity.

담당교수 : 윤석훈산업공학개론 (2014/S) Swift & Company 37 To meet these three challenges, an OR team developed an integrated system of 45 linear programming models based on three model formulations to dynamically schedule its beef-fabrication operations at five plants in real time as it receives orders. The total audited benefits realized in the first year of operation of this system were $12.74 million, including $12 million due to optimizing the product mix. Other benefits include a reduction in orders lost, a reduction in price discounting, and better on-time delivery.

담당교수 : 윤석훈산업공학개론 (2014/S) Linear Programming 38 … c j : cost of each unit increase in level of activity j x j : level of activity j a ij : amount of resource i consumed by each unit of activity j b i : amount of resource i that is available for allocation to activities

담당교수 : 윤석훈산업공학개론 (2014/S) Science 39 Solutions Real World Assumed Real World Repeatedly Many The Same