Flow Shop Scheduling.

Slides:



Advertisements
Similar presentations
Heuristic Functions By Peter Lane
Advertisements

Algorithm Design Methods (I) Fall 2003 CSE, POSTECH.
A Survey of Program Slicing Techniques A Survey of Program Slicing Techniques Sections 3.1,3.6 Swathy Shankar
Leena Suhl University of Paderborn, Germany
Simultaneous scheduling of machines and automated guided vehicles: graph modelling and resolution Philippe LACOMME, Mohand LARABI Nikolay TCHERNEV LIMOS.
Lecture 6: Job Shop Scheduling Introduction
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.
1 IOE/MFG 543 Chapter 8: Open shops Section 8.1 (you may skip Sections 8.2 – 8.5)
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.
ISE480 Sequencing and Scheduling Izmir University of Economics ISE Fall Semestre.
Genetic Algorithms Contents 1. Basic Concepts 2. Algorithm
Lecture 10: Integer Programming & Branch-and-Bound
CSC 423 ARTIFICIAL INTELLIGENCE
1 IOE/MFG 543 Chapter 3: Single machine models (Sections 3.1 and 3.2)
Branch and Bound Searching Strategies
Branch and Bound Similar to backtracking in generating a search tree and looking for one or more solutions Different in that the “objective” is constrained.
Dealing with NP-Complete Problems
21st European Conference on Operational Research Algorithms for flexible flow shop problems with unrelated parallel machines, setup times and dual criteria.
1 IOE/MFG 543 Chapter 14: General purpose procedures for scheduling in practice Sections : Dispatching rules and filtered beam search.
1 IOE/MFG 543 Chapter 6: Flow shops Sections 6.1 and 6.2 (skip section 6.3)
1 Set # 3 Dr. LEE Heung Wing Joseph Phone: Office : HJ639.
1 Set # 4 Dr. LEE Heung Wing Joseph Phone: Office : HJ639.
8-1 Problem-Solving Examples (Preemptive Case). 8-2 Outline Preemptive job-shop scheduling problem (P-JSSP) –Problem definition –Basic search procedure.
1 IOE/MFG 543 Chapter 7: Job shops Sections 7.1 and 7.2 (skip section 7.3)
Cardinality & Sorting Networks. Cardinality constraint Appears in many practical problems: scheduling, timetabling etc’. Also takes place in the Max-Sat.
Constraint Satisfaction Not all problems are solved by a sequential series of steps. How do we solve other types of problems?
Efficient Case Retrieval Sources: –Chapter 7 – –
LP formulation of Economic Dispatch
Elements of the Heuristic Approach
INTRODUCTION TO SCHEDULING
Operational Research & ManagementOperations Scheduling Flow Shop Scheduling 1.Flexible Flow Shop 2.Flexible Assembly Systems (unpaced) 3.Paced Assembly.
Job-shop Scheduling n jobs m machines No recirculation – Jobs do not revisit the same machine (i, j) is referred to as an operation in which job j is processed.
An algorithm for a Parallel Machine Problem with Eligibility and Release and Delivery times, considering setup times Manuel Mateo Management.
Introduction to Job Shop Scheduling Problem Qianjun Xu Oct. 30, 2001.
17 th International Teletraffic Congress Topological design of telecommunication networks Michał Pióro a,b, Alpar Jüttner c, Janos Harmatos c, Áron Szentesi.
1 1 Slide © 2000 South-Western College Publishing/ITP Slides Prepared by JOHN LOUCKS.
Line Balancing Problem
Exact methods for ALB ALB problem can be considered as a shortest path problem The complete graph need not be developed since one can stop as soon as in.
Production SchedulingP.C. Chang, IEM, YZU. 1 Modeling: Parameters Typical scheduling parameters: Number of resources (m machines, operators) Configuration.
1 Short Term Scheduling. 2  Planning horizon is short  Multiple unique jobs (tasks) with varying processing times and due dates  Multiple unique jobs.
1 Operation Scheduling- II The Multi-Machine Case Look! There are two machines.
Outline Introduction Minimizing the makespan Minimizing total flowtime
GAME PLAYING 1. There were two reasons that games appeared to be a good domain in which to explore machine intelligence: 1.They provide a structured task.
Scheduling. Scheduling: The allocation of resources over time to accomplish specific tasks. Demand scheduling: A type of scheduling whereby customers.
Dvir Shabtay Moshe Kaspi The Department of IE&M Ben-Gurion University of the Negev, Israel.
The least known length of ordered basis of symmetric group S. A. Kalinchuk, Yu. L. Sagalovich Institute for Information Transmission Problems, Russian.
Flows and Networks Plan for today (lecture 6): Last time / Questions? Kelly / Whittle network Optimal design of a Kelly / Whittle network: optimisation.
Parallel Machine Scheduling
Lagrangean Relaxation
Production SchedulingP.C. Chang, IEM, YZU. 1 Hybrid Algorithm for mean T Hybrid Algorithm : Dominance matrix to decompose problem in to sub-problems. Branch.
1 BECO 2004 When can one develop an FPTAS for a sequential decision problem? with apologies to Gerhard Woeginger James B. Orlin MIT working jointly with.
1 JOB SEQUENCING WITH DEADLINES The problem is stated as below. There are n jobs to be processed on a machine. Each job i has a deadline d i ≥ 0 and profit.
Production SchedulingP.C. Chang, IEM, YZU. 1 How to schedule ?? How to find 1. an efficient Heuristic? 2. the optimal solution?
Onlinedeeneislam.blogspot.com1 Design and Analysis of Algorithms Slide # 1 Download From
Huffman Coding (2 nd Method). Huffman coding (2 nd Method)  The Huffman code is a source code. Here word length of the code word approaches the fundamental.
Product A Product B Product C A1A1 A2A2 A3A3 B1B1 B2B2 B3B3 B4B4 C1C1 C3C3 C4C4 Turret lathes Vertical mills Center lathes Drills From “Fundamentals of.
DECISION MODELING WITH MICROSOFT EXCEL Chapter 12 Copyright 2001 Prentice Hall Publishers and Ardith E. Baker Multi-Objective Decision Making and Heuristics.
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 systems Scheduling of batch processing.
Lecture 11: Tree Search © J. Christopher Beck 2008.
Shop Scheduling Problem
(2,4) Trees 11/15/2018 9:25 AM Sorting Lower Bound Sorting Lower Bound.
Heuristics Definition – a heuristic is an inexact algorithm that is based on intuitive and plausible arguments which are “likely” to lead to reasonable.
Branch and Bound.
(2,4) Trees 12/4/2018 1:20 PM Sorting Lower Bound Sorting Lower Bound.
Flows and Networks Plan for today (lecture 6):
The use of Neural Networks to schedule flow-shop with dynamic job arrival ‘A Multi-Neural Network Learning for lot Sizing and Sequencing on a Flow-Shop’
Chapter 7: Job shops Sections 7.1 and 7.2 (skip section 7.3)
Topic 15 Job Shop Scheduling.
Flexible Assembly Systems
Presentation transcript:

