{"id":28223094,"url":"https://github.com/samuelterra22/machine-task-allocation-optimization","last_synced_at":"2025-07-02T09:36:04.985Z","repository":{"id":36959711,"uuid":"221553679","full_name":"samuelterra22/Machine-Task-Allocation-Optimization","owner":"samuelterra22","description":"Script for allocating a set of tasks to a number of available machines respecting a deadline.","archived":false,"fork":false,"pushed_at":"2023-03-07T00:23:52.000Z","size":79,"stargazers_count":1,"open_issues_count":2,"forks_count":0,"subscribers_count":2,"default_branch":"master","last_synced_at":"2025-05-18T07:15:30.581Z","etag":null,"topics":["algorithm","allocation","deadline","goal","instance","machine","minimal","minimization","python","task"],"latest_commit_sha":null,"homepage":"","language":"Python","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/samuelterra22.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}},"created_at":"2019-11-13T21:19:36.000Z","updated_at":"2021-12-13T11:44:10.000Z","dependencies_parsed_at":"2023-02-12T21:16:00.850Z","dependency_job_id":null,"html_url":"https://github.com/samuelterra22/Machine-Task-Allocation-Optimization","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/samuelterra22/Machine-Task-Allocation-Optimization","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/samuelterra22%2FMachine-Task-Allocation-Optimization","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/samuelterra22%2FMachine-Task-Allocation-Optimization/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/samuelterra22%2FMachine-Task-Allocation-Optimization/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/samuelterra22%2FMachine-Task-Allocation-Optimization/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/samuelterra22","download_url":"https://codeload.github.com/samuelterra22/Machine-Task-Allocation-Optimization/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/samuelterra22%2FMachine-Task-Allocation-Optimization/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":263112428,"owners_count":23415614,"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","allocation","deadline","goal","instance","machine","minimal","minimization","python","task"],"created_at":"2025-05-18T07:14:46.041Z","updated_at":"2025-07-02T09:36:04.973Z","avatar_url":"https://github.com/samuelterra22.png","language":"Python","readme":"# Machine Task Allocation Optimization\n\n### Install linux dependencies\n\n```shell script\nsudo apt update\nsudo apt install build-essential \\\n                 software-properties-common \\\n                 python3-pip \\\n                 python3-distutils\n```\n\n### Create environment and install python dependencies\n\n```shell script\npip3 install virtualenv\nvirtualenv venv\nsource venv/bin/activate\npip install -r requirements.txt\n```\n\n### Instance\n\nUm conjunto de _n_ tarefas, cada uma com tempo de processamento _p[i]_ não negativos\n, _i=f, ..., n_ e número _m_ de máquinas disponíveis e um deadline _d_.\n\n### Solution\n\nDeterminar:\n\n- _(i)_ uma distribuição das tarefas às máquinas, tal que cada tarefa esteja em exatamente\numa máquina;\n\n- _(ii)_ tempos de início _s[i]_, _i=1, ..., n_, de cada tarefa, tal que tarefas na mesma\nmáquina não tenham sobreposição durante as execuções, e tal que nenhuma tarefa\ntermine depois do deadline.\n    \n### Goal\n\nMinimizar o tempo de espera total das taredas antes do deadline, ou seja,\n\n![](images/min.gif)\n\n### Instance format\n\n- 1ª linha: número de máquinas\n- 2ª linha: número de itens _n_\n- 3ª linha: due date _d_\n- _i_ linhas seguintes: tempos de processamento das tarefas\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsamuelterra22%2Fmachine-task-allocation-optimization","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fsamuelterra22%2Fmachine-task-allocation-optimization","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsamuelterra22%2Fmachine-task-allocation-optimization/lists"}