{"id":26222079,"url":"https://github.com/martinrepo/smartgrid","last_synced_at":"2026-04-29T05:38:06.222Z","repository":{"id":231308671,"uuid":"781327249","full_name":"MartinRepo/SmartGrid","owner":"MartinRepo","description":"Implementation of some smart grid sheduling algorithms, with a visualization page.","archived":false,"fork":false,"pushed_at":"2024-05-08T21:41:54.000Z","size":898,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2024-05-09T10:59:39.148Z","etag":null,"topics":["algorithm-implementations","smart-grid"],"latest_commit_sha":null,"homepage":"https://demo-smartgrid.tech","language":"C++","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/MartinRepo.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":"2024-04-03T07:10:07.000Z","updated_at":"2024-05-08T21:41:57.000Z","dependencies_parsed_at":"2024-04-17T12:32:28.672Z","dependency_job_id":"4f6b0eef-daf3-4d14-b32e-89833c37ac29","html_url":"https://github.com/MartinRepo/SmartGrid","commit_stats":null,"previous_names":["martinrepo/smartgrid"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/MartinRepo%2FSmartGrid","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/MartinRepo%2FSmartGrid/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/MartinRepo%2FSmartGrid/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/MartinRepo%2FSmartGrid/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/MartinRepo","download_url":"https://codeload.github.com/MartinRepo/SmartGrid/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":243255522,"owners_count":20262016,"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":["algorithm-implementations","smart-grid"],"created_at":"2025-03-12T16:39:46.284Z","updated_at":"2025-12-27T08:30:16.400Z","avatar_url":"https://github.com/MartinRepo.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Scheduling for Smart Grid\n\u003eAuthored by: @[Martingale](https://github.com/MartinRepo)\n\n\u003eClick [here](https://demo-smartgrid.tech) to visit demo site. Just try it. :D\n## Content\n- [Algorithms Implementation](#algorithms-implementation)\n  - [Feasible Graph](#feasible-graph)\n  - [Fixed Parameter](#fixed-parameter)\n  - [Greedy](#greedy)\n  - [Genetic](#genetic)\n- [Dataset Preview](#dataset-preview)\n- [Simulation](#simulation)\n- [Performance Comparison](#performance-comparison)\n  - [Total cost](#total-cost)\n  - [Peak cost](#peak-cost)\n  - [Running time](#running-time)\n- [References](#references)\n\n## Algorithms Implementation\nCore strategies for following algorithms\n### Feasible Graph\n  ![feasible graph](./readmeFig/feasiblegraph.jpg)\n### Fixed Parameter\nPseudocode as following\n```\nInput: a set of job J \nOutput: an optimal configuration of J \n{bi} i=1...τ/2+1 ← the boundaries {0, 2, 4, 6, ..., τ} \n{Di} i=1...τ/2 ← the windows where Di is bounded by bi (inclusively) and bi+1 (exclusively) \n{Ci} i=1...τ/2 ← the collection of job sets where Ci is the set of jobs in Di \nTleft ← a configuration that labels all jobs j ∈ J to be not yet executed for i from 1 to τ/2 do \nTright ← ListConfigurations(Di, Ci) \nTleft ← ConcatenateTables(Tleft, Tright) \nTleft ← FilterTable(Tleft) \nreturn any configuration in Tleft\n```\n### Greedy\nJob is assigned to the machine with the smallest number of jobs currently assigned.\n### Genetic\nRegard a solution as an individual. Then through constant crossover mutations\n(crossover: crossing two schedules to generate a new schedule. \n\nMutation: randomly changing the position or time of a task within a feasible interval.).\n\nIt uses the fitness function (calculating peak cost) to decide which scheduling scheme is kept and which is filtered out.\n## Dataset Preview\nThere are 11 jobs, 6 windows, 7 boundaries.Their width(duration) and height(power cost) is adjusted\n\n![jobs interval](./readmeFig/jobs.jpg)\n\n## Simulation\n![simulation](./readmeFig/simulation.jpg)\n\n## Performance Comparison\nLoad function: Sum of jobs' height in per unit time t. 𝐿(𝑡) = ∑𝐽:𝑡 𝐻(𝑗)\n### Total cost\nTotal cost function: Total cost of the entire scheduling solution S. 𝐶𝑜𝑠𝑡(𝑆) = ∑ 𝐿(𝑡)^𝛼\n### Peak cost\nPeak cost function: 𝐶𝑜𝑠𝑡(𝑆) = max(𝐿(𝑡))^𝛼\n### Running time\nEvery algorithm's running time.\n\n## References\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmartinrepo%2Fsmartgrid","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fmartinrepo%2Fsmartgrid","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmartinrepo%2Fsmartgrid/lists"}