Job Sequencing with Deadline Example2 | Greedy Technique | Lec 54 | Design & Analysis of Algorithm
HTML-код
- Опубликовано: 17 фев 2022
- Job Sequencing with Deadline Definition
Given a set of n jobs and associated with each job i is an integer, deadline di greater than or equal to 0 and profit pi greater than 0, it is required to find the set of jobs such that all the chosen job should be completed within their deadlines and the profit earned should be maximum
Job Sequencing with Deadline Constraints
Only one machine is available for processing jobs
Only one job must be processed at any point of time
A Job is to be completed if it is processed on a machine for one unit time
Job Sequencing with Deadline Design Steps
Jobs are arranged in decreasing order of profit
Assume the deadline of job d[I] greater than or equal to 1, deadline cannot be 0
The no. of jobs to be processed must greater than 1
All jobs require exactly one unit of time to complete
Example 2
Obtain the optimal solution for the Job Sequencing Problem given the following jobs, Profits and their deadlines
i 1 2 3 4 5
Pi 20 15 10 5 1
di 2 2 1 3 3
#jobsequencingwithdeadline
#jonsequencingproblem
#jobsequencingexample
#greedymethod
#jobsequencinggreedymethod
#greedytechnique
#cseguru
#csegurudaavideos
#cseguruadavideos
#singlesourceshortestpath
#designandanalysisofalgorithm
#ada
#daa
Binary Search Videos:
Binary Search: • Binary Search General ...
Binary Search Technique Example 1: • Binary Search Techniqu...
Binary Search Technique Example 2: • Binary Search Techniqu...
Time complexity of Binary Search : • Time complexity of Bin...
Quick Sort Videos
Quick Sort Design Steps: • Quick Sort General Met...
Quick Sort Example1: • Quick Sort Example1| ...
Quick Sort Example2 : • Quick Sort Example2 |...
Quick Sort Algorithm: • Quick Sort Algorithm ...
Merge Sort Videos
Divide & conquer : • Divide and Conquer Tec...
Merge Sort Technique : • Merge Sort General Met...
Merge Sort Algorithm : • Merge Sort Algorithm |...
Time Complexity of Merge Sort : • Time Complexity of Mer...
Bubble Sort Videos
Bubble Sort working Example | Brute Force |: • Bubble Sort working Ex...
Bubble Sort Algorithm | Logic tracing with Example: • Bubble Sort Algorithm ...
Selection Sort
Selection Sort | Algorithm Example & Analysis: • Selection Sort Example...
CSEGuru Videos
#CSEGuru Compiler Design Videos:
• Compiler Design
CSEGuru DAA Videos
• Design & Analysis of A...
CSEGuru Operating System Videos
• Operating System
CSEGuru Gate cse Videos
• Gate cse
CSEGuru NET cse Videos
• NET cse
CSEGuru Data Structure Videos
• Data Structure
CSEGuru Sorting Algorithm Videos
• Sorting Algorithm
In example 1 u have not taken the job with the same deadline because it's profit is lesser but in this video u have considered the jobs with same dead line and with less profit how is it ??
Yess I have also same doubt 🤔
❤tq mam
sab galat hai