Flow Shop Scheduling

Definitions Contains m different machines. Each job consists m operators in different machine. The flow of work is unidirectional. Machines in a flow shop = 1,2,…….,m The operations of job i , (i,1) (i,2) (i ,3)…..(i, m) Not processed by machine k , P( i , k) = 0

Flow Shop Scheduling Baker p.136 The processing sequence on each machine are all the same. 1 2 . M 2 3 1 5 4  Flow shop 2 3 1 5 4 1 3 2 4 5  Job shop n! - flow shop permutation schedule n!.n! …….n! - Job shop k : constraint (∵ routing problem) or

Workflow in a flow shop Baker p.137 Type 1. Type 2. Input output Input Machine 1 Machine 2 Machine 3 …. Machine M-1 Machine M output Type 2. Input Input Input Input Input Machine 1 Machine 2 Machine 3 …. Machine M-1 Machine M output output output output output

Johnson’s Rule Baker p.142 Note: Johnson’s rule can find an optimum with two machines Flow shop problem for makespan problem.

Ex. j 1 2 3 4 5 tj1 6 7 tj2 Stage U Min tjk Assignment Partial Schedule 1 1,2,3,4,5 t31 3=[1] 3 x x x x 2 1,2,4,5 t22 2=[5] 3 x x x 2 3 1,4,5 t11 1=[2] 3 1 x x 2 4 4,5 t52 5=[4] 3 1 x 5 2 5 4=[3] 3 1 4 5 2

Ex. M1 3 1 4 5 2 M2 3 1 4 5 2 24 The makespan is 24

