P C max. NP-complete from partition. Example j p j What is the makespan on 2 machines? 3 machines? 4 machines?

Size: px
Start display at page:

Download "P C max. NP-complete from partition. Example j p j What is the makespan on 2 machines? 3 machines? 4 machines?"

Transcription

1 Multiple Machines Model Multiple Available resources people time slots queues networks of computers Now concerned with both allocation to a machine and ordering on that machine.

2 P C max NP-complete from partition. Example j p j What is the makespan on 2 machines? 3 machines? 4 machines?

3 Approxmiation Algorithms Cannot come up with an optimal solution in polynomial time Will look at relative error : C max (our algorithm)/c max (OP T ) Challenges: Our algorithm s performance is different on different instances We can t compute C max (OP T )

4 Approxmiation Algorithms Cannot come up with an optimal solution in polynomial time Will look at relative error : C max (our algorithm)/c max (OP T ) Challenges: Our algorithm s performance is different on different instances We can t compute C max (OP T ) Solution: We will use a worst case measure on performance We will use a lower bound on C max (OP T )

5 Approximation Algorithms An algorithm A is a ρ approximation algorithm for a problem, if for all inputs. C max (A) C max (OP T ) ρ In addition, A must run in polynomial time. We can t compute C max (OP T ). Recipe: Instead, we compute a lower bound LB(OP T ), such that LB(OP T ) is easy to compute LB(OP T ) C max (OP T ). We then show that C max (A) ρlb(op T ). Combining the previous two steps, we have: which can be rewritten as C max (A) ρlb(op T ) ρc max (OP T ) C max (A) C max (OP T ) ρ

6 . Notes: Must come up with a good lower bound Can replace C max with any objective.

7 Lower Bounds for P C max Average load Longest job

8 Lower Bounds for P C max Average load p j /m Longest job p max = max j {p j }

9 List Scheduling Algorithm A Greedy Algorithm 1. Make a list of the jobs (in any order) 2. When a machine becomes available, schedule the next job on the list.

10 List Scheduling Algorithm A Greedy Algorithm 1. Make a list of the jobs (in any order) 2. When a machine becomes available, schedule the next job on the list.

11 List Scheduling Algorithm A Greedy Algorithm 1. Make a list of the jobs (in any order) 2. When a machine becomes available, schedule the next job on the list. Analysis Let t be the last time at which all machines are busy. t j p j /m C max t + p max j p j /m + p max. Put this together with our lower bound: C max t + p max j p j /m + p max 2LB 2OP T

12 Improved Algorithm Schedule length is average load plus last job. When last job is small, the schedule is shorter. Force last job to be small LPT (Longest Processing Time). LPT is a 4/3-approximation for P C max. Proof Outline If last job is small ( 1/3OP T ) then 4/3-approximation Otherwise, there are at most 2 jobs per machine and LPT is optimal. Even better algorithms are possible:. A polynomial-time approximation scheme (PTAS) is an algorithm that, given fixed ɛ > 0, returns at (1 + ɛ) -approximation in polynomial time. The running time can have a bad dependence on ɛ, such as n O(1/ɛ). P C max has a PTAS.

13 Precedence Constraints P prec C max is known as project scheduling. P prec C max has a 2-approximation. What are good lower bounds for P prec C max?

14 Precedence Constraints P prec C max is known as project scheduling. P prec C max has a 2-approximation. What are good lower bounds for P prec C max? Average load p max any path in the precedence graph the critial path is the longest path in the precedence graph.

15 Unit Processing Times P p j = 1, prec C max is NP-hard. Heuristics Critical Path (CP) rule The job at the head of the longest string of jobs in the constraint graph has the highest priority P p j = 1, tree C max is solved by CP. Largest Number of Successors First (LNS) The job with the largest total number of successors in the constraint graph has highest priority. For in-trees and chains, LNS is identical to CP LNS is also optimal for P p j = 1, outtree C max Generalization to arbitrary processing times is possible Fixed Number of Processors P 2 p j = 1, prec C max P 3 p j = 1, prec C max is solvable in polynomial time is a big open question.

16 Preemptions: P pmtn C max McNaughton s wrap-around rule is optimal. Example j p j A 7 B 10 C 1 D 4 E 9

17 LP for P pmtn C max Variables: x ij is the time that job j runs on machine i. C max is also a variable. Constraints Each job runs for p j units of time Each machine runs for at most C max time. C max is more than any processing time. min C max (1) s.t. (2) m i=1 x ij = p j j = 1... n (3) n j=1 x ij C max i = 1... m (4) m i=1 x ij C max j = 1... n (5) (6) Note that LP only assigns pieces of jobs to machines. Need to also assign jobs to times.

18 Machines with speeds Q pmtn C max Machines M 1,..., M m with speeds v 1,..., v m. Assume wlog that v 1 v 2 v m Assume wlog that p 1 p 2 p n If a job runs for one unit of time on machine M i, it uses up v i units of processing. If job j runs on machine M i, then it takes p j /v i time units to complete. Example j p j A 20 B 16 C 2 D 1 What are the lower bounds

19 Lower bounds for Q pmtn C max What is the analog of p max? What is the analog of average load? Are there others?

20 Lower bounds for Q pmtn C max What is the analog of p max? p 1 /v 1 What is the analog of average load? p j / v i Are there others? Yes General Lower Bound C max max p 1, p 1 + p 2,..., v 1 v 1 + v 2 m 1 j=1 p j m 1, i=1 v i n j=1 p j m i=1 v i

