Työvuorojen aikataulutuksen optimointi PuLP-kirjaston avulla

Työvuorojen aikatauluttaminen on käytännön ongelma, jonka tekeminen käsin on työlästä. Ongelma voidaan ratkaista kirjoittamalla aikataulujen automatisointiin ja optimointiin soveltuva tietokoneohjelma. Tässä tutkielmassa selvitetään, kuinka lineaarisen kokonaislukuoptimoinnin menetelmiä voidaan hyöd...

Full description

Bibliographic Details
Main Author: Hämäläinen, Iikka
Other Authors: Informaatioteknologian tiedekunta, Faculty of Information Technology, Informaatioteknologia, Information Technology, Jyväskylän yliopisto, University of Jyväskylä
Format: Bachelor's thesis
Language:fin
Published: 2021
Subjects:
Online Access: https://jyx.jyu.fi/handle/123456789/76527
_version_ 1826225796675534848
author Hämäläinen, Iikka
author2 Informaatioteknologian tiedekunta Faculty of Information Technology Informaatioteknologia Information Technology Jyväskylän yliopisto University of Jyväskylä
author_facet Hämäläinen, Iikka Informaatioteknologian tiedekunta Faculty of Information Technology Informaatioteknologia Information Technology Jyväskylän yliopisto University of Jyväskylä Hämäläinen, Iikka Informaatioteknologian tiedekunta Faculty of Information Technology Informaatioteknologia Information Technology Jyväskylän yliopisto University of Jyväskylä
author_sort Hämäläinen, Iikka
datasource_str_mv jyx
description Työvuorojen aikatauluttaminen on käytännön ongelma, jonka tekeminen käsin on työlästä. Ongelma voidaan ratkaista kirjoittamalla aikataulujen automatisointiin ja optimointiin soveltuva tietokoneohjelma. Tässä tutkielmassa selvitetään, kuinka lineaarisen kokonaislukuoptimoinnin menetelmiä voidaan hyödyntää työvuorojen aikatauluttamisessa. Optimointitehtävän ohjelmointiin käytetään Python-kieltä ja PuLP-kirjastoa. Workforce scheduling is a real life issue that is troublesome to perform manually. It’s possible to automate and optimise the scheduling simultaneously by writing a computer program designed to resolve this issue. In this thesis it’s examined how linear integer programming methods can be applied in workforce scheduling. Python and PuLP are used to write the optimisation program.
first_indexed 2024-09-11T08:52:12Z
format Kandityö
free_online_boolean 1
fullrecord [{"key": "dc.contributor.advisor", "value": "Rossi, Tuomo", "language": "", "element": "contributor", "qualifier": "advisor", "schema": "dc"}, {"key": "dc.contributor.author", "value": "H\u00e4m\u00e4l\u00e4inen, Iikka", "language": "", "element": "contributor", "qualifier": "author", "schema": "dc"}, {"key": "dc.date.accessioned", "value": "2021-06-15T07:07:41Z", "language": null, "element": "date", "qualifier": "accessioned", "schema": "dc"}, {"key": "dc.date.available", "value": "2021-06-15T07:07:41Z", "language": null, "element": "date", "qualifier": "available", "schema": "dc"}, {"key": "dc.date.issued", "value": "2021", "language": "", "element": "date", "qualifier": "issued", "schema": "dc"}, {"key": "dc.identifier.uri", "value": "https://jyx.jyu.fi/handle/123456789/76527", "language": null, "element": "identifier", "qualifier": "uri", "schema": "dc"}, {"key": "dc.description.abstract", "value": "Ty\u00f6vuorojen aikatauluttaminen on k\u00e4yt\u00e4nn\u00f6n ongelma, jonka tekeminen k\u00e4sin on ty\u00f6l\u00e4st\u00e4. Ongelma voidaan ratkaista kirjoittamalla aikataulujen automatisointiin ja\noptimointiin soveltuva tietokoneohjelma. T\u00e4ss\u00e4 tutkielmassa selvitet\u00e4\u00e4n, kuinka lineaarisen\nkokonaislukuoptimoinnin menetelmi\u00e4 voidaan hy\u00f6dynt\u00e4\u00e4 ty\u00f6vuorojen aikatauluttamisessa.\nOptimointiteht\u00e4v\u00e4n ohjelmointiin k\u00e4ytet\u00e4\u00e4n Python-kielt\u00e4 ja PuLP-kirjastoa.", "language": "fi", "element": "description", "qualifier": "abstract", "schema": "dc"}, {"key": "dc.description.abstract", "value": "Workforce scheduling is a real life issue that is troublesome to perform manually.\nIt\u2019s possible to automate and optimise the scheduling simultaneously by writing a computer\nprogram designed to resolve this issue. In this thesis it\u2019s examined how linear integer programming methods can be applied in workforce scheduling. Python and PuLP are used to\nwrite the optimisation program.", "language": "en", "element": "description", "qualifier": "abstract", "schema": "dc"}, {"key": "dc.description.provenance", "value": "Submitted by Paivi Vuorio (paelvuor@jyu.fi) on 2021-06-15T07:07:41Z\nNo. of bitstreams: 0", "language": "en", "element": "description", "qualifier": "provenance", "schema": "dc"}, {"key": "dc.description.provenance", "value": "Made available in DSpace on 2021-06-15T07:07:41Z (GMT). No. of bitstreams: 0\n Previous issue date: 2021", "language": "en", "element": "description", "qualifier": "provenance", "schema": "dc"}, {"key": "dc.format.extent", "value": "42", "language": "", "element": "format", "qualifier": "extent", "schema": "dc"}, {"key": "dc.language.iso", "value": "fin", "language": null, "element": "language", "qualifier": "iso", "schema": "dc"}, {"key": "dc.rights", "value": "In Copyright", "language": "en", "element": "rights", "qualifier": null, "schema": "dc"}, {"key": "dc.subject.other", "value": "lineaarinen kokonaislukuoptimointi (ILP)", "language": "", "element": "subject", "qualifier": "other", "schema": "dc"}, {"key": "dc.subject.other", "value": "lineaarinen sekalukuoptimointi (MILP)", "language": "", "element": "subject", "qualifier": "other", "schema": "dc"}, {"key": "dc.subject.other", "value": "lineaarinen monitavoiteoptimointi (MOLP)", "language": "", "element": "subject", "qualifier": "other", "schema": "dc"}, {"key": "dc.subject.other", "value": "Python", "language": "", "element": "subject", "qualifier": "other", "schema": "dc"}, {"key": "dc.subject.other", "value": "PuLP", "language": "", "element": "subject", "qualifier": "other", "schema": "dc"}, {"key": "dc.title", "value": "Ty\u00f6vuorojen aikataulutuksen optimointi PuLP-kirjaston avulla", "language": "", "element": "title", "qualifier": null, "schema": "dc"}, {"key": "dc.type", "value": "bachelor thesis", "language": null, "element": "type", "qualifier": null, "schema": "dc"}, {"key": "dc.identifier.urn", "value": "URN:NBN:fi:jyu-202106153728", "language": "", "element": "identifier", "qualifier": "urn", "schema": "dc"}, {"key": "dc.type.ontasot", "value": "Bachelor's thesis", "language": "en", "element": "type", "qualifier": "ontasot", "schema": "dc"}, {"key": "dc.type.ontasot", "value": "Kandidaatinty\u00f6", "language": "fi", "element": "type", "qualifier": "ontasot", "schema": "dc"}, {"key": "dc.contributor.faculty", "value": "Informaatioteknologian tiedekunta", "language": "fi", "element": "contributor", "qualifier": "faculty", "schema": "dc"}, {"key": "dc.contributor.faculty", "value": "Faculty of Information Technology", "language": "en", "element": "contributor", "qualifier": "faculty", "schema": "dc"}, {"key": "dc.contributor.department", "value": "Informaatioteknologia", "language": "fi", "element": "contributor", "qualifier": "department", "schema": "dc"}, {"key": "dc.contributor.department", "value": "Information Technology", "language": "en", "element": "contributor", "qualifier": "department", "schema": "dc"}, {"key": "dc.contributor.organization", "value": "Jyv\u00e4skyl\u00e4n yliopisto", "language": "fi", "element": "contributor", "qualifier": "organization", "schema": "dc"}, {"key": "dc.contributor.organization", "value": "University of Jyv\u00e4skyl\u00e4", "language": "en", "element": "contributor", "qualifier": "organization", "schema": "dc"}, {"key": "dc.subject.discipline", "value": "Tietotekniikka", "language": "fi", "element": "subject", "qualifier": "discipline", "schema": "dc"}, {"key": "dc.subject.discipline", "value": "Mathematical Information Technology", "language": "en", "element": "subject", "qualifier": "discipline", "schema": "dc"}, {"key": "yvv.contractresearch.funding", "value": "0", "language": "", "element": "contractresearch", "qualifier": "funding", "schema": "yvv"}, {"key": "dc.type.coar", "value": "http://purl.org/coar/resource_type/c_7a1f", "language": null, "element": "type", "qualifier": "coar", "schema": "dc"}, {"key": "dc.rights.accesslevel", "value": "openAccess", "language": null, "element": "rights", "qualifier": "accesslevel", "schema": "dc"}, {"key": "dc.type.publication", "value": "bachelorThesis", "language": null, "element": "type", "qualifier": "publication", "schema": "dc"}, {"key": "dc.subject.oppiainekoodi", "value": "602", "language": "", "element": "subject", "qualifier": "oppiainekoodi", "schema": "dc"}, {"key": "dc.subject.yso", "value": "lineaarinen optimointi", "language": null, "element": "subject", "qualifier": "yso", "schema": "dc"}, {"key": "dc.rights.url", "value": "https://rightsstatements.org/page/InC/1.0/", "language": null, "element": "rights", "qualifier": "url", "schema": "dc"}]
id jyx.123456789_76527
language fin
last_indexed 2025-02-18T10:56:45Z
main_date 2021-01-01T00:00:00Z
main_date_str 2021
online_boolean 1
online_urls_str_mv {"url":"https:\/\/jyx.jyu.fi\/bitstreams\/264df257-9831-4517-991e-7fa3fd14cc5a\/download","text":"URN:NBN:fi:jyu-202106153728.pdf","source":"jyx","mediaType":"application\/pdf"}
publishDate 2021
record_format qdc
source_str_mv jyx
spellingShingle Hämäläinen, Iikka Työvuorojen aikataulutuksen optimointi PuLP-kirjaston avulla lineaarinen kokonaislukuoptimointi (ILP) lineaarinen sekalukuoptimointi (MILP) lineaarinen monitavoiteoptimointi (MOLP) Python PuLP Tietotekniikka Mathematical Information Technology 602 lineaarinen optimointi
title Työvuorojen aikataulutuksen optimointi PuLP-kirjaston avulla
title_full Työvuorojen aikataulutuksen optimointi PuLP-kirjaston avulla
title_fullStr Työvuorojen aikataulutuksen optimointi PuLP-kirjaston avulla Työvuorojen aikataulutuksen optimointi PuLP-kirjaston avulla
title_full_unstemmed Työvuorojen aikataulutuksen optimointi PuLP-kirjaston avulla Työvuorojen aikataulutuksen optimointi PuLP-kirjaston avulla
title_short Työvuorojen aikataulutuksen optimointi PuLP-kirjaston avulla
title_sort työvuorojen aikataulutuksen optimointi pulp kirjaston avulla
title_txtP Työvuorojen aikataulutuksen optimointi PuLP-kirjaston avulla
topic lineaarinen kokonaislukuoptimointi (ILP) lineaarinen sekalukuoptimointi (MILP) lineaarinen monitavoiteoptimointi (MOLP) Python PuLP Tietotekniikka Mathematical Information Technology 602 lineaarinen optimointi
topic_facet 602 Mathematical Information Technology PuLP Python Tietotekniikka lineaarinen kokonaislukuoptimointi (ILP) lineaarinen monitavoiteoptimointi (MOLP) lineaarinen optimointi lineaarinen sekalukuoptimointi (MILP)
url https://jyx.jyu.fi/handle/123456789/76527 http://www.urn.fi/URN:NBN:fi:jyu-202106153728
work_keys_str_mv AT hämäläineniikka työvuorojenaikataulutuksenoptimointipulpkirjastonavulla