Concept explainers
The computer systems manager in mathematics department is asked to schedule two large projects. The tasks involved and the time required for each are shown in the table.
Task | Code | Units of Time |
Load project 1 | P1 | 8 |
Load project 2 | P2 | 15 |
Mount tape backup for project 1 | Tp | 11 |
Purge printer queue | Q | 10 |
Find printer for project 2 | P | 10 |
Establish connection between the projects | C | 5 |
Update project 1 | U | 20 |
Send printer jobs to buffer | B | 25 |
The tape backup for project 1 cannot be mounted until project is loased. The printer for project 2 will not be found until project 2 is loaded and the printer queue is purged. The connection between the projects cannot be established until both projects are loaded. Project I will not be buffered until the printer queue is purged.
What kind of a scheduling problem is this? Explain.
Draw a network describing this project. Apply Dijsktra’s algorithm (first version) to find the least amount of time it will require to complete the project.
Describe the critical path. Also find the maximum amount of slack in each activity.
Want to see the full answer?
Check out a sample textbook solutionChapter 11 Solutions
Discrete Mathematics with Graph Theory (Classic Version) (3rd Edition) (Pearson Modern Classics for Advanced Mathematics Series)
- College Algebra (MindTap Course List)AlgebraISBN:9781305652231Author:R. David Gustafson, Jeff HughesPublisher:Cengage LearningAlgebra & Trigonometry with Analytic GeometryAlgebraISBN:9781133382119Author:SwokowskiPublisher:Cengage
- Algebra: Structure And Method, Book 1AlgebraISBN:9780395977224Author:Richard G. Brown, Mary P. Dolciani, Robert H. Sorgenfrey, William L. ColePublisher:McDougal Littell