{"id":15448206,"url":"https://github.com/snedashkovsky/cashier_scheduler","last_synced_at":"2025-06-11T13:34:59.633Z","repository":{"id":130101034,"uuid":"178584701","full_name":"Snedashkovsky/cashier_scheduler","owner":"Snedashkovsky","description":"Scheduler for cashiers or other permutable workers, it is based on solving the problem of linear programming.","archived":false,"fork":false,"pushed_at":"2019-04-28T13:15:12.000Z","size":486,"stargazers_count":0,"open_issues_count":0,"forks_count":1,"subscribers_count":0,"default_branch":"master","last_synced_at":"2025-03-28T08:44:53.333Z","etag":null,"topics":["cashier","linear-programming","scheduler","scheduling-algorithms"],"latest_commit_sha":null,"homepage":null,"language":"Jupyter Notebook","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"agpl-3.0","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/Snedashkovsky.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","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":"2019-03-30T16:38:58.000Z","updated_at":"2019-04-28T13:15:13.000Z","dependencies_parsed_at":"2023-03-22T20:00:51.441Z","dependency_job_id":null,"html_url":"https://github.com/Snedashkovsky/cashier_scheduler","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/Snedashkovsky%2Fcashier_scheduler","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Snedashkovsky%2Fcashier_scheduler/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Snedashkovsky%2Fcashier_scheduler/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Snedashkovsky%2Fcashier_scheduler/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Snedashkovsky","download_url":"https://codeload.github.com/Snedashkovsky/cashier_scheduler/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Snedashkovsky%2Fcashier_scheduler/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":259274299,"owners_count":22832496,"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":["cashier","linear-programming","scheduler","scheduling-algorithms"],"created_at":"2024-10-01T20:22:33.455Z","updated_at":"2025-06-11T13:34:59.609Z","avatar_url":"https://github.com/Snedashkovsky.png","language":"Jupyter Notebook","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Сashier Scheduler\nScheduler for cashiers or other permutable workers, it is based on solving the problem of linear programming.  \n### Example 1. Cost minimization with strong staffing requirements  \nStrong conditions: manpower needs must be fully met.\n##### [Jupyter notebook](/Scheduler.ipynb)  \n![Demand for Labor and Optimal Shift Schedule plot](/img/demand_for_labor_and_optimal_shift_schedule_plot.png)  \n![Optimal Shift Schedule plot](/img/optimal_shift_schedule_plot.png)  \n### Example 2. Cost minimization with strong staffing requirements  and lunch breaks\nStrong conditions: manpower needs must be fully met, employees do not work during the lunch break.\n##### [Jupyter notebook](/Scheduler_with_lunch_break.ipynb)  \n![Demand for Labor and Optimal Shift Schedule plot](/img/demand_for_labor_and_optimal_shift_schedule_plot_with_lunch_breaks.png)  \n![Optimal Shift Schedule plot](/img/optimal_shift_schedule_plot_with_lunch_breaks.png)  \n### Example 3. Cost minimization with soft staffing requirements  \nSoft conditions: manpower needs must be fully met.  \nIntroduced penalties for not filling the need for labor.\n#### Coming soon \n### Instruments\nI use [PuLP library](https://pythonhosted.org/PuLP/).  \nYou can also use [CPLEX](https://www.ibm.com/analytics/cplex-optimizer) from IBM and [Z3](https://rise4fun.com/Z3/tutorial/guide) from Microsoft.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsnedashkovsky%2Fcashier_scheduler","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fsnedashkovsky%2Fcashier_scheduler","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsnedashkovsky%2Fcashier_scheduler/lists"}