21 Lower Bound C max max p 1, p 1 + p 2,..., v 1 v 1 + v 2 m 1 j=1 p j m 1, i=1 v i n j=1 p j m i=1 v i What is the lower bound for our example? Can we achieve this lower bound?

22 LPRT-FM Longest Remaining Processing Time on Fastest Machines Example 1 j p j A 20 B 16 C 2 D 1 v = (4, 2, 1) Example 2 j p j A 20 B 16 C 2 D 1 Notes: LRPT-FM is optimal in continuous time LRPT-FM is near otimal in discrete time, for small time steps.

Algorithm Design. Scheduling Algorithms. Part 2. Parallel machines. Open-shop Scheduling. Job-shop Scheduling.

Algorithm Design. Scheduling Algorithms. Part 2. Parallel machines. Open-shop Scheduling. Job-shop Scheduling. Algorithm Design Scheduling Algorithms Part 2 Parallel machines. Open-shop Scheduling. Job-shop Scheduling. 1 Parallel Machines n jobs need to be scheduled on m machines, M 1,M 2,,M m. Each machine can

More information

Lecture 2: Scheduling on Parallel Machines

Lecture 2: Scheduling on Parallel Machines Lecture 2: Scheduling on Parallel Machines Loris Marchal October 17, 2012 Parallel environment alpha in Graham s notation): P parallel identical Q uniform machines: each machine has a given speed speed

More information

Partition is reducible to P2 C max. c. P2 Pj = 1, prec Cmax is solvable in polynomial time. P Pj = 1, prec Cmax is NP-hard

Partition is reducible to P2 C max. c. P2 Pj = 1, prec Cmax is solvable in polynomial time. P Pj = 1, prec Cmax is NP-hard I. Minimizing Cmax (Nonpreemptive) a. P2 C max is NP-hard. Partition is reducible to P2 C max b. P Pj = 1, intree Cmax P Pj = 1, outtree Cmax are both solvable in polynomial time. c. P2 Pj = 1, prec Cmax

More information

LPT rule: Whenever a machine becomes free for assignment, assign that job whose. processing time is the largest among those jobs not yet assigned.

LPT rule: Whenever a machine becomes free for assignment, assign that job whose. processing time is the largest among those jobs not yet assigned. LPT rule Whenever a machine becomes free for assignment, assign that job whose processing time is the largest among those jobs not yet assigned. Example m1 m2 m3 J3 Ji J1 J2 J3 J4 J5 J6 6 5 3 3 2 1 3 5

More information

APTAS for Bin Packing

APTAS for Bin Packing APTAS for Bin Packing Bin Packing has an asymptotic PTAS (APTAS) [de la Vega and Leuker, 1980] For every fixed ε > 0 algorithm outputs a solution of size (1+ε)OPT + 1 in time polynomial in n APTAS for

More information

MINIMIZING SCHEDULE LENGTH OR MAKESPAN CRITERIA FOR PARALLEL PROCESSOR SCHEDULING

MINIMIZING SCHEDULE LENGTH OR MAKESPAN CRITERIA FOR PARALLEL PROCESSOR SCHEDULING MINIMIZING SCHEDULE LENGTH OR MAKESPAN CRITERIA FOR PARALLEL PROCESSOR SCHEDULING By Ali Derbala University of Blida, Faculty of science Mathematics Department BP 270, Route de Soumaa, Blida, Algeria.

More information

CS521 CSE IITG 11/23/2012

CS521 CSE IITG 11/23/2012 Today Scheduling: lassification Ref: Scheduling lgorithm Peter rukerook Multiprocessor Scheduling : List PTS Ref job scheduling, by uwe schweigelshohn Tomorrow istributed Scheduling ilk Programming and

More information

Lecture 4 Scheduling 1

Lecture 4 Scheduling 1 Lecture 4 Scheduling 1 Single machine models: Number of Tardy Jobs -1- Problem 1 U j : Structure of an optimal schedule: set S 1 of jobs meeting their due dates set S 2 of jobs being late jobs of S 1 are

More information

Single Machine Models

Single Machine Models Outline DM87 SCHEDULING, TIMETABLING AND ROUTING Lecture 8 Single Machine Models 1. Dispatching Rules 2. Single Machine Models Marco Chiarandini DM87 Scheduling, Timetabling and Routing 2 Outline Dispatching

More information

Single Machine Problems Polynomial Cases

Single Machine Problems Polynomial Cases DM204, 2011 SCHEDULING, TIMETABLING AND ROUTING Lecture 2 Single Machine Problems Polynomial Cases Marco Chiarandini Department of Mathematics & Computer Science University of Southern Denmark Outline

More information

RCPSP Single Machine Problems

RCPSP Single Machine Problems DM204 Spring 2011 Scheduling, Timetabling and Routing Lecture 3 Single Machine Problems Marco Chiarandini Department of Mathematics & Computer Science University of Southern Denmark Outline 1. Resource

More information

Metode şi Algoritmi de Planificare (MAP) Curs 2 Introducere în problematica planificării

Metode şi Algoritmi de Planificare (MAP) Curs 2 Introducere în problematica planificării Metode şi Algoritmi de Planificare (MAP) 2009-2010 Curs 2 Introducere în problematica planificării 20.10.2009 Metode si Algoritmi de Planificare Curs 2 1 Introduction to scheduling Scheduling problem definition

More information

More Approximation Algorithms

