May 15th, 2015
Studypool Tutor
South University-Savannah
Price: $30 USD

Tutor description

Operations Management - Scheduling Task Predecessor Normal Time Crash Time Crash Cost Slope A None 3 3 NA B A 2 2 NA C A 6 2 $600 D A 5 5 NA E B 3 1 $600 F C 2 2 NA G D 7 3 $600 H F, G 4 4 NA I E 5 5 NA J H 4 4 NA K I, J 7 7 NA In a 3- to 4-page Microsoft Word document, address the following: • Draw the AON project network using Microsoft Project, Microsoft Visio, or some other tool capable of creating such a network. Perform a critical path analysis for the network and calculate the ES, EF, LS, and LF times. • Calculate the slack time for each activity. • Identify the critical path. • Assume that the organization will receive a $1000 bonus for each day the duration of the project is shortened. The organization is also responsible for paying the crash cost associated with shortening the schedule. To maximize the net profit, identify which task you should crash and by how much.

Word Count: 923
Showing Page: 1/7
SchedulingInsert your nameMGT3059Insert dateInsert your professor's nameSchedulingAny organization that wants to succeed in its production activities needs to create a blueprint for guidance. Establishing a schedule for a project entails orderliness and allotment of realistic time to which activity to complete before proceeding to the next activity in the project. Scheduling is a mechanism of communicating which work to perform, resources applicable to the work and the lapse of time the work needs to be accomplished (Heizer, Jay, & Barry, 2013, p. 63). Using the information for this assignment, this paper will illustrate scheduling for an organization (South University, 2015).Draw the Activity on Node (AON) Project Network AON is a visual illustration of how each activity in the tabular data are related by using arrows to connect them and a node (number) to symbolize each of the project network (Usmani, 2015, p. 1). Figure 1.1 shows the AON for a hypothetical organization - Top Notch Goods.Figure 1.1Node ActivitiesCritical Path AnalysisHeizer, Jay, & Barry (2013) stated, "the critical path is the longest time path through the network. To find the critical path, we calculate two distinct starting and ending times for each activity. These are defined as follows:Earliest start (ES) = earliest time at which an activity can start, assuming all predecessors have been completedEarliest finish (EF) = earliest time at which an activity can be fini

Review from student

Studypool Student
" all I can say is wow very fast work, great work thanks "
Ask your homework questions. Receive quality answers!

Type your question here (or upload an image)

1826 tutors are online

Brown University

1271 Tutors

California Institute of Technology

2131 Tutors

Carnegie Mellon University

982 Tutors

Columbia University

1256 Tutors

Dartmouth University

2113 Tutors

Emory University

2279 Tutors

Harvard University

599 Tutors

Massachusetts Institute of Technology

2319 Tutors

New York University

1645 Tutors

Notre Dam University

1911 Tutors

Oklahoma University

2122 Tutors

Pennsylvania State University

932 Tutors

Princeton University

1211 Tutors

Stanford University

983 Tutors

University of California

1282 Tutors

Oxford University

123 Tutors

Yale University

2325 Tutors