A school is creating class schedules for its students. The students submit their requested courses and then a program will be designed to find the optimal schedule for all students. The school has determined that finding the absolute best schedule cannot be solved in a reasonable time. Instead they have decided to use a simpler algorithm that produces a good but non-optimal schedule in a more reasonable amount of time. Which principle does this decision best demonstrate?

A school is creating class schedules for its students. The students submit their requested courses and then a program will be designed to find the optimal schedule for all students. The school has determined that finding the absolute best schedule cannot be solved in a reasonable time. Instead they have decided to use a simpler algorithm that produces a good but non-optimal schedule in a more reasonable amount of time. Which principle does this decision best demonstrate?

Operations Research : Applications and Algorithms

4th Edition

ISBN:9780534380588

Author:Wayne L. Winston

Publisher:Wayne L. Winston

Chapter20: Queuing Theory

Section20.15: Priority Queuing Models

Problem 2P

See similar textbooks

Similar questions

Classes are scheduled at a school. Once students have submitted their course requests, a computer algorithm can determine the optimal schedule for everyone. The school has concluded that it will take too long to determine the best schedule. Instead, they resort to a less sophisticated method that produces a serviceable if not ideal timetable. Which guiding concept is represented here?
If a Genetic Algorithm only finds local optimal solutions, what should be done to find a better one globally?
A school schedules classes. After students request courses, a programme will identify the best timetable for everyone. The school believes it cannot quickly discover the optimal timetable. Instead, they employ a simpler technique that generates a decent but non-optimal schedule faster. This choice illustrates which principle?
The gradient descent algorithm may get stuck in a local optimal point because the gradient is near zero at these points and the parameters don't get updated. Group of answer choices True False
Determine whether there is a feasible schedule for the following NONPREEMPTABLE task sets. T1 (periodic): c1 = 2, d1 = p1 = 8 T2 (sporadic): c2 = 1, d2 = 6, p2 = 7 T3 (sporadic): c3 = 1, d3 = p3 = 10 please type out the answers
A tourist representative problem has the following questions: “Given a list of cities and the distances between each pair countries. What is the shortest possible route that visits each country exactly once and returns to the origin country? What is the possible route if the Greedy Algorithm is used? The table below lists down the distances (kilometers) between countries having direct routes as well as the corresponding distances between them. Show your graph and solutions. Manila Hongkong Sydney London New York Los Angeles California Manila - 1116 6260 10760 11740 13700 Hongkong 1116 - 7400 9646 12960 11656 Sydney 6260 7400 - 17020 16020 12078 London 10760 9646 17020 - 5585 8760 New York 11740 12960 16020 5585 - 3944 Los Angeles California 13700 11656 12078 8760 3944 -
If you can make an optimal solution for a problem by making optimal solutions for its subproblems, then the problem has the quality in question. a) Subproblems that overlap; b) best substructure; c) memory; d) greedy
If an optimal solution to a problem can be obtained by greedy, It can also be obtained by dynamic programming. True or False?
A mathematical model that solely gives a representation of the real problem is the only one for which an optimal solution is optimal. True False: O
Determine whether there is a feasible schedule for the following NONPREEMPTABLE task sets. = p1 = 8 T1 (periodic): c1 = 2, d1 d2 = 6, p2 = 7 T2 (sporadic): c2 = 1, T3 (sporadic): c3 = 1, d3 =p3 = 10
Analyze the worst case, the best case and average cese scenarios while executing the following algorithm using appropriate examples: Divide and conquer
Insufficient Overlapping Subproblems and the Principle of Optimality (Optimal Substructure) are both acceptable queries for dynamic programming. Consider All-Pairs Shortest Paths as an illustration of the difficulty in achieving these two requirements.