umu.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Optimal fördelning av anställningsformer på SJ: Ett planeringsprogram baserat på villkorsprogrammering och kända schemakäggningsproblem
Umeå University, Faculty of Science and Technology, Department of Mathematics and Mathematical Statistics.
Umeå University, Faculty of Science and Technology, Department of Mathematics and Mathematical Statistics.
2018 (Swedish)Independent thesis Advanced level (degree of Master (One Year)), 300 HE creditsStudent thesis
Abstract [sv]

A big challenge for many companies, road haulers business among others, is how to make a schedule for all employees. Scheduling problems handles a big number of constraints which also increase the complexity of the problem.

 

It is important to SJ that all train departures are staffed. SJ offers both permanent and temporary employments but during recruitment in connection to the summer they only hire temporary employees. It often happens that SJ hires a larger number of workers than needed, and as a consequence of this some of the employees does not get to work the number of hours the wishes and they might turn to other employers. Temporary employments can result in uncertainty for SJ as they can choose when to work. Due to this, SJ now wants to examine the possibility to hire permanent employees during the summer and they also want to examine how the distribution of employments should look like for different stations and time periods.

 

Important constraints for scheduling and planning have been identified and formulated, and these have formed the basis to the optimization problem that is indented to be solved. A scheduling tool, EAPS, has been developed and with help from this minimal staff set and employment arrangements for boarders can be identified. EAPS ensure that each worker is free every other weekend, that no worker is assigned more shifts than allowed for the analyzed period and that they do not work more shifts in a row than allowed. EAPS ensure that all departures are covered by boarders at the same time as the number of workers are minimized.

Place, publisher, year, edition, pages
2018. , p. 58
National Category
Mathematics
Identifiers
URN: urn:nbn:se:umu:diva-153061OAI: oai:DiVA.org:umu-153061DiVA, id: diva2:1260913
External cooperation
SJ AB
Educational program
Master of Science in Engineering and Management
Supervisors
Examiners
Available from: 2018-11-09 Created: 2018-11-05 Last updated: 2018-11-09Bibliographically approved

Open Access in DiVA

fulltext(12670 kB)63 downloads
File information
File name FULLTEXT02.pdfFile size 12670 kBChecksum SHA-512
e2d5d6d9909ff3297886398eff2c31b633c16c1ced5632c8b1b0cb641a7803c8f2614ee653a7819b5177cf351454ad8a8cc868e11c7b5879cb8f27e7e29346dc
Type fulltextMimetype application/pdf

By organisation
Department of Mathematics and Mathematical Statistics
Mathematics

Search outside of DiVA

GoogleGoogle Scholar
Total: 63 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

urn-nbn

Altmetric score

urn-nbn
Total: 165 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf