For the following problem, formulate the Linear program or LP as follows: 1) Define the decision variables and briefly explain the significance of each one or group of variables. 2) Describe each constraint and the objective function adequately in one or two sentences. 3) After developing your model, provide the entire Linear program (LP) on one page. 4) Provide the activity network diagram Be sure to include the non-negativity constraints as necessary.

Practical Management Science
6th Edition
ISBN:9781337406659
Author:WINSTON, Wayne L.
Publisher:WINSTON, Wayne L.
Chapter2: Introduction To Spreadsheet Modeling
Section: Chapter Questions
Problem 20P: Julie James is opening a lemonade stand. She believes the fixed cost per week of running the stand...
icon
Related questions
Question
You are the project manager for a construction project (maybe capstone design) and you must schedule the various jobs which
must be completed before the project is finished. Some of the jobs can begin immediately but other jobs can only begin after
others are completed. For example, grading can begin immediately but laying a foundation must be delayed until the grading
is completed. The data below are for a project which includes ten jobs; the time it takes to complete each job is known and the
set of jobs which must be completed before each job can begin is known. Your objective is to find a schedule (i.e. beginning
times and ending times) for all of the jobs such that no jobs begins before any of its predecessors are completed and the time
when all jobs are finished is minimized. Formulate a linear programming model to solve the problem.
For the following problem, formulate the Linear program or LP as follows:
1) Define the decision variables and briefly explain the significance of each one or group of variables.
2) Describe each constraint and the objective function adequately in one or two sentences.
3) After developing your model, provide the entire Linear program (LP) on one page.
4) Provide the activity network diagram
Be sure to include the non-negativity constraints as necessary.
Time to Complete Job
8 days
6 days
7 days
12 days
4 days
8 days
7 days
14 days
7 days
9 days
Job
Preceding Jobs
none O
1
1
none O
3
1,3
2,3
1,2, 5
4,5
5,6
1,4
4
6.
7.
8.
9.
10
Let Bi be the day on which activity 1 may start; for example B1 is the day job 1 may begin.
Let EF be the earliest time (days) when all jobs have been completed.
Transcribed Image Text:You are the project manager for a construction project (maybe capstone design) and you must schedule the various jobs which must be completed before the project is finished. Some of the jobs can begin immediately but other jobs can only begin after others are completed. For example, grading can begin immediately but laying a foundation must be delayed until the grading is completed. The data below are for a project which includes ten jobs; the time it takes to complete each job is known and the set of jobs which must be completed before each job can begin is known. Your objective is to find a schedule (i.e. beginning times and ending times) for all of the jobs such that no jobs begins before any of its predecessors are completed and the time when all jobs are finished is minimized. Formulate a linear programming model to solve the problem. For the following problem, formulate the Linear program or LP as follows: 1) Define the decision variables and briefly explain the significance of each one or group of variables. 2) Describe each constraint and the objective function adequately in one or two sentences. 3) After developing your model, provide the entire Linear program (LP) on one page. 4) Provide the activity network diagram Be sure to include the non-negativity constraints as necessary. Time to Complete Job 8 days 6 days 7 days 12 days 4 days 8 days 7 days 14 days 7 days 9 days Job Preceding Jobs none O 1 1 none O 3 1,3 2,3 1,2, 5 4,5 5,6 1,4 4 6. 7. 8. 9. 10 Let Bi be the day on which activity 1 may start; for example B1 is the day job 1 may begin. Let EF be the earliest time (days) when all jobs have been completed.
Expert Solution
steps

Step by step

Solved in 2 steps with 1 images

Blurred answer
Similar questions
Recommended textbooks for you
Practical Management Science
Practical Management Science
Operations Management
ISBN:
9781337406659
Author:
WINSTON, Wayne L.
Publisher:
Cengage,
Operations Management
Operations Management
Operations Management
ISBN:
9781259667473
Author:
William J Stevenson
Publisher:
McGraw-Hill Education
Operations and Supply Chain Management (Mcgraw-hi…
Operations and Supply Chain Management (Mcgraw-hi…
Operations Management
ISBN:
9781259666100
Author:
F. Robert Jacobs, Richard B Chase
Publisher:
McGraw-Hill Education
Business in Action
Business in Action
Operations Management
ISBN:
9780135198100
Author:
BOVEE
Publisher:
PEARSON CO
Purchasing and Supply Chain Management
Purchasing and Supply Chain Management
Operations Management
ISBN:
9781285869681
Author:
Robert M. Monczka, Robert B. Handfield, Larry C. Giunipero, James L. Patterson
Publisher:
Cengage Learning
Production and Operations Analysis, Seventh Editi…
Production and Operations Analysis, Seventh Editi…
Operations Management
ISBN:
9781478623069
Author:
Steven Nahmias, Tava Lennon Olsen
Publisher:
Waveland Press, Inc.