More Approximation Algorithms CS 473: Algorithms, Spring 2018 More Approximation Algorithms Lecture 25 April 26, 2018 Most slides are courtesy Prof. Chekuri Ruta (UIUC) CS473 1 Spring 2018 1 / 28 Formal definition of approximation

More information

This means that we can assume each list ) is

This means that we can assume each list ) is This means that we can assume each list ) is of the form ),, ( )with < and Since the sizes of the items are integers, there are at most +1pairs in each list Furthermore, if we let = be the maximum possible

More information

1 Ordinary Load Balancing

1 Ordinary Load Balancing Comp 260: Advanced Algorithms Prof. Lenore Cowen Tufts University, Spring 208 Scribe: Emily Davis Lecture 8: Scheduling Ordinary Load Balancing Suppose we have a set of jobs each with their own finite

More information

Chapter 11. Approximation Algorithms. Slides by Kevin Wayne Pearson-Addison Wesley. All rights reserved.

Chapter 11. Approximation Algorithms. Slides by Kevin Wayne Pearson-Addison Wesley. All rights reserved. Chapter 11 Approximation Algorithms Slides by Kevin Wayne. Copyright @ 2005 Pearson-Addison Wesley. All rights reserved. 1 Approximation Algorithms Q. Suppose I need to solve an NP-hard problem. What should

More information

A Framework for Scheduling with Online Availability

A Framework for Scheduling with Online Availability A Framework for Scheduling with Online Availability Florian Diedrich, and Ulrich M. Schwarz Institut für Informatik, Christian-Albrechts-Universität zu Kiel, Olshausenstr. 40, 24098 Kiel, Germany {fdi,ums}@informatik.uni-kiel.de

More information

Scheduling Lecture 1: Scheduling on One Machine

Scheduling Lecture 1: Scheduling on One Machine Scheduling Lecture 1: Scheduling on One Machine Loris Marchal October 16, 2012 1 Generalities 1.1 Definition of scheduling allocation of limited resources to activities over time activities: tasks in computer

More information

Preemptive Scheduling of Independent Jobs on Identical Parallel Machines Subject to Migration Delays

Preemptive Scheduling of Independent Jobs on Identical Parallel Machines Subject to Migration Delays Preemptive Scheduling of Independent Jobs on Identical Parallel Machines Subject to Migration Delays Aleksei V. Fishkin 1, Klaus Jansen 2, Sergey V. Sevastyanov 3,andRené Sitters 1 1 Max-Planck-Institute

More information

CS 580: Algorithm Design and Analysis. Jeremiah Blocki Purdue University Spring 2018

CS 580: Algorithm Design and Analysis. Jeremiah Blocki Purdue University Spring 2018 CS 580: Algorithm Design and Analysis Jeremiah Blocki Purdue University Spring 2018 Chapter 9 PSPACE: A Class of Problems Beyond NP Slides by Kevin Wayne. Copyright @ 2005 Pearson-Addison Wesley. All rights

More information

Resource Management in Machine Scheduling Problems: A Survey

Resource Management in Machine Scheduling Problems: A Survey Decision Making in Manufacturing and Services Vol. 1 2007 No. 1 2 pp. 59 89 Resource Management in Machine Scheduling Problems: A Survey Adam Janiak,WładysławJaniak, Maciej Lichtenstein Abstract. The paper

More information

Algorithms Design & Analysis. Approximation Algorithm

Algorithms Design & Analysis. Approximation Algorithm Algorithms Design & Analysis Approximation Algorithm Recap External memory model Merge sort Distribution sort 2 Today s Topics Hard problem Approximation algorithms Metric traveling salesman problem A

More information

COSC 341: Lecture 25 Coping with NP-hardness (2)

COSC 341: Lecture 25 Coping with NP-hardness (2) 1 Introduction Figure 1: Famous cartoon by Garey and Johnson, 1979 We have seen the definition of a constant factor approximation algorithm. The following is something even better. 2 Approximation Schemes

More information

Recoverable Robustness in Scheduling Problems

Recoverable Robustness in Scheduling Problems Master Thesis Computing Science Recoverable Robustness in Scheduling Problems Author: J.M.J. Stoef (3470997) J.M.J.Stoef@uu.nl Supervisors: dr. J.A. Hoogeveen J.A.Hoogeveen@uu.nl dr. ir. J.M. van den Akker

More information

Chapter 11. Approximation Algorithms. Slides by Kevin Wayne Pearson-Addison Wesley. All rights reserved.

Chapter 11. Approximation Algorithms. Slides by Kevin Wayne Pearson-Addison Wesley. All rights reserved. Chapter 11 Approximation Algorithms Slides by Kevin Wayne. Copyright @ 2005 Pearson-Addison Wesley. All rights reserved. 1 P and NP P: The family of problems that can be solved quickly in polynomial time.

More information

Approximation Algorithms (Load Balancing)

Approximation Algorithms (Load Balancing) July 6, 204 Problem Definition : We are given a set of n jobs {J, J 2,..., J n }. Each job J i has a processing time t i 0. We are given m identical machines. Problem Definition : We are given a set of

More information

Algorithms. Outline! Approximation Algorithms. The class APX. The intelligence behind the hardware. ! Based on

Algorithms. Outline! Approximation Algorithms. The class APX. The intelligence behind the hardware. ! Based on 6117CIT - Adv Topics in Computing Sci at Nathan 1 Algorithms The intelligence behind the hardware Outline! Approximation Algorithms The class APX! Some complexity classes, like PTAS and FPTAS! Illustration

