title: Job sequencing with job execution time, deadlines and penalties
body: <p>There is N jobs with execution times, deadlines and penalties if job misses deadline. Execution time, deadline and penalty may vary on every job. Only one job can be done at the time. And all jobs must be done. The task is to sort jobs (schedule) that penalty would be minimal.</p>
  
  <p>Do you have any ideas for algorithm or even could share some code examples? I'm really stuck with this task.</p>