{"id":20409676,"url":"https://github.com/sleekpanther/minimize-lateness","last_synced_at":"2025-08-04T09:33:03.599Z","repository":{"id":115108649,"uuid":"99572803","full_name":"SleekPanther/minimize-lateness","owner":"SleekPanther","description":"Greedy Algorithm to minimize lateness when scheduling jobs on a processor","archived":false,"fork":false,"pushed_at":"2017-08-07T18:07:13.000Z","size":418,"stargazers_count":0,"open_issues_count":0,"forks_count":1,"subscribers_count":2,"default_branch":"master","last_synced_at":"2025-03-05T02:42:59.986Z","etag":null,"topics":["algorithm-design","algorithms","greedy","greedy-algorithms","job","late","lateness","minimize","minimize-lateness","minimizelateness","noah","noah-patullo","noahpatullo","pattullo","pattulo","patullo","patulo","process","processing-time","schedule"],"latest_commit_sha":null,"homepage":"","language":"Java","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/SleekPanther.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2017-08-07T11:53:23.000Z","updated_at":"2022-11-20T07:30:43.000Z","dependencies_parsed_at":null,"dependency_job_id":"cdfd2ec8-d5e8-48fc-8589-a5e458978a19","html_url":"https://github.com/SleekPanther/minimize-lateness","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/SleekPanther/minimize-lateness","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/SleekPanther%2Fminimize-lateness","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/SleekPanther%2Fminimize-lateness/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/SleekPanther%2Fminimize-lateness/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/SleekPanther%2Fminimize-lateness/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/SleekPanther","download_url":"https://codeload.github.com/SleekPanther/minimize-lateness/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/SleekPanther%2Fminimize-lateness/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":268675515,"owners_count":24288285,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","status":"online","status_checked_at":"2025-08-04T02:00:09.867Z","response_time":79,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["algorithm-design","algorithms","greedy","greedy-algorithms","job","late","lateness","minimize","minimize-lateness","minimizelateness","noah","noah-patullo","noahpatullo","pattullo","pattulo","patullo","patulo","process","processing-time","schedule"],"created_at":"2024-11-15T05:42:55.157Z","updated_at":"2025-08-04T09:33:03.559Z","avatar_url":"https://github.com/SleekPanther.png","language":"Java","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Minimizing Lateness\nGreedy Algorithm to minimize lateness when scheduling jobs on a processor\n\n## Problem Statement\n- Processor can process 1 job at a time\n- Job `j` requires t\u003csub\u003ej\u003c/sub\u003e units of processing time and is due at time d\u003csub\u003ej\u003c/sub\u003e\n-  `j` starts at time **s(j)**, it finishes at time **f(j)** = s(j) + t\u003csub\u003ej\u003c/sub\u003e\n- **Lateness =**  max {0, f(j) – d\u003csub\u003ej\u003c/sub\u003e}\n- **Goal: schedule all jobs to minimize the maximum lateness**\n\n### Input Jobs\n\u003cimg src=\"images/input-jobs.png\" width=\"300\"\u003e\n\n## Algorithm\n**Consider jobs with Earlieast Deadline first**  \n![](images/pseudocode.png)\n\n### Runtime\nSorting O(n log(n)) + for-loop Θ(n)  \n**O(n log(n))**\n\n## Optimal Job Ordering\n![](images/optimal-job-order.png)  \n#### Max Lateness = 1\n\n## References\n- [Tudelft slides](https://ocw.tudelft.nl/wp-content/uploads/Algoritmiek_Scheduling_to_Minimize_Maximum_Lateness.pdf)\n- [Kevin Wayne slides](https://www.cs.princeton.edu/courses/archive/spring13/cos423/lectures/04GreedyAlgorithmsI-2x2.pdf)\n- [Srinivasan Parthasarathy slides](https://www.cs.umd.edu/class/sum2005/cmsc451/lateness.pdf)\n- [Carl Kingsford slides](https://www.cs.umd.edu/class/fall2009/cmsc451/lectures/Lec05a-minlate.pdf)\n- [Chandra Chekuri slides](https://courses.engr.illinois.edu/cs473/fa2010/Lectures/lecture11.pdf)\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsleekpanther%2Fminimize-lateness","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fsleekpanther%2Fminimize-lateness","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsleekpanther%2Fminimize-lateness/lists"}