Static workforce scheduling problem Paper production company

Slides:



Advertisements
Similar presentations
Chapter 7 Linear Programming I. Simplex Method Ding-Zhu Du.
Advertisements

1 Material to Cover  relationship between different types of models  incorrect to round real to integer variables  logical relationship: site selection.
Chapter 19 – Linear Programming
Chapter 3 Workforce scheduling.
OPSM 301 Operations Management
Operation Research By Anitha Chandran Chitra.R Radha.R Sudhit Sethi.
Linear Programming.
Linear Programming Problem
Session II – Introduction to Linear Programming
Standard  MM3A6. Students will solve linear programming problems in two variables.  a. Solve systems of inequalities in two variables, showing the solutions.
IES 371 Engineering Management Chapter 14: Aggregate Planning
Operations Management Linear Programming Module B - Part 2
LINEAR PROGRAMMING (LP)
8/27: Linear Programming Lecture: LP Small Groups Homework.
Aggregate Planning Ash Soni ODT Department Kelley School of Business.
Linear Programming 1.6 (M3) p. 30 Test Friday !!.
19 Linear Programming CHAPTER
Linear Programming Example 5 Transportation Problem.
Assigning (m) Workers to (N) machines under Noise Constraint SE 303 Lab.
1 2TN – Linear Programming  Linear Programming. 2 Linear Programming Discussion  Requirements of a Linear Programming Problem  Formulate:  Determine:Graphical.
SE 303 Lab Paper production company. Paper Products Three basic products: pads of paper, 5-packs of paper, and 20-packs of paper. The pad of paper consists.
Linear Programming Econ Outline  Review the basic concepts of Linear Programming  Illustrate some problems which can be solved by linear programming.
INTRODUCTION TO LINEAR PROGRAMMING
COB 291 An Introduction to Management Science Dr. Mike Busing College of Business, James Madison University.
Linear Programming Operations Research – Engineering and Math Management Sciences – Business Goals for this section  Modeling situations in a linear environment.
1© 2003 by Prentice Hall, Inc. Upper Saddle River, NJ The Wyndor Glass Company Problem (Hillier and Liberman) The Wyndor Glass Company is planning.
Lectures Linear Programming. Preparation Linear Algebra.
Product Mix Problem Monet company makes four types of frames.
Optimization Models Mathematical optimization models usually contain an objective (what to do) constraints (the rules that must be followed). Also referred.
Product Mix & Master Production Scheduling
Example 15.1 Daily Scheduling of Postal Employees Workforce Scheduling Models.
Operations Management
1 DSCI 3023 Linear Programming Developed by Dantzig in the late 1940’s A mathematical method of allocating scarce resources to achieve a single objective.
1 1 Slide Linear Programming (LP) Problem n A mathematical programming problem is one that seeks to maximize an objective function subject to constraints.
Strategic Production Planning Now showing at your local university.
Chapter 6 Supplement Linear Programming.
BUSINESS MATHEMATICS & STATISTICS. LECTURE 45 Planning Production Levels: Linear Programming.
1/17: DSCB Getting Started, Linear Programming Administrative Issues –Syllabus –Calendar –Get usernames, addresses, majors Linear Programming.
Operational Research & ManagementOperations Scheduling Workforce Scheduling 1.Days-Off Scheduling 2.Shift Scheduling 3. Cyclic Staffing Problem (& extensions)
Workforce scheduling – Days off scheduling 1. n is the max weekend demand n = max(n 1,n 7 ) Surplus number of employees in day j is u j = W – n j for.
Examples discussed in class
EMGT 501 Fall 2005 Midterm Exam Due Day: Oct 17 (Noon)
1 1 Slide © 2001 South-Western College Publishing/Thomson Learning Anderson Sweeney Williams Anderson Sweeney Williams Slides Prepared by JOHN LOUCKS QUANTITATIVE.
Paying Bills Warm Up: What are some bills your parents pay monthly? What must a producer consider when setting a price for the product being sold?
Warmup 40% off Originally $56 How much is the sale price? ( percent decrease) What will the price be after 6% tax? (percent increase)
1 Linear Programming (LP) 線性規劃 - George Dantzig, 1947.
1 A Linear Programming model seeks to maximize or minimize a linear function, subject to a set of linear constraints. The linear model consists of the.
OPSM 301 Operations Management Class 13&14: Linear Programming using Excel Koç University Zeynep Aksin
LINEAR PROGRAMMING.
Kerimcan OzcanMNGT 379 Operations Research1 Linear Programming Chapter 2.
Introduction to Linear Programming and Formulation Meeting 2 Course: D Deterministic Optimization Year: 2009.
Linear Programming (LP) Problems MAX (or MIN): c 1 X 1 + c 2 X 2 + … + c n X n Subject to:a 11 X 1 + a 12 X 2 + … + a 1n X n
Day 2 (Elimination). Ax + By = C constant substitutionrepeating.
Linear Programming. George Dantzig 1947 NarendraKarmarkar Pioneers of LP.
1 Linear Programming Design of mathematical model.
1 Introduction To Linear Programming l Today many of the resources needed as inputs to operations are in limited supply. l Operations managers must understand.
An Introduction to Linear Programming
Linear Programming.
An Introduction to Linear Programming Pertemuan 4
OPSM301 Spring 2012 Class11: LP Model Examples
Problem 1 Demand Total There are 20 full time employees, each can produce 10.
Introduction to Linear Programs
Introduction To Linear Programming
Presentation by Team 2.
بسم الله الرحمن الرحيم الموضوع:الوضوء صفته وفرائضه وسننه
and Graphing Inequalities
Machine Learning Week 3.
Reducing Damaged and Returned Inventory at MDS Logistics
Linear Programming.
Presentation transcript:

Static workforce scheduling problem Paper production company SE 303 Lab Static workforce scheduling problem Paper production company

Static Workforce Scheduling Number of full time employees on different days of the week. Each employee must work five consecutive days and then receive two days off. The schedule must meet the requirements by minimizing the total number of full time employees.

Solution LP Formulation: Min. z = x1+ x2 + x3 + x4 + x5 + x6 + x7 subject to x1 + x4 + x5 + x6 + x7 ³ 17 x1+ x2 + x5 + x6 + x7 ³ 13 x1+ x2 + x3 + x6 + x7 ³ 15 x1+ x2 + x3 + x4 + x7 ³ 19 x1+ x2 + x3 + x4 + x5 ³ 14 x2 + x3 + x4 + x5 + x6 ³ 16 x3 + x4 + x5 + x6 + x7 ³ 11 x1, x2, x3, x4, x5, x6, x7 ³ 0

Paper Company Different paper products Production constraints Packaging Availability

Paper Products Three basic products: pads of paper, 5-packs of paper, and 20-packs of paper. The pad of paper consists of single pad of 25 sheets of lined paper. The 5-pack consists of 5 pads of paper, together with a small notebook. The 20-pack of paper consists of 20 pads of paper, together with a large notebook.

Production Constraints The small and large notebooks are not sold separately. Production of each pad of paper requires 1 minute of paper-machine time, 1 minute of supervisory time, and $0.10 in direct costs. Production of each small notebook takes 2 minutes of paper-machine time, 45 seconds of supervisory time, and $0.20 in direct cost. Production of each large notebook takes 3 minutes of paper machine time, 30 seconds of supervisory time and $0.30 in direct costs.

Packaging and Availability Constraints To package the 5-pack takes 1 minute of packager’s time and 1 minute of supervisory time. To package 20-pack takes 3 minutes of packager’s time and 2 minutes of supervisory time. The amount of available paper-machine time, supervisory time, and packager’s time are constants b1, b2, and b3, respectively.

Costs Any of the three products can be sold to retailers in any quantity at the prices $0.30, $1.60, and $7.00, respectively.

Solution