The B&B for Makespan Problem The Ignall-Schrage Algorithm (Baker p.149) A lower bound on the makespan associated with any completion of the corresponding partial sequence σ is obtained by considering the work remaining on each machine. To illustrate the procedure for m=3. For a given partial sequence σ, let q1= the latest completion time on machine 1 among jobs in σ. q2= the latest completion time on machine 2 among jobs in σ. q3= the latest completion time on machine 3 among jobs in σ. The amount of processing yet required of machine 1 is

The Ignall-Schrage Algorithm In the most favorable situation, the last job Encounters no delay between the completion of one operation and the start of its direct successor, and Has the minimal sum (tj2+tj3) among jobs j belongs to σ’ Hence one lower bound on the makespan is A second lower bound on machine 2 is A lower bound on machine 3 is The lower bound proposed by Ignall and Schrage is

The Ignall-Schrage Algorithm Job in σ’ M1 …….. tk1 q1 M2 …….. tk2 q2 M3 …….. tk3 q3 b1 M2 …….. tk2 q2 M3 …….. tk3 q3 b2

Ex. B&B m=3 For the first node: σ =1 j 1 2 3 4 tj1 11 7 10 tj2 9 12 5 13

Ex. Partial Sequence ( q1 , q2 , q3 ) (b1,b2,b3) B 1xxx ( 3 , 7 , 17 ) ( 37 , 31 , 37 ) 37 2xxx ( 11 , 12 , 17 ) ( 45 , 39 , 42 ) 45 3xxx ( 7 , 16 , 29 ) ( 37 , 35 , 46 ) 46 4xxx ( 10 , 22 , 24 ) ( 37 , 41 , 52 ) 52 12xx ( 14 , 15 , 22 ) ( 45 , 38 , 37 ) 13xx ( 10 , 19 , 32 ) ( 37 , 34 , 39 ) 39 14xx ( 13 , 25 , 27 ) ( 37 , 40 , 45 ) 132x ( 21 , 22 , 37 ) ( 45 , 36 , 39 ) 134x ( 20 , 32 , 34 ) ( 37 , 38 , 39 ) 1 2 3 14 1 2 7 15 1 2 17 22

Ex. B&B P0 1xxx 2xxx 3xxx 4xxx 12xx 13xx 14xx 132x 134x B=37 B=45 B=46

Refined Bounds The use of q2 in the calculation of b2 ignores the possibility that the starting time of job j on the machine 2 may be constrained by commitments on machine1. Hence: Modification1: consider idle time

Refined Bounds Modification2: (McMahon and Burton) Previous : Machine-based bound Modification2 : Job-based bound

Refined Bounds Obviously, B’>=B, This means that the combination of machine-based and job-based bounds represented by B’ will lead to a more efficient search of the branching tree in the sense that fewer nodes will be created.

Consider the following four-job three-machine problem Hw. Consider the following four-job three-machine problem j 1 2 3 4 tj1 13 7 26 tj2 12 9 6 tj3 16 Find the min makespan using the basic Ignall-Schrage algorithm. Count the nodes generated by the branching process. Find the min makespan using the modified algorithm.

Heuristic Approaches Traditional B&B: The computational requirements will be severe for large problems Even for relatively small problems, there is no guarantee that the solution can be obtained quickly, Heuristic Approaches can obtain solutions to large problems with limited computational effort. Computational requirements are predictable for problem of a given size.

Palmer Palmer proposed the calculation of a slope index, sj, for each job. Then a permutation schedule is constructed using the job ordering

Gupta Gupta thought a transitive job ordering in the form of follows that would produce good schedules. Where Where

Gupta Generalizing from this structure, Gupta proposed that for m>3, the job index to be calculated is Where

CDS Its strength lies in two properties: It use Johnson’s rule in a heuristic fashion It generally creates several schedules from which a “best” schedule can be chosen. The CDS algorithm corresponds to a multistage use if Johnson’s rule applied to a new problem, derived from the original, with processing times and . At stage 1,

CDS In other words, Johnson’s rule is applied to the first and mth operations and intermediate operations are ignored. At stage 2, That is, Johnson’s rule is applied to the sums of the first two and last two operation processing times. In general at stage i,

Ex. j 1 2 3 4 5 tj1 6 9 tj2 8 tj3 Palmer: Gupta: CDS: 3-5-4-1-2 M=35

HW. Let Use Ignall-Schrage & McMahon-Burton to solve j 1 2 3 4 5 tj1 8 11 7 6 9 tj2 tj3 13 10 Let Use Ignall-Schrage & McMahon-Burton to solve Use Palmer, Gupta, CDS to solve this problem.