Suppose that you want to schedule some final exams for CS courses with following course numbers: 555, 137, 157, 203, 261, 115, 118, 156.
Suppose also that there are no students in common taking the following pairs of courses: 555‐137, 555‐157, 137‐157, 555‐203, 555‐261, 137‐261, 203‐261, 555‐115, 137‐115, 203‐115, 261‐115, 555‐118, 137‐118, 555‐156, 137‐156, 157‐156.
Schedule the exam using the fewest number of slots. [Hint: Start your answer with graph sketching]

Operations Research : Applications and Algorithms
4th Edition
ISBN:9780534380588
Author:Wayne L. Winston
Publisher:Wayne L. Winston
Chapter19: Probabilistic Dynamic Programming
Section19.4: Further Examples Of Probabilistic Dynamic Programming Formulations
Problem 7P
icon
Related questions
Question
Suppose that you want to schedule some final exams for CS courses with following course numbers: 555, 137, 157, 203, 261, 115, 118, 156.
Suppose also that there are no students in common taking the following pairs of courses: 555‐137, 555‐157, 137‐157, 555‐203, 555‐261, 137‐261, 203‐261, 555‐115, 137‐115, 203‐115, 261‐115, 555‐118, 137‐118, 555‐156, 137‐156, 157‐156.
Schedule the exam using the fewest number of slots. [Hint: Start your answer with graph sketching]
Expert Solution
steps

Step by step

Solved in 3 steps

Blurred answer
Knowledge Booster
Requirement Gathering
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Operations Research : Applications and Algorithms
Operations Research : Applications and Algorithms
Computer Science
ISBN:
9780534380588
Author:
Wayne L. Winston
Publisher:
Brooks Cole