More information

Deterministic Models: Preliminaries

Deterministic Models: Preliminaries Chapter 2 Deterministic Models: Preliminaries 2.1 Framework and Notation......................... 13 2.2 Examples... 20 2.3 Classes of Schedules... 21 2.4 Complexity Hierarchy... 25 Over the last fifty

More information

Embedded Systems 15. REVIEW: Aperiodic scheduling. C i J i 0 a i s i f i d i

Embedded Systems 15. REVIEW: Aperiodic scheduling. C i J i 0 a i s i f i d i Embedded Systems 15-1 - REVIEW: Aperiodic scheduling C i J i 0 a i s i f i d i Given: A set of non-periodic tasks {J 1,, J n } with arrival times a i, deadlines d i, computation times C i precedence constraints

More information

Scheduling jobs on two uniform parallel machines to minimize the makespan

Scheduling jobs on two uniform parallel machines to minimize the makespan UNLV Theses, Dissertations, Professional Papers, and Capstones 5-1-2013 Scheduling jobs on two uniform parallel machines to minimize the makespan Sandhya Kodimala University of Nevada, Las Vegas, kodimalasandhya@gmail.com

More information

Scheduling on Unrelated Parallel Machines. Approximation Algorithms, V. V. Vazirani Book Chapter 17

Scheduling on Unrelated Parallel Machines. Approximation Algorithms, V. V. Vazirani Book Chapter 17 Scheduling on Unrelated Parallel Machines Approximation Algorithms, V. V. Vazirani Book Chapter 17 Nicolas Karakatsanis, 2008 Description of the problem Problem 17.1 (Scheduling on unrelated parallel machines)

More information

Contents college 5 and 6 Branch and Bound; Beam Search (Chapter , book)! general introduction

Contents college 5 and 6 Branch and Bound; Beam Search (Chapter , book)! general introduction Contents college 5 and 6 Branch and Bound; Beam Search (Chapter 3.4-3.5, book)! general introduction Job Shop Scheduling (Chapter 5.1-5.3, book) ffl branch and bound (5.2) ffl shifting bottleneck heuristic

More information

4 Sequencing problem with heads and tails

4 Sequencing problem with heads and tails 4 Sequencing problem with heads and tails In what follows, we take a step towards multiple stage problems Therefore, we consider a single stage where a scheduling sequence has to be determined but each

More information

Bin packing and scheduling

Bin packing and scheduling Sanders/van Stee: Approximations- und Online-Algorithmen 1 Bin packing and scheduling Overview Bin packing: problem definition Simple 2-approximation (Next Fit) Better than 3/2 is not possible Asymptotic

More information

Deterministic Scheduling. Dr inż. Krzysztof Giaro Gdańsk University of Technology

Deterministic Scheduling. Dr inż. Krzysztof Giaro Gdańsk University of Technology Deterministic Scheduling Dr inż. Krzysztof Giaro Gdańsk University of Technology Lecture Plan Introduction to deterministic scheduling Critical path metod Some discrete optimization problems Scheduling

More information

Approximation Schemes for Parallel Machine Scheduling Problems with Controllable Processing Times

Approximation Schemes for Parallel Machine Scheduling Problems with Controllable Processing Times Approximation Schemes for Parallel Machine Scheduling Problems with Controllable Processing Times Klaus Jansen 1 and Monaldo Mastrolilli 2 1 Institut für Informatik und Praktische Mathematik, Universität

More information

Scheduling Lecture 1: Scheduling on One Machine

Scheduling Lecture 1: Scheduling on One Machine Scheduling Lecture 1: Scheduling on One Machine Loris Marchal 1 Generalities 1.1 Definition of scheduling allocation of limited resources to activities over time activities: tasks in computer environment,

More information

List Scheduling and LPT Oliver Braun (09/05/2017)

List Scheduling and LPT Oliver Braun (09/05/2017) List Scheduling and LPT Oliver Braun (09/05/207) We investigate the classical scheduling proble P ax where a set of n independent jobs has to be processed on 2 parallel and identical processors (achines)

More information

Energy-efficient scheduling

Energy-efficient scheduling Energy-efficient scheduling Guillaume Aupy 1, Anne Benoit 1,2, Paul Renaud-Goud 1 and Yves Robert 1,2,3 1. Ecole Normale Supérieure de Lyon, France 2. Institut Universitaire de France 3. University of

More information

Computers and Intractability. The Bandersnatch problem. The Bandersnatch problem. The Bandersnatch problem. A Guide to the Theory of NP-Completeness

Computers and Intractability. The Bandersnatch problem. The Bandersnatch problem. The Bandersnatch problem. A Guide to the Theory of NP-Completeness Computers and Intractability A Guide to the Theory of NP-Completeness The Bible of complexity theory Background: Find a good method for determining whether or not any given set of specifications for a

More information

Computers and Intractability

Computers and Intractability Computers and Intractability A Guide to the Theory of NP-Completeness The Bible of complexity theory M. R. Garey and D. S. Johnson W. H. Freeman and Company, 1979 The Bandersnatch problem Background: Find

More information

Flow Shop and Job Shop Models

Flow Shop and Job Shop Models Outline DM87 SCHEDULING, TIMETABLING AND ROUTING Lecture 11 Flow Shop and Job Shop Models 1. Flow Shop 2. Job Shop Marco Chiarandini DM87 Scheduling, Timetabling and Routing 2 Outline Resume Permutation

