{"id":17984073,"url":"https://github.com/wlun001/bin-packing","last_synced_at":"2025-04-04T02:14:18.183Z","repository":{"id":133431526,"uuid":"143503246","full_name":"WLun001/bin-packing","owner":"WLun001","description":"Bin Packing Problem (Minimise number of used Bins)","archived":false,"fork":false,"pushed_at":"2018-08-30T23:57:57.000Z","size":7108,"stargazers_count":3,"open_issues_count":0,"forks_count":0,"subscribers_count":2,"default_branch":"master","last_synced_at":"2025-02-09T13:41:36.347Z","etag":null,"topics":["algorithms-datastructures","bin-packing","java"],"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/WLun001.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":"2018-08-04T06:17:22.000Z","updated_at":"2022-12-28T06:00:47.000Z","dependencies_parsed_at":null,"dependency_job_id":"77794689-fb89-4024-8bf0-f976098d40c4","html_url":"https://github.com/WLun001/bin-packing","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/WLun001%2Fbin-packing","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/WLun001%2Fbin-packing/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/WLun001%2Fbin-packing/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/WLun001%2Fbin-packing/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/WLun001","download_url":"https://codeload.github.com/WLun001/bin-packing/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":247107827,"owners_count":20884797,"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","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":["algorithms-datastructures","bin-packing","java"],"created_at":"2024-10-29T18:19:22.796Z","updated_at":"2025-04-04T02:14:18.139Z","avatar_url":"https://github.com/WLun001.png","language":"Java","funding_links":[],"categories":[],"sub_categories":[],"readme":"# bin-packing\nBin Packing Problem (Minimise number of used Bins)\n\n\n## Problem\nPack parcels into trucks, using fewest trucks. Assume all trucks have the same load limit\n\n### Solution\n#### UML diagram\n![uml diagram](docs/class-diagram.png)\n\n#### Big-O Notation\n\n| Algorithms  | Big-O Notation |\n| ------------- | ------------- |\n| First Fit  | ```O(n)``` |\n| First Fit Decreasing | Best case: ```O(n)```, Worst case: ```O(n log n)```|\n| Best Fit | O(\u003ctext\u003en\u003c/text\u003e\u003csup\u003e2\u003c/sup\u003e) |\n| Best Fit Decreasing | Best and worst case: O(\u003ctext\u003en\u003c/text\u003e\u003csup\u003e2\u003c/sup\u003e) |\n\n#### Truck Utilisation\n![utilisation](docs/utilisation.png)\n\n#### Sample Output\n![output](docs/output.gif)","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fwlun001%2Fbin-packing","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fwlun001%2Fbin-packing","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fwlun001%2Fbin-packing/lists"}