© J. Christopher Beck 20051 Lecture 18: Timetabling with Workforce Capacity.

Slides:

Advertisements

Similar presentations

Tight Bounds for Online Class- constrained Packing Hadas Shachnai Bell Labs and The Technion IIT Tami Tamir The Technion IIT.

Advertisements

Math for Liberal Studies. There is a list of numbers called weights These numbers represent objects that need to be packed into bins with a particular.

1 Chapter 8 Approximation Algorithms (Part II). 2 Outline Scheduling Independent tasks Bin packing.

Algorithm Design Methods (I) Fall 2003 CSE, POSTECH.

Algorithm Design Methods Spring 2007 CSE, POSTECH.

Bin Packing First fit decreasing algorithm

Outline LP formulation of minimal cost flow problem

Ali Husseinzadeh Kashan Spring 2010

Lecture 6: Job Shop Scheduling Introduction

© J. Christopher Beck Lecture 7: Shifting Bottleneck.

© J. Christopher Beck Lecture 17: Tabu Search.

Chapter 3: Planning and Scheduling Lesson Plan

Biologically Inspired Computation Really finishing off EC.

The Greedy Method1. 2 Outline and Reading The Greedy Method Technique (§5.1) Fractional Knapsack Problem (§5.1.1) Task Scheduling (§5.1.2) Minimum Spanning.

Multi-Objective Optimization NP-Hard Conflicting objectives – Flow shop with both minimum makespan and tardiness objective – TSP problem with minimum distance,

Reservation Systems TimeTabling

Lecture 10: Integer Programming & Branch-and-Bound

Lateness Models Contents

1 IOE/MFG 543 Chapter 5: Parallel machine models (Sections )

© J. Christopher Beck Lecture 24: Workforce Scheduling 2.

1 Class Constrained Packing We need to pack items into bins. All the bins have the same capacity. Each bin can accommodate items from a bounded number.

8-1 Problem-Solving Examples (Preemptive Case). 8-2 Outline Preemptive job-shop scheduling problem (P-JSSP) –Problem definition –Basic search procedure.

© J. Christopher Beck Lecture 11: Constraint Programming 1.

D1: Bin Packing Algorithms. D1: Bin-Packing Algorithms Bin-packing algorithms can be used to find ways to complete a number of tasks in given time slots,

© J. Christopher Beck Lecture 19: Timetabling with Operator Constraints.

Lecture 8: Dispatch Rules

© J. Christopher Beck Lecture 30: Distributed Scheduling.

© J. Christopher Beck Lecture 18: Service Scheduling & Timetabling.

Approximation schemes Bin packing problem. Bin Packing problem Given n items with sizes a 1,…,a n  (0,1]. Find a packing in unit-sized bins that minimizes.

Spring 2015 Mathematics in Management Science Bin Packing The Problem The Algorithms.

© J. Christopher Beck Lecture 5: Project Planning 2.

Types of IP Models All-integer linear programs Mixed integer linear programs (MILP) Binary integer linear programs, mixed or all integer: some or all of.

Planning and Scheduling Chapter 3 Jennifer Holland February 2, 2010.

© J. Christopher Beck Lecture 16: Introduction to Service Scheduling.

For Wednesday No reading No homework There will be homework for Friday, as well the program being due – plan ahead.

© J. Christopher Beck Lecture 24: Workforce Scheduling.

© J. Christopher Beck Lecture 6: Time/Cost Trade-off in Project Planning.

Solving the Maximum Cardinality Bin Packing Problem with a Weight Annealing-Based Algorithm Kok-Hua Loh University of Maryland Bruce Golden University.

© J. Christopher Beck Lecture 17: Introduction to Timetabling.

Lecture 9: Simplified Shifting Bottleneck

Outline Introduction Minimizing the makespan Minimizing total flowtime

© J. Christopher Beck Lecture 25: Workforce Scheduling 3.

Asanka Herath Buddhika Kottahachchi

1 Approximation Algorithm Updated at 2011/01/03. 2 Approximation Algorithm Up to now, the best algorithm for solving an NP-complete problem requires exponential.

© J. Christopher Beck Lecture 10: (Full) Shifting Bottleneck.

Parallel Machine Scheduling

Instructor Neelima Gupta Table of Contents Factor 2 algorithm for Bin Packing Factor 2 algorithm for Minimum Makespan Scheduling Reference:

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

The bin packing problem. For n objects with sizes s 1, …, s n where 0 < s i ≤1, find the smallest number of bins with capacity one, such that n objects.

Biologically Inspired Computing: Indirect Encodings, and Hyperheuristics This is DWC’s lecture 7 for `Biologically Inspired Computing’ Contents: direct.

Bin Packing. 2 Background: Suppose you plan to build a wall system for your books, records, and stereo set in your dorm room. The wall system requires.

Bin Packing First fit decreasing algorithm

Bin Packing First fit algorithm

Chart Packing Heuristic

Lecture 8: Dispatch Rules

Lecture 11: Tree Search © J. Christopher Beck 2008.

Exam 2 LZW not on syllabus. 73% / 75%.

Lecture 23: Workforce Scheduling 1

Bin Packing First fit decreasing algorithm

Bin packing – First fit algorithm

Polynomial time approximation scheme

Bin Packing First fit decreasing algorithm

Bin Packing First fit decreasing algorithm

Algorithm Design Methods

ICS 353: Design and Analysis of Algorithms

Bin Packing First fit algorithm

Chapter 3: Planning and Scheduling Lesson Plan

Bin Packing Michael T. Goodrich Some slides adapted from slides from

We have the following incomplete B&B tree:

Approximation Algorithm

Presentation transcript:

© J. Christopher Beck Lecture 18: Timetabling with Workforce Capacity

© J. Christopher Beck Outline Adding Workforce Capacity to Timetabling Examples 9.4.1, Bin Packing Example 9.4.3, 9.4.4

© J. Christopher Beck Workforce Capacity n activities Processing time of activity j is p j No pre-emption An infinite number of resources Each activity requires W j workers You only have W workers Find a schedule that minimizes makespan

© J. Christopher Beck Example W = 10 Find a lower bound on the makespan Find minimum makespan schedule activities pjpj WjWj

© J. Christopher Beck Special Case: Exam Scheduling (Example 9.4.2) All exams have the same duration One exam room with capacity W Course j has W j students All students in course j must write the exam at the same time Find a timetable for all n exams in the minimum amount of time

© J. Christopher Beck Special Case = Bin Packing … Each bin has capacity = W W1W1 W2W2 W3W3 W4W4 W5W5 W6W6 W7W7 W8W8 Pack the objects into the bins to minimize the number of that are used

© J. Christopher Beck Special Case = Bin Packing … Each bin has capacity = W W1W1 W2W2 W3W3 W4W4 W5W5 W6W6 W8W8 Pack the objects into the bins to minimize the number of that are used W7W7

© J. Christopher Beck Example Find a lower bound on the number of bins Find an upper bound on the number of bins Find a solution – is it optimal? activities1…67…1213…18 WjWj W = 2100

© J. Christopher Beck Bin Packing Heuristics First Fit (FF) Order items arbitrarily Put item into lowest number bin that it will fit into First Fit Descending (FFD) Order items in descending order Put item into lowest number bin that it will fit into

© J. Christopher Beck Example Find FF solution Find FFD solution Is either solution optimal? activities1…67…1213…18 WjWj W = 2100

© J. Christopher Beck Example Find LB & UB Find FF solution Find FFD solution Find optimal solution activities1…67…1213…1819…30 WjWj W = 1000