5 Scheduling. Operations Planning and Control
|
|
- Corey Walker
- 7 years ago
- Views:
Transcription
1 5 Scheduling Operations Planning and Control
2 Some Background Machines (resources) are Machines process jobs (molding machine, x ray machine, server in a restaurant, computer ) Machine Environment Single Machine Parallel Machines (identical vs. different) Flow Shops: different machines (e.g. assembly lines) Each job must be processed by each machine exactly once All jobs have the same routing A job cannot begin processing on the second machine until it has completed processing on the first Job Shops Each job may have its own routing Open Shops (e.g. car repair shop) Jobs have no specific routing 2
3 Scheduling Algorithms Instance: particular set of data for the model Exact algorithm: Optimum solution for every instance why Heuristic algorithm: a good solution, we hope, optimal or close to optimal for every instance 3
4 Measures Completion time of job i, Ci Flow time of Job i: Fi=Ci ri, ri as release date Lateness of job i: Li=Ci di, di as due date Tardiness of job i: Ti = max {0;Li}, Li>0 Earliness of job i: Ei=max{0, Li} Number of tardy jobs: Ni 4
5 Some Application Gantt Charts Developed by Henry Gantt (1911) Consider the following four job, three machine jobshop scheduling problem Assume the following sequences: on M on M on M3 5
6 Some Application Gantt Charts (cont.): Example The Gantt Chart oriented towards machines is: Last operation of job 1 is on machine 3 and is completed at time 14. So, completion time, Ci : C 1 = 14 (on machine 3) Also: C 2 = 11 (on machine 3); C 3 = 13 (on machine 1) and C 4 = 10 (on machine 1) 6
7 Some Background Gantt Charts (cont.): Example The makespan is: Since F i = C i r i but r i = 0 in this example for all i, then flowtime and completion time are the same. Total flowtime is: Min 7
8 Some Background Gantt Charts (cont.): Example The lateness and tardiness of a job The total lateness is Number of tardy jobs is (δ i = 1) The total tardiness is The maximum tardiness is 8
9 Common Sequencing Rules FCFS. First Come First Served. Jobs processed in the order they come to the shop SPT. Shortest Processing Time. Jobs with the shortest processing time are scheduled first EDD. Earliest Due Date. Jobs are sequenced according to their due dates CR. Critical Ratio. Schedule the next job with the shortest CR value. Compute the ratio of remaining time until the due date and processing time of the job
10 Common Sequencing Rules A machining center in a job shop for a local fabrication company has 5 unprocessed jobs (1 to 5). Given the processing times and due dates, apply the sequencing rules to determine scheduling options Mean Flow time, Average Tardiness and # tardy jobs Job Number Processing Time Due Date
11 Single Machine Scheduling Introduction Applicability Single Machine Aggregated Machines Bottleneck Machines Methods Simple Methods Target on performance measures Optimization procedures (heuristic, optimal) Sequence dependent setup times Static vs. Dynamic scheduling 11
12 Single Machine Scheduling Minimizing Flow time What if your in process inventory costs dominate? Minimize total flow time tends to minimize total holding costs Example Proposed sequence: Total flowtime (F)=? F = p 1 + (p 1 +p 2 ) + (p 1 +p 2 +p 3 )+...+(p 1 +p p n ) F = n p 1 + (n 1) p p n For this problem F = High value P and delivers asap
13 Single Machine Scheduling Minimizing Flow time Shortest Processing Time (SPT) Sequence of jobs ordered from the smallest to largest processing times Is this optimal? Theorem. SPT sequencing minimizes total flowtime on a single machine with zero release times. Proof. We assume an optimal schedule is not an SPT sequence. S is optimal sequence (assumed) with iand then j S is a schedule where j comes before I The set of jobs B comes before i/j or j/i and A comes after p i > p j TF(S) = TF(B) + (t+p i ) + (t+p i +p j ) + TF(A) TF(S ) = TF(B) + (t+ p j ) + (t+ p j +p i ) + TF(A) TF(S) TF(S )= p i p j > 0» t is the completion of the last job in B, TF(A) and TF(B) are total flowtimes of jobs in A and B 13
14 Single Machine Scheduling Minimizing Flow time Example (cont.) Optimal Schedule is Completion times C 1 = 11, C 2 = 2, C 3 = 7, C 4 = 4 and C 5 =15 Total Flow time = Total Completion Time = 39 Remarks on the SPT Rule Minimizes total time jobs spend in the system (because all release times are 0) Minimizes the mean number of jobs waiting to be processed (mean work in progress) Also minimizes Total Lateness (Li=Ci di). Why? 14 Professor penalty Parkinson Law
15 Single Machine Scheduling Maximal Tardiness and Maximal Lateness Due date oriented measure Earliest due date sequence (EDD) Minimizes the Maximal Tardiness (T max ), T max =max{0;li} Minimizes the Maximal Lateness (L max ), Li=Ci di Example EDD sequence is Tardiness of the jobs is (0, 0, 2, 1, 0) 15 Customer satisfaction Minmax
16 Single Machine Scheduling Number of Tardy Jobs EDD may have several jobs somewhat tardy If the fixed cost component of jobs being tardy dominates we wish to have the most of them on time Moore s Algorithm Step1. Compute the tardiness for each job in the EDD sequence. Set N T =0, and let k be the first position containing a tardy job. If no job is tardy go to step 4. Step 2. Find the job with the largest processing time in positions 1 to k. Step 3. Remove job j* from the sequence, set N T =N T+1, and repeat Step1. Step 4. Place the removed N T jobs in any order at the end of the sequence. This sequence minimizes the number of tardy jobs 16
17 Single Machine Scheduling Number of Tardy Jobs Example EDD sequence Step 1: The tardiness is (0, 0, 2, 1, 0) Job 4 in the third position is the first tardy job; Step 2: The processing times for jobs 5, 3 and 4 are 4, 3, 2, respectively; largest processing time for job 5 Step 3: Remove job 5, go to step 1 Step 1: EDD sequence is ; completion times (3, 5, 7, 11) and tardiness (0, 0, 0, 0) Go to step 4. Step 4: schedule that minimizes the number of tardy jobs is / and has 1 tardy job: Jobs 5 17
18 Single Machine Scheduling Precedence Constraints: Lawler s Algorithm Objective function g i is a non decreasing function of the flow time F i Examples = minimizing maximum lateness ;0 minimizing maximum tardiness 18
19 Single Machine Scheduling Precedence Constraints: Lawler s Algorithm Concept Back scheduling At each step determine the set of jobs V not required to precede any other Among V choose job k that satisfies and corresponds to the processing time of the current sequence Job k is scheduled last Determine again V and is reduced by 19
20 Lawler s Algorithm Example An automotive painting and repair has 6 cars waiting to repairs. Three (1,2,3) from car rental and he agreed to finish these cars based on the due dates. Cars 4,5,6 from a retailer dealer, he agreed that car 4 be completed first (customer is waiting). The processing times and due dates are available for each job. How should be the schedule to minimize the maximum tardiness? Job Pi Due Date
21 Single Machine Scheduling Minimizing Set up Times Sequence dependent set up times The time to change from one product to another may be significant and may depend on the previous part produced p ij = time to process job j if it immediately follows job i Examples: Electronics industry Paint shops Injection molding Minimizes makespan, since it also considers set up Problem is equivalent to the traveling salesman problem (TSP) Plastic Tops 21
22 Single Machine Scheduling Minimizing Set up Times SST = Shortest Set up Time Heuristic A metal products manufacturer has contracted to ship metal braces each day for four customers. Each brace requires a different set up on the rolling mill: *Job C cannot follow job D, because of quality problems SST heuristic:» Step 1 starting arbitrarily by choosing one Job: A» Step 2 B has the smallest set up time following A; A B» Step 3 C has the smallest set up time of all the remaining jobs following B; A B C» Step 4 D is the last remaining job; A B C D A with a makespan of =14 Starting point 22
23 Single Machine Scheduling Minimizing Set up Times A regret based algorithm A regret is a penalty for a decision that was not made Each job must be included once: at least one element from each row Pick the smallest element in each row and their sum is the lower bound on makespan Reduced matrix Row reduction Column reduction Sum of reduced coef = lower bound Find the reduced matrix! Has a 0 in each column and each row 23
24 Single Machine Scheduling Minimizing Set up Times A regret based algorithm (cont.) The reduced matrix is 1 2 If job B does not follow (come after) job A, some other job must follow A» C adds no set up time (is already in the lower bound) Some job must precede B: D has 0 set up» Thus, we have 0 regret not to chose B to follow A A B, A?;? B; 24
25 Single Machine Scheduling Minimizing Set up Times A regret based algorithm (cont.) The reduced matrix is (cont.) 1 2 Zero cell C D» If C does not precede D then we must select other job to precede D (? D)» A can precede D : A D with a regret of 1 time unit» C? : C A with zero regret time unit» Select the jobs pair based on the highest regret value 25
26 Single Machine Scheduling Minimizing Set up Times A regret based algorithm (cont.) Find the cycle sequence that minimizes the set up time Data p ij element of the set up time matrix (even if reduced) R ij regret for element ij, where p ij = 0 C max makespan of the partial sequence L iteration n jobs 26
27 Single Machine Scheduling Minimizing Set up Times A regret based algorithm (cont.) Step 0: C(max) = 0 and L = 1 Step 1: Reduce the Matrix 3 27
28 Single Machine Scheduling Minimizing Set up Times A regret based algorithm (cont.) Step 2: Calculate the regret 3 Step 3 Choose the largest regret : 17 Step 4 Assign a job pair: Job 2 immediately follows job 5 (5 2) L = 1+1; We prohibit
29 Single Machine Scheduling Minimizing Set up Times A regret based algorithm (cont.) New Matrix Step 1: reduce the matrix C(max) = = 24 29
30 Single Machine Scheduling Minimizing Set up Times A regret based algorithm (cont.) Step 2 Calculate the regret Step 3 Chose the largest regret: 9 Step 4 Assign a job pair: 3 1 Prohibit 1 3 Step 1 Reduce the matrix: not possible 30
31 Single Machine Scheduling Minimizing Set up Times A regret based algorithm (cont.) Step 2 Calculate regret Step 3 Choose the largest regret: 3 Step 4 Assign job pair : 1 4; Partial sequence: 5 2, Prohibit 4 1 and 4 3 (to keep from being chosen) Final Matrix Choose 2 3 and 4 5 > sequence The total set up time is 24 31
32 Parallel Machines Introduction A job can be processed in any of the machines The time to process a job is the same on any machine A job consists of a single operation Decision Which machine processes the job? In what order? 32
33 Parallel Machines Introduction List Schedule Sequence of all jobs Assign the next job on the list to the machine with the smallest amount of work assigned Procedure Step 0. Let H i =0, i=1,2,...,m be the assigned workload on machine i, L=([1],[2],...,[n]) the ordered list sequence, C j =0, j=1,2,...,n, and k=1 Step 1. Let j*= L k and H i* =mini =1,m {Hi}; Assign job j* to be processed on machine i*, C j* =H i* +p j*,hi*=h i* +p j* Step 2. Set k=k+1, if k>n, stop. Otherwise go to step 1. 33
34 Parallel Machines Flow Time Consider a facility with 3 identical machines and 15 jobs that need to be done as soon as possible; Processing times(after SPT): 34
35 Parallel Machines Makespan Use the longest processing time list (LPT) Truck Assign the next job on the list to the machine with the least total processing time assigned (heuristic) 35
36 Flow Shops Introduction Jobs processed sequentially on multiple machines All jobs processed in the same order Makespan on a Two Machine Flow Shop Johnson s Algorithm Example Machines Jobs Total Time
37 Flow Shops Makespan on a Two Machine Flow Shop Johnson s Algorithm Example (cont.) Natural schedule for example has a total makespan of 22 h Sequence : makespan of 17» Is this optimal? The makespan must be as large as the sum of the processing times on either machine Makespan must account for unavoidable idle times» For each machine, add the minimum processing time of a job in the other machine» Example: the bound becomes 17, so is optimal 37
38 Flow Shops Makespan on a Two Machine Flow Shop Johnson s Algorithm Step 1» Select the job with the lowest processing time on each machine from the schedulable job list» If the list is empty, the procedure is finished» If the processing time of the job selected is from machine 1, go to step 2, otherwise, go to step 3 Step 2» Schedule the job in the earliest position of the sequence and remove it from the schedulable job list» Return to step 1 Step 3» Schedule the job in the latest position of the sequence and remove it from the schedulable job list» Return to step 1 Johnson s algorithm provides the optimal solution 38
39 Flow Shops Heuristics CDS Heuristic Convert a m machine problem into a two machine problem. How? Procedure Start with: k=1 and l=m; then k=2 and l=m 1; until: k=m 1 and l=2 m 1 schedules are generated Use the best of these m 1 schedules 39
40 Flow Shops Heuristics CDS Heuristic Data Use the CDS to solve the problem First use the Johnson s algorithm for machines 1 and 4 40
41 Flow Shops Heuristics CDS Heuristic Second combine M1 with M2 to pseudomachine 1 and M3 with M4 to pseudomachine 2 Finally combine M1+M2+M3 into pseudomachine 1 and M2+M3+M4 into pseudomachine 2 41
42 Flow Shops Heuristics CDS Heuristic Gantt Chart for CDS schedule 42
43 Job Shops Introduction Different routings for different jobs Difficult to schedule precedence constraints (n!) m possible schedules 43
44 Job Shops Two Machine Job Shops Jackson (1956) adapted the Johnson s algorithm to minimize makespan Job Sets with Machines A and B Machine A: {AB}, {A}, {BA} Machine B: {BA}, {B}, {AB} Why in this order? The order of jobs within the set is to be determined Procedure Machine A: {AB} jobs ordered by Johnson s Algorithm, then {A} in any Shortest Processing Time {BA} jobs in reverse Johnsons order Machine B: {BA} jobs reverse Johnsons order, then {B} in SPT {AB} jobs in ordered by Johnson s Algorithm 44
45 Job Shops Two Machine Job Shops Jackson (1956) adapted the Johnson s algorithm to minimize makespan Example 45
46 Job Shops Two Machine Job Shops Jackson (1956) adapted the Johnson s algorithm to minimize makespan Example 46
47 Stochastic Scheduling: Static Case Single machine case. Suppose that processing times are random variables. If the objective is to minimize average weighted flow time, jobs are sequenced according to expected weighted SPT. That is, if job times are t 1, t 2,..., and the respective weights are u 1, u 2,... then job i precedes job i+1 if E(t i )/u i < E(t i+1 )/u i+1.
48 Stochastic Scheduling: Static Case (continued) Multiple Machines. Requires the assumption that the distribution of job times is exponential, (memoryless property). Assume two parallel machines processing n jobs. Then the optimal sequence is to schedule the jobs according to LEPT (longest expected processing time first). Johnsons algorithm for scheduling n jobs on two machines (flow shop) in the deterministic case has a natural extension to the stochastic case as long as the job times are exponentially distributed.
Factors to Describe Job Shop Scheduling Problem
Job Shop Scheduling Job Shop A work location in which a number of general purpose work stations exist and are used to perform a variety of jobs Example: Car repair each operator (mechanic) evaluates plus
More informationChapter 8. Operations Scheduling
Chapter 8 Operations Scheduling Buffer Soldering Visual Inspection Special Stations Buffer workforce Production Management 161 Scheduling is the process of organizing, choosing and timing resource usage
More informationScheduling Shop Scheduling. Tim Nieberg
Scheduling Shop Scheduling Tim Nieberg Shop models: General Introduction Remark: Consider non preemptive problems with regular objectives Notation Shop Problems: m machines, n jobs 1,..., n operations
More information1 st year / 2014-2015/ Principles of Industrial Eng. Chapter -3 -/ Dr. May G. Kassir. Chapter Three
Chapter Three Scheduling, Sequencing and Dispatching 3-1- SCHEDULING Scheduling can be defined as prescribing of when and where each operation necessary to manufacture the product is to be performed. It
More informationOperations Management
Operations Management Short-Term Scheduling Chapter 15 15-1 Outline GLOAL COMPANY PROFILE: DELTA AIRLINES THE STRATEGIC IMPORTANCE OF SHORT- TERM SCHEDULING SCHEDULING ISSUES Forward and ackward Scheduling
More informationPRODUCTION PLANNING AND SCHEDULING Part 1
PRODUCTION PLANNING AND SCHEDULING Part Andrew Kusiak 9 Seamans Center Iowa City, Iowa - 7 Tel: 9-9 Fax: 9-669 andrew-kusiak@uiowa.edu http://www.icaen.uiowa.edu/~ankusiak Forecasting Planning Hierarchy
More informationCHAPTER 1. Basic Concepts on Planning and Scheduling
CHAPTER 1 Basic Concepts on Planning and Scheduling Scheduling, FEUP/PRODEI /MIEIC 1 Planning and Scheduling: Processes of Decision Making regarding the selection and ordering of activities as well as
More informationScheduling Single Machine Scheduling. Tim Nieberg
Scheduling Single Machine Scheduling Tim Nieberg Single machine models Observation: for non-preemptive problems and regular objectives, a sequence in which the jobs are processed is sufficient to describe
More informationClassification - Examples
Lecture 2 Scheduling 1 Classification - Examples 1 r j C max given: n jobs with processing times p 1,...,p n and release dates r 1,...,r n jobs have to be scheduled without preemption on one machine taking
More informationLOGISTIQUE ET PRODUCTION SUPPLY CHAIN & OPERATIONS MANAGEMENT
LOGISTIQUE ET PRODUCTION SUPPLY CHAIN & OPERATIONS MANAGEMENT CURSUS CONTENTS 1) Introduction 2) Human resources functions 3) A new factory 4) Products 5) Services management 6) Methods 7) Planification
More informationShort-Term Scheduling
Strategic Implications of By scheduling effectively, companies use assets more effectively and create greater capacity per dollar invested, which, in turn, lowers cost This added capacity and related flexibility
More informationOptimal Scheduling for Dependent Details Processing Using MS Excel Solver
BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 8, No 2 Sofia 2008 Optimal Scheduling for Dependent Details Processing Using MS Excel Solver Daniela Borissova Institute of
More informationVEHICLE ROUTING PROBLEM
VEHICLE ROUTING PROBLEM Readings: E&M 0 Topics: versus TSP Solution methods Decision support systems for Relationship between TSP and Vehicle routing problem () is similar to the Traveling salesman problem
More informationIntroduction to production scheduling. Industrial Management Group School of Engineering University of Seville
Introduction to production scheduling Industrial Management Group School of Engineering University of Seville 1 Introduction to production scheduling Scheduling Production scheduling Gantt Chart Scheduling
More informationSingle machine models: Maximum Lateness -12- Approximation ratio for EDD for problem 1 r j,d j < 0 L max. structure of a schedule Q...
Lecture 4 Scheduling 1 Single machine models: Maximum Lateness -12- Approximation ratio for EDD for problem 1 r j,d j < 0 L max structure of a schedule 0 Q 1100 11 00 11 000 111 0 0 1 1 00 11 00 11 00
More informationIntegrated support system for planning and scheduling... 2003/4/24 page 75 #101. Chapter 5 Sequencing and assignment Strategies
Integrated support system for planning and scheduling... 2003/4/24 page 75 #101 Chapter 5 Sequencing and assignment Strategies 5.1 Overview This chapter is dedicated to the methodologies used in this work
More informationIEOR 4404 Homework #2 Intro OR: Deterministic Models February 14, 2011 Prof. Jay Sethuraman Page 1 of 5. Homework #2
IEOR 4404 Homework # Intro OR: Deterministic Models February 14, 011 Prof. Jay Sethuraman Page 1 of 5 Homework #.1 (a) What is the optimal solution of this problem? Let us consider that x 1, x and x 3
More information5 INTEGER LINEAR PROGRAMMING (ILP) E. Amaldi Fondamenti di R.O. Politecnico di Milano 1
5 INTEGER LINEAR PROGRAMMING (ILP) E. Amaldi Fondamenti di R.O. Politecnico di Milano 1 General Integer Linear Program: (ILP) min c T x Ax b x 0 integer Assumption: A, b integer The integrality condition
More informationReal-Time Scheduling (Part 1) (Working Draft) Real-Time System Example
Real-Time Scheduling (Part 1) (Working Draft) Insup Lee Department of Computer and Information Science School of Engineering and Applied Science University of Pennsylvania www.cis.upenn.edu/~lee/ CIS 41,
More informationApproximation Algorithms
Approximation Algorithms or: How I Learned to Stop Worrying and Deal with NP-Completeness Ong Jit Sheng, Jonathan (A0073924B) March, 2012 Overview Key Results (I) General techniques: Greedy algorithms
More informationThis supplement focuses on operations
OPERATIONS SCHEDULING SUPPLEMENT J J-1 J OPERATIONS SCHEDULING LEARNING GOALS After reading this supplement, you should be able to: 1. Define new performance measures (beyond flow time and past due) for
More informationCompletion Time Scheduling and the WSRPT Algorithm
Completion Time Scheduling and the WSRPT Algorithm Bo Xiong, Christine Chung Department of Computer Science, Connecticut College, New London, CT {bxiong,cchung}@conncoll.edu Abstract. We consider the online
More informationFlexible Manufacturing System
Flexible Manufacturing System Introduction to FMS Features of FMS Operational problems in FMS Layout considerations Sequencing of Robot Moves FMS Scheduling and control Examples Deadlocking Flow system
More informationA SIMULATION STUDY FOR DYNAMIC FLEXIBLE JOB SHOP SCHEDULING WITH SEQUENCE-DEPENDENT SETUP TIMES
A SIMULATION STUDY FOR DYNAMIC FLEXIBLE JOB SHOP SCHEDULING WITH SEQUENCE-DEPENDENT SETUP TIMES by Zakaria Yahia Abdelrasol Abdelgawad A Thesis Submitted to the Faculty of Engineering at Cairo University
More informationChapter 11. 11.1 Load Balancing. Approximation Algorithms. Load Balancing. Load Balancing on 2 Machines. Load Balancing: Greedy Scheduling
Approximation Algorithms Chapter Approximation Algorithms Q. Suppose I need to solve an NP-hard problem. What should I do? A. Theory says you're unlikely to find a poly-time algorithm. Must sacrifice one
More information! Solve problem to optimality. ! Solve problem in poly-time. ! Solve arbitrary instances of the problem. #-approximation algorithm.
Approximation Algorithms 11 Approximation Algorithms Q Suppose I need to solve an NP-hard problem What should I do? A Theory says you're unlikely to find a poly-time algorithm Must sacrifice one of three
More information! Solve problem to optimality. ! Solve problem in poly-time. ! Solve arbitrary instances of the problem. !-approximation algorithm.
Approximation Algorithms Chapter Approximation Algorithms Q Suppose I need to solve an NP-hard problem What should I do? A Theory says you're unlikely to find a poly-time algorithm Must sacrifice one of
More informationStandard Form of a Linear Programming Problem
494 CHAPTER 9 LINEAR PROGRAMMING 9. THE SIMPLEX METHOD: MAXIMIZATION For linear programming problems involving two variables, the graphical solution method introduced in Section 9. is convenient. However,
More informationApplied Algorithm Design Lecture 5
Applied Algorithm Design Lecture 5 Pietro Michiardi Eurecom Pietro Michiardi (Eurecom) Applied Algorithm Design Lecture 5 1 / 86 Approximation Algorithms Pietro Michiardi (Eurecom) Applied Algorithm Design
More informationAlgorithm Design and Analysis
Algorithm Design and Analysis LECTURE 27 Approximation Algorithms Load Balancing Weighted Vertex Cover Reminder: Fill out SRTEs online Don t forget to click submit Sofya Raskhodnikova 12/6/2011 S. Raskhodnikova;
More informationReal Time Scheduling Basic Concepts. Radek Pelánek
Real Time Scheduling Basic Concepts Radek Pelánek Basic Elements Model of RT System abstraction focus only on timing constraints idealization (e.g., zero switching time) Basic Elements Basic Notions task
More informationGESTION DE LA PRODUCTION ET DES OPERATIONS PICASSO EXERCICE INTEGRE
ECAP 21 / PROD2100 GESTION DE LA PRODUCTION ET DES OPERATIONS PICASSO EXERCICE INTEGRE 2004-2005 Prof : Pierre Semal : semal@poms.ucl.ac.be Assistants : Eléonore de le Court : delecourt@poms.ucl.ac.be
More informationThe Trip Scheduling Problem
The Trip Scheduling Problem Claudia Archetti Department of Quantitative Methods, University of Brescia Contrada Santa Chiara 50, 25122 Brescia, Italy Martin Savelsbergh School of Industrial and Systems
More informationPriori ty ... ... ...
.Maintenance Scheduling Maintenance scheduling is the process by which jobs are matched with resources (crafts) and sequenced to be executed at certain points in time. The maintenance schedule can be prepared
More informationF E M M Faculty of Economics and Management Magdeburg
OTTO-VON-GUERICKE-UNIVERSITY MAGDEBURG FACULTY OF ECONOMICS AND MANAGEMENT Algorithms for On-line Order Batching in an Order-Picking Warehouse Sebastian Henn FEMM Working Paper No. 34, October 2009 F E
More informationSeradex White Paper A newsletter for manufacturing organizations April, 2004
Seradex White Paper A newsletter for manufacturing organizations April, 2004 Using Project Management Software for Production Scheduling Frequently, we encounter organizations considering the use of project
More informationAn improved on-line algorithm for scheduling on two unrestrictive parallel batch processing machines
This is the Pre-Published Version. An improved on-line algorithm for scheduling on two unrestrictive parallel batch processing machines Q.Q. Nong, T.C.E. Cheng, C.T. Ng Department of Mathematics, Ocean
More information4.6 Linear Programming duality
4.6 Linear Programming duality To any minimization (maximization) LP we can associate a closely related maximization (minimization) LP. Different spaces and objective functions but in general same optimal
More informationBranch-and-Price Approach to the Vehicle Routing Problem with Time Windows
TECHNISCHE UNIVERSITEIT EINDHOVEN Branch-and-Price Approach to the Vehicle Routing Problem with Time Windows Lloyd A. Fasting May 2014 Supervisors: dr. M. Firat dr.ir. M.A.A. Boon J. van Twist MSc. Contents
More informationBatch Scheduling for Identical Multi-Tasks Jobs on Heterogeneous Platforms
atch Scheduling for Identical Multi-Tasks Jobs on Heterogeneous Platforms Jean-Marc Nicod (Jean-Marc.Nicod@lifc.univ-fcomte.fr) Sékou iakité, Laurent Philippe - 16/05/2008 Laboratoire d Informatique de
More informationIntroduction to Scheduling Theory
Introduction to Scheduling Theory Arnaud Legrand Laboratoire Informatique et Distribution IMAG CNRS, France arnaud.legrand@imag.fr November 8, 2004 1/ 26 Outline 1 Task graphs from outer space 2 Scheduling
More informationScheduling Resources and Costs
Student Version CHAPTER EIGHT Scheduling Resources and Costs McGraw-Hill/Irwin Copyright 2011 by The McGraw-Hill Companies, Inc. All rights reserved. Gannt Chart Developed by Henry Gannt in 1916 is used
More informationReinforcement Learning
Reinforcement Learning LU 2 - Markov Decision Problems and Dynamic Programming Dr. Martin Lauer AG Maschinelles Lernen und Natürlichsprachliche Systeme Albert-Ludwigs-Universität Freiburg martin.lauer@kit.edu
More informationSpecial cases in Transportation Problems
Unit 1 Lecture 18 Special cases in Transportation Problems Learning Objectives: Special cases in Transportation Problems Multiple Optimum Solution Unbalanced Transportation Problem Degeneracy in the Transportation
More informationAn Efficient Combination of Dispatch Rules for Job-shop Scheduling Problem
An Efficient Combination of Dispatch Rules for Job-shop Scheduling Problem Tatsunobu Kawai, Yasutaka Fujimoto Department of Electrical and Computer Engineering, Yokohama National University, Yokohama 240-8501
More informationANALYTIC HIERARCHY PROCESS (AHP) TUTORIAL
Kardi Teknomo ANALYTIC HIERARCHY PROCESS (AHP) TUTORIAL Revoledu.com Table of Contents Analytic Hierarchy Process (AHP) Tutorial... 1 Multi Criteria Decision Making... 1 Cross Tabulation... 2 Evaluation
More informationResearch Article Batch Scheduling on Two-Machine Flowshop with Machine-Dependent Setup Times
Hindawi Publishing Corporation Advances in Operations Research Volume 2009, Article ID 153910, 10 pages doi:10.1155/2009/153910 Research Article Batch Scheduling on Two-Machine Flowshop with Machine-Dependent
More informationLoad Balancing. Load Balancing 1 / 24
Load Balancing Backtracking, branch & bound and alpha-beta pruning: how to assign work to idle processes without much communication? Additionally for alpha-beta pruning: implementing the young-brothers-wait
More informationComplexity Theory. IE 661: Scheduling Theory Fall 2003 Satyaki Ghosh Dastidar
Complexity Theory IE 661: Scheduling Theory Fall 2003 Satyaki Ghosh Dastidar Outline Goals Computation of Problems Concepts and Definitions Complexity Classes and Problems Polynomial Time Reductions Examples
More informationModels in Transportation. Tim Nieberg
Models in Transportation Tim Nieberg Transportation Models large variety of models due to the many modes of transportation roads railroad shipping airlines as a consequence different type of equipment
More information7 Gaussian Elimination and LU Factorization
7 Gaussian Elimination and LU Factorization In this final section on matrix factorization methods for solving Ax = b we want to take a closer look at Gaussian elimination (probably the best known method
More informationApproximability of Two-Machine No-Wait Flowshop Scheduling with Availability Constraints
Approximability of Two-Machine No-Wait Flowshop Scheduling with Availability Constraints T.C. Edwin Cheng 1, and Zhaohui Liu 1,2 1 Department of Management, The Hong Kong Polytechnic University Kowloon,
More informationOperation Research. Module 1. Module 2. Unit 1. Unit 2. Unit 3. Unit 1
Operation Research Module 1 Unit 1 1.1 Origin of Operations Research 1.2 Concept and Definition of OR 1.3 Characteristics of OR 1.4 Applications of OR 1.5 Phases of OR Unit 2 2.1 Introduction to Linear
More informationLecture 10 Scheduling 1
Lecture 10 Scheduling 1 Transportation Models -1- large variety of models due to the many modes of transportation roads railroad shipping airlines as a consequence different type of equipment and resources
More informationVENDOR MANAGED INVENTORY
VENDOR MANAGED INVENTORY Martin Savelsbergh School of Industrial and Systems Engineering Georgia Institute of Technology Joint work with Ann Campbell, Anton Kleywegt, and Vijay Nori Distribution Systems:
More informationProject Scheduling: PERT/CPM
Project Scheduling: PERT/CPM Project Scheduling with Known Activity Times (as in exercises 1, 2, 3 and 5 in the handout) and considering Time-Cost Trade-Offs (as in exercises 4 and 6 in the handout). This
More informationLinear Programming. March 14, 2014
Linear Programming March 1, 01 Parts of this introduction to linear programming were adapted from Chapter 9 of Introduction to Algorithms, Second Edition, by Cormen, Leiserson, Rivest and Stein [1]. 1
More informationFormulation of simple workforce skill constraints in assembly line balancing models
Ŕ periodica polytechnica Social and Management Sciences 19/1 (2011) 43 50 doi: 10.3311/pp.so.2011-1.06 web: http:// www.pp.bme.hu/ so c Periodica Polytechnica 2011 Formulation of simple workforce skill
More information56:171 Operations Research Midterm Exam Solutions Fall 2001
56:171 Operations Research Midterm Exam Solutions Fall 2001 True/False: Indicate by "+" or "o" whether each statement is "true" or "false", respectively: o_ 1. If a primal LP constraint is slack at the
More informationProject Scheduling: PERT/CPM
Project Scheduling: PERT/CPM CHAPTER 8 LEARNING OBJECTIVES After completing this chapter, you should be able to: 1. Describe the role and application of PERT/CPM for project scheduling. 2. Define a project
More informationFactoring Algorithms
Factoring Algorithms The p 1 Method and Quadratic Sieve November 17, 2008 () Factoring Algorithms November 17, 2008 1 / 12 Fermat s factoring method Fermat made the observation that if n has two factors
More informationAN ANALYSIS OF THE IMPORTANCE OF APPROPRIATE TIE BREAKING RULES IN DISPATCH HEURISTICS
versão impressa ISSN 0101-7438 / versão online ISSN 1678-5142 AN ANALYSIS OF THE IMPORTANCE OF APPROPRIATE TIE BREAKING RULES IN DISPATCH HEURISTICS Jorge M. S. Valente Faculdade de Economia Universidade
More informationMIP-Based Approaches for Solving Scheduling Problems with Batch Processing Machines
The Eighth International Symposium on Operations Research and Its Applications (ISORA 09) Zhangjiajie, China, September 20 22, 2009 Copyright 2009 ORSC & APORC, pp. 132 139 MIP-Based Approaches for Solving
More informationPART AND TOOL FLOW MANAGEMENT IN MULTI-CELL FLEXIBLE MANUFACTURING SYSTEM
PART AND TOOL FLOW MANAGEMENT IN MULTI-CELL FLEXIBLE MANUFACTURING SYSTEM Mustafa Özbayrak Department of Industrial Engineering Marmara University 81040 Goztepe - Istanbul, TURKEY A. Kursad Turker Melek
More informationBLAST PAST BOTTLENECKS WITH CONSTRAINT BASED SCHEDULING
WHITE PAPER BLAST PAST BOTTLENECKS WITH CONSTRAINT BASED SCHEDULING Blast Past Bottlenecks with Constraint Based Scheduling By Bill Leedale, Senior Advisor, IFS North America The maximum output of many
More informationVehicle Routing and Scheduling. Martin Savelsbergh The Logistics Institute Georgia Institute of Technology
Vehicle Routing and Scheduling Martin Savelsbergh The Logistics Institute Georgia Institute of Technology Vehicle Routing and Scheduling Part I: Basic Models and Algorithms Introduction Freight routing
More informationChapter 3. if 2 a i then location: = i. Page 40
Chapter 3 1. Describe an algorithm that takes a list of n integers a 1,a 2,,a n and finds the number of integers each greater than five in the list. Ans: procedure greaterthanfive(a 1,,a n : integers)
More information4 UNIT FOUR: Transportation and Assignment problems
4 UNIT FOUR: Transportation and Assignment problems 4.1 Objectives By the end of this unit you will be able to: formulate special linear programming problems using the transportation model. define a balanced
More informationSmall Maximal Independent Sets and Faster Exact Graph Coloring
Small Maximal Independent Sets and Faster Exact Graph Coloring David Eppstein Univ. of California, Irvine Dept. of Information and Computer Science The Exact Graph Coloring Problem: Given an undirected
More informationa 11 x 1 + a 12 x 2 + + a 1n x n = b 1 a 21 x 1 + a 22 x 2 + + a 2n x n = b 2.
Chapter 1 LINEAR EQUATIONS 1.1 Introduction to linear equations A linear equation in n unknowns x 1, x,, x n is an equation of the form a 1 x 1 + a x + + a n x n = b, where a 1, a,..., a n, b are given
More informationA Genetic Algorithm Approach for Solving a Flexible Job Shop Scheduling Problem
A Genetic Algorithm Approach for Solving a Flexible Job Shop Scheduling Problem Sayedmohammadreza Vaghefinezhad 1, Kuan Yew Wong 2 1 Department of Manufacturing & Industrial Engineering, Faculty of Mechanical
More informationScheduling of a computer integrated manufacturing system: A simulation study
JIEM, 011 4(4):577-609 Online ISSN: 01-095 Print ISSN: 01-84 http://dx.doi.org/10.96/jiem.1 Scheduling of a computer integrated manufacturing system: A simulation study Nadia Bhuiyan 1, Gerard Gouw 1,
More informationChapter 5 Supporting Facility and Process Flows
Chapter 5 Supporting Facility and Process Flows Process View of a Hospital Process Performance Inventory Turns Process Flow Structures 1 Definition of a Business Process A process is a set of activities
More informationChapter 13 Waiting Lines and Queuing Theory Models - Dr. Samir Safi
Chapter 13 Waiting Lines and Queuing Theory Models - Dr. Samir Safi TRUE/FALSE. Write 'T' if the statement is true and 'F' if the statement is false. 1) A goal of many waiting line problems is to help
More informationA Linear Programming Based Method for Job Shop Scheduling
A Linear Programming Based Method for Job Shop Scheduling Kerem Bülbül Sabancı University, Manufacturing Systems and Industrial Engineering, Orhanlı-Tuzla, 34956 Istanbul, Turkey bulbul@sabanciuniv.edu
More informationAbstract Title: Planned Preemption for Flexible Resource Constrained Project Scheduling
Abstract number: 015-0551 Abstract Title: Planned Preemption for Flexible Resource Constrained Project Scheduling Karuna Jain and Kanchan Joshi Shailesh J. Mehta School of Management, Indian Institute
More informationOffline sorting buffers on Line
Offline sorting buffers on Line Rohit Khandekar 1 and Vinayaka Pandit 2 1 University of Waterloo, ON, Canada. email: rkhandekar@gmail.com 2 IBM India Research Lab, New Delhi. email: pvinayak@in.ibm.com
More informationSupply planning for two-level assembly systems with stochastic component delivery times: trade-off between holding cost and service level
Supply planning for two-level assembly systems with stochastic component delivery times: trade-off between holding cost and service level Faicel Hnaien, Xavier Delorme 2, and Alexandre Dolgui 2 LIMOS,
More informationReinforcement Learning
Reinforcement Learning LU 2 - Markov Decision Problems and Dynamic Programming Dr. Joschka Bödecker AG Maschinelles Lernen und Natürlichsprachliche Systeme Albert-Ludwigs-Universität Freiburg jboedeck@informatik.uni-freiburg.de
More informationA Study of Crossover Operators for Genetic Algorithm and Proposal of a New Crossover Operator to Solve Open Shop Scheduling Problem
American Journal of Industrial and Business Management, 2016, 6, 774-789 Published Online June 2016 in SciRes. http://www.scirp.org/journal/ajibm http://dx.doi.org/10.4236/ajibm.2016.66071 A Study of Crossover
More informationA Computer Application for Scheduling in MS Project
Comput. Sci. Appl. Volume 1, Number 5, 2014, pp. 309-318 Received: July 18, 2014; Published: November 25, 2014 Computer Science and Applications www.ethanpublishing.com Anabela Tereso, André Guedes and
More informationvii TABLE OF CONTENTS CHAPTER TITLE PAGE DECLARATION DEDICATION ACKNOWLEDGEMENT ABSTRACT ABSTRAK
vii TABLE OF CONTENTS CHAPTER TITLE PAGE DECLARATION DEDICATION ACKNOWLEDGEMENT ABSTRACT ABSTRAK TABLE OF CONTENTS LIST OF TABLES LIST OF FIGURES LIST OF ABBREVIATIONS LIST OF SYMBOLS LIST OF APPENDICES
More information14.1 Rent-or-buy problem
CS787: Advanced Algorithms Lecture 14: Online algorithms We now shift focus to a different kind of algorithmic problem where we need to perform some optimization without knowing the input in advance. Algorithms
More informationLecture 3. Linear Programming. 3B1B Optimization Michaelmas 2015 A. Zisserman. Extreme solutions. Simplex method. Interior point method
Lecture 3 3B1B Optimization Michaelmas 2015 A. Zisserman Linear Programming Extreme solutions Simplex method Interior point method Integer programming and relaxation The Optimization Tree Linear Programming
More informationResource grouping selection to minimize the maximum over capacity planning
2012 International Conference on Industrial and Intelligent Information (ICIII 2012) IPCSIT vol.31 (2012) (2012) IACSIT Press, Singapore Resource grouping selection to minimize the maximum over capacity
More informationLayout Design Post Woods Apartment Complex
Layout Design Some of these slides are courtesy of Professor Paul Griffin Post Woods partment Complex tlanta Zoo Lenox Mall, tlanta Hospital floor plan Guildcrest Homes Factory floor plan 6 Furniture parts
More informationLoad Balancing and Switch Scheduling
EE384Y Project Final Report Load Balancing and Switch Scheduling Xiangheng Liu Department of Electrical Engineering Stanford University, Stanford CA 94305 Email: liuxh@systems.stanford.edu Abstract Load
More informationScheduling Programming Activities and Johnson's Algorithm
Scheduling Programming Activities and Johnson's Algorithm Allan Glaser and Meenal Sinha Octagon Research Solutions, Inc. Abstract Scheduling is important. Much of our daily work requires us to juggle multiple
More information5.1 Bipartite Matching
CS787: Advanced Algorithms Lecture 5: Applications of Network Flow In the last lecture, we looked at the problem of finding the maximum flow in a graph, and how it can be efficiently solved using the Ford-Fulkerson
More informationPractical Guide to the Simplex Method of Linear Programming
Practical Guide to the Simplex Method of Linear Programming Marcel Oliver Revised: April, 0 The basic steps of the simplex algorithm Step : Write the linear programming problem in standard form Linear
More informationDuplicating and its Applications in Batch Scheduling
Duplicating and its Applications in Batch Scheduling Yuzhong Zhang 1 Chunsong Bai 1 Shouyang Wang 2 1 College of Operations Research and Management Sciences Qufu Normal University, Shandong 276826, China
More informationIntroducción a Calendarización en Sistemas Paralelas, Grids y Nubes
CICESE Research Center Ensenada, Baja California Mexico Introducción a Calendarización en Sistemas Paralelas, Grids y Nubes Dr. Andrei Tchernykh CICESE Centro de Investigación Científica y de Educación
More informationLecture 2: August 29. Linear Programming (part I)
10-725: Convex Optimization Fall 2013 Lecture 2: August 29 Lecturer: Barnabás Póczos Scribes: Samrachana Adhikari, Mattia Ciollaro, Fabrizio Lecci Note: LaTeX template courtesy of UC Berkeley EECS dept.
More informationEquilibrium computation: Part 1
Equilibrium computation: Part 1 Nicola Gatti 1 Troels Bjerre Sorensen 2 1 Politecnico di Milano, Italy 2 Duke University, USA Nicola Gatti and Troels Bjerre Sørensen ( Politecnico di Milano, Italy, Equilibrium
More informationAn ant colony optimization for single-machine weighted tardiness scheduling with sequence-dependent setups
Proceedings of the 6th WSEAS International Conference on Simulation, Modelling and Optimization, Lisbon, Portugal, September 22-24, 2006 19 An ant colony optimization for single-machine weighted tardiness
More informationA SINGLE MACHINE SEQUENCING PROBLEM WITH MULTIPLE CRITERIA. by AVINASH G. TILAK, B. Tech. A THESIS IN INDUSTRIAL ENGINEERING
A SINGLE MACHINE SEQUENCING PROBLEM WITH MULTIPLE CRITERIA by AVINASH G. TILAK, B. Tech. A THESIS IN INDUSTRIAL ENGINEERING Submitted to the Graduate Faculty of Texas Tech University in Partial Fulfillment
More informationSolutions to Homework 6
Solutions to Homework 6 Debasish Das EECS Department, Northwestern University ddas@northwestern.edu 1 Problem 5.24 We want to find light spanning trees with certain special properties. Given is one example
More informationSimulation of processes in a mining enterprise with Tecnomatix Plant Simulation
Simulation of processes in a mining enterprise with Tecnomatix Plant Simulation Vladimir Medvedev Simulation of ore extraction on the open mountain works Page 2 Simulation objective To verify current control
More informationUniversity Dortmund. Robotics Research Institute Information Technology. Job Scheduling. Uwe Schwiegelshohn. EPIT 2007, June 5 Ordonnancement
University Dortmund Robotics Research Institute Information Technology Job Scheduling Uwe Schwiegelshohn EPIT 2007, June 5 Ordonnancement ontent of the Lecture What is ob scheduling? Single machine problems
More informationNetwork analysis: P.E.R.T,C.P.M & Resource Allocation Some important definition:
Network analysis: P.E.R.T,C.P.M & Resource Allocation Some important definition: 1. Activity : It is a particular work of a project which consumes some resources (in ) & time. It is shown as & represented
More information