More information

Multiprocessor Scheduling II: Global Scheduling. LS 12, TU Dortmund

Multiprocessor Scheduling II: Global Scheduling. LS 12, TU Dortmund Multiprocessor Scheduling II: Global Scheduling Prof. Dr. Jian-Jia Chen LS 12, TU Dortmund 28, June, 2016 Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 1 / 42 Global Scheduling We will only focus on identical

More information

Linear Programming. Scheduling problems

Linear Programming. Scheduling problems Linear Programming Scheduling problems Linear programming (LP) ( )., 1, for 0 min 1 1 1 1 1 11 1 1 n i x b x a x a b x a x a x c x c x z i m n mn m n n n n! = + + + + + + = Extreme points x ={x 1,,x n

More information

Divisible Load Scheduling

Divisible Load Scheduling Divisible Load Scheduling Henri Casanova 1,2 1 Associate Professor Department of Information and Computer Science University of Hawai i at Manoa, U.S.A. 2 Visiting Associate Professor National Institute

More information

STABILITY OF JOHNSON S SCHEDULE WITH LIMITED MACHINE AVAILABILITY

STABILITY OF JOHNSON S SCHEDULE WITH LIMITED MACHINE AVAILABILITY MOSIM 01 du 25 au 27 avril 2001 Troyes (France) STABILITY OF JOHNSON S SCHEDULE WITH LIMITED MACHINE AVAILABILITY Oliver BRAUN, Günter SCHMIDT Department of Information and Technology Management Saarland

More information

HYBRID FLOW-SHOP WITH ADJUSTMENT

HYBRID FLOW-SHOP WITH ADJUSTMENT K Y BERNETIKA VOLUM E 47 ( 2011), NUMBER 1, P AGES 50 59 HYBRID FLOW-SHOP WITH ADJUSTMENT Jan Pelikán The subject of this paper is a flow-shop based on a case study aimed at the optimisation of ordering

More information

Dependency Graph Approach for Multiprocessor Real-Time Synchronization. TU Dortmund, Germany

Dependency Graph Approach for Multiprocessor Real-Time Synchronization. TU Dortmund, Germany Dependency Graph Approach for Multiprocessor Real-Time Synchronization Jian-Jia Chen, Georg von der Bru ggen, Junjie Shi, and Niklas Ueter TU Dortmund, Germany 14,12,2018 at RTSS Jian-Jia Chen 1 / 21 Multiprocessor

More information

Introduction to Computer Science and Programming for Astronomers

Introduction to Computer Science and Programming for Astronomers Introduction to Computer Science and Programming for Astronomers Lecture 8. István Szapudi Institute for Astronomy University of Hawaii March 7, 2018 Outline Reminder 1 Reminder 2 3 4 Reminder We have

More information

Batch delivery scheduling with simple linear deterioration on a single machine 1

Batch delivery scheduling with simple linear deterioration on a single machine 1 Acta Technica 61, No. 4A/2016, 281 290 c 2017 Institute of Thermomechanics CAS, v.v.i. Batch delivery scheduling with simple linear deterioration on a single machine 1 Juan Zou 2,3 Abstract. Several single

More information

Shop problems in scheduling

Shop problems in scheduling UNLV Theses, Dissertations, Professional Papers, and Capstones 5-2011 Shop problems in scheduling James Andro-Vasko University of Nevada, Las Vegas Follow this and additional works at: https://digitalscholarship.unlv.edu/thesesdissertations

More information

Average-Case Performance Analysis of Online Non-clairvoyant Scheduling of Parallel Tasks with Precedence Constraints

Average-Case Performance Analysis of Online Non-clairvoyant Scheduling of Parallel Tasks with Precedence Constraints Average-Case Performance Analysis of Online Non-clairvoyant Scheduling of Parallel Tasks with Precedence Constraints Keqin Li Department of Computer Science State University of New York New Paltz, New

More information

Approximation Schemes for Job Shop Scheduling Problems with Controllable Processing Times

Approximation Schemes for Job Shop Scheduling Problems with Controllable Processing Times Approximation Schemes for Job Shop Scheduling Problems with Controllable Processing Times Klaus Jansen 1, Monaldo Mastrolilli 2, and Roberto Solis-Oba 3 1 Universität zu Kiel, Germany, kj@informatik.uni-kiel.de

More information

No-Idle, No-Wait: When Shop Scheduling Meets Dominoes, Eulerian and Hamiltonian Paths

No-Idle, No-Wait: When Shop Scheduling Meets Dominoes, Eulerian and Hamiltonian Paths No-Idle, No-Wait: When Shop Scheduling Meets Dominoes, Eulerian and Hamiltonian Paths J.C. Billaut 1, F.Della Croce 2, Fabio Salassa 2, V. T kindt 1 1. Université Francois-Rabelais, CNRS, Tours, France

More information

arxiv: v1 [cs.ds] 17 Feb 2016

arxiv: v1 [cs.ds] 17 Feb 2016 Scheduling MapReduce Jobs under Multi-Round Precedences D Fotakis 1, I Milis 2, O Papadigenopoulos 1, V Vassalos 2, and G Zois 2 arxiv:160205263v1 [csds] 17 Feb 2016 1 School of Electrical and Computer

More information

Approximation and Randomized Algorithms (ARA) Lecture 2, September 1, 2010

Approximation and Randomized Algorithms (ARA) Lecture 2, September 1, 2010 Approximation and Randomized Algorithms (ARA) Lecture 2, September 1, 2010 Last time Algorithm Revision Algorithms for the stable matching problem Five illustrative algorithm problems Computatibility Today

More information

Scheduling on Unrelated Machines under Tree-Like Precedence Constraints

Scheduling on Unrelated Machines under Tree-Like Precedence Constraints Scheduling on Unrelated Machines under Tree-Like Precedence Constraints V.S. Anil Kumar 1 Madhav V. Marathe 2 Srinivasan Parthasarathy 3 Aravind Srinivasan 4 Abstract We present polylogarithmic approximations

More information

Approximation Algorithms

Approximation Algorithms Approximation Algorithms What do you do when a problem is NP-complete? or, when the polynomial time solution is impractically slow? assume input is random, do expected performance. Eg, Hamiltonian path

More information

Scheduling to Minimize Total Weighted Completion Time via Time-Indexed Linear Programming Relaxations

Scheduling to Minimize Total Weighted Completion Time via Time-Indexed Linear Programming Relaxations 58th Annual IEEE Symposium on Foundations of Computer Science Scheduling to Minimize Total Weighted Completion Time via Time-Indexed Linear Programming Relaxations Shi Li Department of Computer Science

More information

Exploring the Potential of Instruction-Level Parallelism of Exposed Datapath Architectures with Buffered Processing Units

Exploring the Potential of Instruction-Level Parallelism of Exposed Datapath Architectures with Buffered Processing Units Exploring the Potential of Instruction-Level Parallelism of Exposed Datapath Architectures with Buffered Processing Units Anoop Bhagyanath and Klaus Schneider Embedded Systems Chair University of Kaiserslautern

More information

Real-Time Systems. Event-Driven Scheduling

Real-Time Systems. Event-Driven Scheduling Real-Time Systems Event-Driven Scheduling Marcus Völp, Hermann Härtig WS 2013/14 Outline mostly following Jane Liu, Real-Time Systems Principles Scheduling EDF and LST as dynamic scheduling methods Fixed

More information

Computational Complexity

Computational Complexity Computational Complexity Algorithm performance and difficulty of problems So far we have seen problems admitting fast algorithms flow problems, shortest path, spanning tree... and other problems for which

More information

A Dynamic Programming algorithm for minimizing total cost of duplication in scheduling an outtree with communication delays and duplication

A Dynamic Programming algorithm for minimizing total cost of duplication in scheduling an outtree with communication delays and duplication A Dynamic Programming algorithm for minimizing total cost of duplication in scheduling an outtree with communication delays and duplication Claire Hanen Laboratory LIP6 4, place Jussieu F-75 252 Paris

More information

CMSC 441: Algorithms. NP Completeness

CMSC 441: Algorithms. NP Completeness CMSC 441: Algorithms NP Completeness Intractable & Tractable Problems Intractable problems: As they grow large, we are unable to solve them in reasonable time What constitutes reasonable time? Standard

More information

A polynomial-time approximation scheme for the two-machine flow shop scheduling problem with an availability constraint

A polynomial-time approximation scheme for the two-machine flow shop scheduling problem with an availability constraint A polynomial-time approximation scheme for the two-machine flow shop scheduling problem with an availability constraint Joachim Breit Department of Information and Technology Management, Saarland University,

More information

5 Integer Linear Programming (ILP) E. Amaldi Foundations of Operations Research Politecnico di Milano 1

5 Integer Linear Programming (ILP) E. Amaldi Foundations of Operations Research Politecnico di Milano 1 5 Integer Linear Programming (ILP) E. Amaldi Foundations of Operations Research Politecnico di Milano 1 Definition: An Integer Linear Programming problem is an optimization problem of the form (ILP) min

More information

Minimizing Mean Flowtime and Makespan on Master-Slave Systems

Minimizing Mean Flowtime and Makespan on Master-Slave Systems Minimizing Mean Flowtime and Makespan on Master-Slave Systems Joseph Y-T. Leung,1 and Hairong Zhao 2 Department of Computer Science New Jersey Institute of Technology Newark, NJ 07102, USA Abstract The

More information

arxiv: v1 [cs.cc] 28 Apr 2015

arxiv: v1 [cs.cc] 28 Apr 2015 Transforming NP to P: An Approach to Solve NP Complete Problems Wenhong Tian a,b,c, GuoZhong Li a, Xinyang Wang a, Qin Xiong a, YaQiu Jiang a a School of Information and Software Engineering, University

More information

On the Complexity of Mapping Pipelined Filtering Services on Heterogeneous Platforms

On the Complexity of Mapping Pipelined Filtering Services on Heterogeneous Platforms On the Complexity of Mapping Pipelined Filtering Services on Heterogeneous Platforms Anne Benoit, Fanny Dufossé and Yves Robert LIP, École Normale Supérieure de Lyon, France {Anne.Benoit Fanny.Dufosse

More information

Preemptive Online Scheduling: Optimal Algorithms for All Speeds

Preemptive Online Scheduling: Optimal Algorithms for All Speeds Preemptive Online Scheduling: Optimal Algorithms for All Speeds Tomáš Ebenlendr Wojciech Jawor Jiří Sgall Abstract Our main result is an optimal online algorithm for preemptive scheduling on uniformly

More information

Real-Time k-bounded Preemptive Scheduling

Real-Time k-bounded Preemptive Scheduling Real-Time k-bounded Preemptive Scheduling Sivan Albagli-Kim Baruch Schieber Hadas Shachnai Tami Tamir Abstract We consider a variant of the classic real-time scheduling problem, which has natural applications

More information

Multiprocessor Scheduling I: Partitioned Scheduling. LS 12, TU Dortmund

Multiprocessor Scheduling I: Partitioned Scheduling. LS 12, TU Dortmund Multiprocessor Scheduling I: Partitioned Scheduling Prof. Dr. Jian-Jia Chen LS 12, TU Dortmund 22/23, June, 2015 Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 1 / 47 Outline Introduction to Multiprocessor

More information

Online algorithms for parallel job scheduling and strip packing Hurink, J.L.; Paulus, J.J.

Online algorithms for parallel job scheduling and strip packing Hurink, J.L.; Paulus, J.J. Online algorithms for parallel job scheduling and strip packing Hurink, J.L.; Paulus, J.J. Published: 01/01/007 Document Version Publisher s PDF, also known as Version of Record (includes final page, issue

More information

Technische Universität Berlin

Technische Universität Berlin Technische Universität Berlin berlin FACHBEREICH 3 MATHEMATIK Approximation Algorithms for Scheduling Series-Parallel Orders Subject to Unit Time Communication Delays by Rolf H. Mohring and Markus W. Schaffter

More information

Online Appendix for Coordination of Outsourced Operations at a Third-Party Facility Subject to Booking, Overtime, and Tardiness Costs

Online Appendix for Coordination of Outsourced Operations at a Third-Party Facility Subject to Booking, Overtime, and Tardiness Costs Submitted to Operations Research manuscript OPRE-2009-04-180 Online Appendix for Coordination of Outsourced Operations at a Third-Party Facility Subject to Booking, Overtime, and Tardiness Costs Xiaoqiang

More information

The Constrained Minimum Weighted Sum of Job Completion Times Problem 1

The Constrained Minimum Weighted Sum of Job Completion Times Problem 1 The Constrained Minimum Weighted Sum of Job Completion Times Problem 1 Asaf Levin 2 and Gerhard J. Woeginger 34 Abstract We consider the problem of minimizing the weighted sum of job completion times on

More information

Single Machine Scheduling with Generalized Total Tardiness Objective Function

Single Machine Scheduling with Generalized Total Tardiness Objective Function Single Machine Scheduling with Generalized Total Tardiness Objective Function Evgeny R. Gafarov a, Alexander A. Lazarev b Institute of Control Sciences of the Russian Academy of Sciences, Profsoyuznaya

More information

Scheduling preemptable tasks on parallel processors with limited availability

Scheduling preemptable tasks on parallel processors with limited availability Parallel Computing 26 (2000) 1195±1211 www.elsevier.com/locate/parco Scheduling preemptable tasks on parallel processors with limited availability Jacek Bøa_zewicz a, Maciej Drozdowski a, Piotr Formanowicz

More information

Planning and Scheduling of batch processes. Prof. Cesar de Prada ISA-UVA

Planning and Scheduling of batch processes. Prof. Cesar de Prada ISA-UVA Planning and Scheduling of batch processes Prof. Cesar de Prada ISA-UVA prada@autom.uva.es Outline Batch processes and batch plants Basic concepts of scheduling How to formulate scheduling problems Solution

More information

UNRESTRICTED scheduling on parallel processors

UNRESTRICTED scheduling on parallel processors Proceedings of the Federated Conference on Computer Science and Information Systems pp. 231 238 ISBN 978-83-60810-22-4 Task Scheduling with Restricted Preemptions Tomasz Barański Email: tbaransk@poczta.onet.pl

More information

CS 561, Lecture: Greedy Algorithms. Jared Saia University of New Mexico

CS 561, Lecture: Greedy Algorithms. Jared Saia University of New Mexico CS 561, Lecture: Greedy Algorithms Jared Saia University of New Mexico Outline Greedy Algorithm Intro Activity Selection Knapsack 1 Greedy Algorithms Greed is Good - Michael Douglas in Wall Street A greedy

More information

Approximation Algorithms for scheduling

Approximation Algorithms for scheduling Approximation Algorithms for scheduling Ahmed Abu Safia I.D.:119936343, McGill University, 2004 (COMP 760) Approximation Algorithms for scheduling Leslie A. Hall The first Chapter of the book entitled

More information

Embedded Systems 14. Overview of embedded systems design

Embedded Systems 14. Overview of embedded systems design Embedded Systems 14-1 - Overview of embedded systems design - 2-1 Point of departure: Scheduling general IT systems In general IT systems, not much is known about the computational processes a priori The

More information

Today s Outline. CS 561, Lecture 15. Greedy Algorithms. Activity Selection. Greedy Algorithm Intro Activity Selection Knapsack

Today s Outline. CS 561, Lecture 15. Greedy Algorithms. Activity Selection. Greedy Algorithm Intro Activity Selection Knapsack Today s Outline CS 561, Lecture 15 Jared Saia University of New Mexico Greedy Algorithm Intro Activity Selection Knapsack 1 Greedy Algorithms Activity Selection Greed is Good - Michael Douglas in Wall

More information

NP-Completeness. NP-Completeness 1

NP-Completeness. NP-Completeness 1 NP-Completeness Reference: Computers and Intractability: A Guide to the Theory of NP-Completeness by Garey and Johnson, W.H. Freeman and Company, 1979. NP-Completeness 1 General Problems, Input Size and

More information

Non-Preemptive and Limited Preemptive Scheduling. LS 12, TU Dortmund

Non-Preemptive and Limited Preemptive Scheduling. LS 12, TU Dortmund Non-Preemptive and Limited Preemptive Scheduling LS 12, TU Dortmund 09 May 2017 (LS 12, TU Dortmund) 1 / 31 Outline Non-Preemptive Scheduling A General View Exact Schedulability Test Pessimistic Schedulability

More information

arxiv: v2 [cs.dm] 2 Mar 2017

arxiv: v2 [cs.dm] 2 Mar 2017 Shared multi-processor scheduling arxiv:607.060v [cs.dm] Mar 07 Dariusz Dereniowski Faculty of Electronics, Telecommunications and Informatics, Gdańsk University of Technology, Gdańsk, Poland Abstract

More information

Online Scheduling of Parallel Jobs on Two Machines is 2-Competitive

Online Scheduling of Parallel Jobs on Two Machines is 2-Competitive Online Scheduling of Parallel Jobs on Two Machines is 2-Competitive J.L. Hurink and J.J. Paulus University of Twente, P.O. box 217, 7500AE Enschede, The Netherlands Abstract We consider online scheduling

More information

3. Scheduling issues. Common approaches 3. Common approaches 1. Preemption vs. non preemption. Common approaches 2. Further definitions

3. Scheduling issues. Common approaches 3. Common approaches 1. Preemption vs. non preemption. Common approaches 2. Further definitions Common approaches 3 3. Scheduling issues Priority-driven (event-driven) scheduling This class of algorithms is greedy They never leave available processing resources unutilized An available resource may

More information

On Machine Dependency in Shop Scheduling

On Machine Dependency in Shop Scheduling On Machine Dependency in Shop Scheduling Evgeny Shchepin Nodari Vakhania Abstract One of the main restrictions in scheduling problems are the machine (resource) restrictions: each machine can perform at

More information

A lower bound on deterministic online algorithms for scheduling on related machines without preemption

A lower bound on deterministic online algorithms for scheduling on related machines without preemption Theory of Computing Systems manuscript No. (will be inserted by the editor) A lower bound on deterministic online algorithms for scheduling on related machines without preemption Tomáš Ebenlendr Jiří Sgall

More information

Logic-based Benders Decomposition

Logic-based Benders Decomposition Logic-based Benders Decomposition A short Introduction Martin Riedler AC Retreat Contents 1 Introduction 2 Motivation 3 Further Notes MR Logic-based Benders Decomposition June 29 July 1 2 / 15 Basic idea

More information

The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders

The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders MATHEMATICS OF OPERATIONS RESEARCH Vol. 37, No. 2, May 2012, pp. 379 398 ISSN 0364-765X (print) ISSN 1526-5471 (online) http://dx.doi.org/10.1287/moor.1110.0520 2012 INFORMS The Power of Preemption on

More information

CSE 4502/5717 Big Data Analytics Spring 2018; Homework 1 Solutions

CSE 4502/5717 Big Data Analytics Spring 2018; Homework 1 Solutions CSE 502/5717 Big Data Analytics Spring 2018; Homework 1 Solutions 1. Consider the following algorithm: for i := 1 to α n log e n do Pick a random j [1, n]; If a[j] = a[j + 1] or a[j] = a[j 1] then output:

More information

NP-Complete Problems and Approximation Algorithms

NP-Complete Problems and Approximation Algorithms NP-Complete Problems and Approximation Algorithms Efficiency of Algorithms Algorithms that have time efficiency of O(n k ), that is polynomial of the input size, are considered to be tractable or easy

More information

Selfish Multi-User Task Scheduling

Selfish Multi-User Task Scheduling Selfish Multi-User Task Scheduling Thomas E. Carroll and Daniel Grosu Dept. of Computer Science Wayne State University 5143 Cass Avenue Detroit, Michigan 48202 USA Email: {tec, dgrosu}@cs.wayne.edu Abstract

More information

Minimizing the Number of Tardy Jobs

Minimizing the Number of Tardy Jobs Minimizing the Number of Tardy Jobs 1 U j Example j p j d j 1 10 10 2 2 11 3 7 13 4 4 15 5 8 20 Ideas: Need to choose a subset of jobs S that meet their deadlines. Schedule the jobs that meet their deadlines

More information

FH2(P 2,P2) hybrid flow shop scheduling with recirculation of jobs

FH2(P 2,P2) hybrid flow shop scheduling with recirculation of jobs FH2(P 2,P2) hybrid flow shop scheduling with recirculation of jobs Nadjat Meziani 1 and Mourad Boudhar 2 1 University of Abderrahmane Mira Bejaia, Algeria 2 USTHB University Algiers, Algeria ro nadjet07@yahoo.fr

More information

CS 6901 (Applied Algorithms) Lecture 3

CS 6901 (Applied Algorithms) Lecture 3 CS 6901 (Applied Algorithms) Lecture 3 Antonina Kolokolova September 16, 2014 1 Representative problems: brief overview In this lecture we will look at several problems which, although look somewhat similar

More information

Minimizing the weighted completion time on a single machine with periodic maintenance

Minimizing the weighted completion time on a single machine with periodic maintenance Minimizing the weighted completion time on a single machine with periodic maintenance KRIM Hanane University of Valenciennes and Hainaut-Cambrésis LAMIH UMR CNRS 8201 1st year Phd Student February 12,

More information