Homework_6_solutions

# Homework_6_solutions - Network Flow Programming Models 8...

This preview shows pages 1–3. Sign up to view the full content.

Network Flow Programming Models 8 Notes: Exercise 6b. Add – Do as many jobs as possible. 6. A company has three workers. On a particular day, six jobs are scheduled to be completed. The cost for each worker to do each job is shown in the matrix below. Using a network flow programming model to answer each part of the problem. Job 1 2 3 4 5 6 A 3 2 2 6 4 6 Worker B 4 3 7 5 3 3 C 9 9 7 9 7 6 a. What is the minimum cost assignment when each worker can do two jobs? b. What is the minimum cost assignment to do any three jobs when each worker can do only one job? c. What is the minimum cost assignment when each worker can do any number of jobs? a. [+1] [+1] [+1] [–1] [–1] [–1] A B C J1 J2 J3 (3) (2) (2) [External Flow] (Cost) The solution has: Assign A to jobs 2 and 3, B to jobs 1 and 5, and C to jobs 4 and 6. Cost 26. b. The solution has: Assign A to jobs 3, B to job 5, and C to job 6. Cost is 11.

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
Network Flow Programming Models 9 [+1] [+1] [+1] A B C J1 J2 J3 (3) (2) (2) [External Flow] (Cost) (1, 0) (1, 0) (1, 0) (upper, cost) c. [–1]
This is the end of the preview. Sign up to access the rest of the document.

## This note was uploaded on 02/08/2012 for the course IEOR 4004 taught by Professor Sethuraman during the Fall '10 term at Columbia.

### Page1 / 6

Homework_6_solutions - Network Flow Programming Models 8...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online