Scribd
Upload
10 views

Linear Programming Model Workforce

Linear programming

Uploaded by

alazerasegd
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
10 views

Linear Programming Model Workforce

Linear programming

Uploaded by

alazerasegd
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

Linear Programming Model for Workforce Scheduling

This document presents the linear programming formulation for determining the optimal
workforce schedule for a small business. The problem involves scheduling full-time and
part-time employees to meet daily labor requirements while minimizing costs.

Decision Variables
Let:
- x₁, x₂, x₃, x₄, x₅, x₆, x₇: The number of full-time employees starting work on Monday,
Tuesday, Wednesday, Thursday, Friday, Saturday, and Sunday, respectively.
- y: The number of part-time employees hired.

Objective Function
Minimize total labor cost:
Z = 5 × 8 × 15 × (x₁ + x₂ + x₃ + x₄ + x₅ + x₆ + x₇) + 5 × 4 × 10 × y

Constraints
1. Daily Labor Requirements:

- Monday: 8(x₁ + x₆ + x₇ + x₅ + x₄) + 4y ≥ 136


- Tuesday: 8(x₂ + x₇ + x₆ + x₅ + x₁) + 4y ≥ 104
- Wednesday: 8(x₃ + x₇ + x₆ + x₂ + x₁) + 4y ≥ 120
- Thursday: 8(x₄ + x₇ + x₃ + x₂ + x₁) + 4y ≥ 152
- Friday: 8(x₅ + x₄ + x₃ + x₂ + x₁) + 4y ≥ 112
- Saturday: 8(x₆ + x₅ + x₄ + x₃ + x₂) + 4y ≥ 128
- Sunday: 8(x₇ + x₆ + x₅ + x₄ + x₃) + 4y ≥ 88

2. Part-Time Labor Limit:

The total hours worked by part-time employees cannot exceed 25% of the weekly labor
requirements:
5 × 4 × y ≤ 0.25 × (8 × (17 + 13 + 15 + 19 + 14 + 16 + 11))

3. Non-Negativity:

x₁, x₂, x₃, x₄, x₅, x₆, x₇, y ≥ 0

You might also like