Job Sequencing with Deadline Example1 | Greedy Technique | Lec 53 | Design & Analysis of Algorithm

Описание к видео Job Sequencing with Deadline Example1 | Greedy Technique | Lec 53 | Design & Analysis of Algorithm

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

Example1
Obtain the optimal solution for the Job Sequencing Problem with deadlines where n=4(no. of jobs) Profit(P1,P2,P3,P$) = (100,10,15,27) and deadlines(d1,d2,d3,d4) = (2,1,2,1)

#jobsequencingwithdeadline
#jonsequencingproblem
#jobsequencingexample
#greedymethod
#jobsequencinggreedymethod
#greedytechnique
#cseguru
#csegurudaavideos
#cseguruadavideos
#singlesourceshortestpath
#designandanalysisofalgorithm
#ada
#daa


Binary Search Videos:
Binary Search:    • Binary Search General Method | Divide...  
Binary Search Technique Example 1:    • Binary Search Technique Example1 | Di...  
Binary Search Technique Example 2:    • Binary Search Technique Example 2 | D...  
Time complexity of Binary Search :    • Time complexity of Binary Search | Di...  


Quick Sort Videos
Quick Sort Design Steps:    • Quick Sort General Method | Divide & ...  
Quick Sort Example1:    • Quick Sort  Example1| Divide & Conque...  
Quick Sort Example2 :    • Quick Sort  Example2 | Divide & Conqu...  
Quick Sort Algorithm:    • Quick Sort  Algorithm | Divide & Conq...  

Merge Sort Videos
Divide & conquer :    • Divide and Conquer Technique | Master...  
Merge Sort Technique :    • Merge Sort General Method | Divide & ...  
Merge Sort Algorithm :    • Merge Sort Algorithm | Divide & Conqu...  
Time Complexity of Merge Sort :    • Time Complexity of Merge Sort | Divid...  

Bubble Sort Videos
Bubble Sort working Example | Brute Force |:    • Bubble Sort working Example |  Brute ...  
Bubble Sort Algorithm | Logic tracing with Example:    • Bubble Sort Algorithm Logic | Brute F...  

Selection Sort
Selection Sort | Algorithm Example & Analysis:    • Selection Sort Example & Analysis | B...  

CSEGuru Videos
#CSEGuru Compiler Design Videos:
   • Compiler Design  

CSEGuru DAA Videos
   • Design & Analysis of Algorithm  

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  

Комментарии

Информация по комментариям в разработке