Skip to main content

Job Sequencing with Deadlines


  • Given a set of n jobs
  • Each job i has an integer deadlines di>=0 and a profit pi>0
  • All jobs requires only one unit time to complete
  • Only one machine is available for processing jobs
  • For job i the profit pi is earned if the job is completed by its deadline.










Comments