Say in a scheduling scenario you are given a number of jobs, each with a start time and a finish time. Two jobs conflict if they overlap in time, i.e., one of them starts between the start and finish times of the other. Your goal is to select a maximum-size subset of jobs that have no conflicts. Example: Three jobs consuming the intervals [0, 3], [2, 5], and [4, 7]. The optimal solution in this case would consist of the first and third ones. Design and describe a greedy algorithm that computes an optimal solution to this problem. Informally argue why the solution is likely to be optimal and demonstrate on an example. You may assume that there are no ties.
Say in a scheduling scenario you are given a number of jobs, each with a start time and a finish time. Two jobs conflict if they overlap in time, i.e., one of them starts between the start and finish times of the other. Your goal is to select a maximum-size subset of jobs that have no conflicts. Example: Three jobs consuming the intervals [0, 3], [2, 5], and [4, 7]. The optimal solution in this case would consist of the first and third ones. Design and describe a greedy algorithm that computes an optimal solution to this problem. Informally argue why the solution is likely to be optimal and demonstrate on an example. You may assume that there are no ties.
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
Related questions
Question
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 2 steps
Knowledge Booster
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
- Recommended textbooks for youDatabase System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill EducationStarting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSONDigital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSONDatabase System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill EducationStarting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSONDigital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSONC How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSONDatabase Systems: Design, Implementation, & Manag…Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage LearningProgrammable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education