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
Automated Assignment of Lab Assistants to Student Presentations at KTH Lab Sessions
KTH, School of Electrical Engineering and Computer Science (EECS).
KTH, School of Electrical Engineering and Computer Science (EECS).
2018 (English)Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesisAlternative title
Automatisk tilldelning av labbassistenter till studentpresentationer under KTH-labbsessioner (Swedish)
Abstract [en]

The authors study the case of lab presentations at KTH. Currently, lab assistants follow the First In First Out principle when deciding what student presentation to visit first. The authors study whether the Shortest Job Next discipline can give a significant advantage in presentation throughput. They create a simulation of a lab session, and simulate sessions with both SJN and FIFO, and varying values of time per presentation, number of assistants and number of lab rooms in the session. It is shown that Shortest Job Next gives a consistently higher number of presentations, but also on average a longer maximum waiting time. The effect on number of handled presentations is the highest when the time per presentation is low and the number of rooms is high.

Abstract [sv]

Författarna studerar labbpresentationer vid KTH. I nuläget baserar sig labbassistenter på First In First Out-principen när de bestämmer vilken ordning de ska besöka de olika studentgrupperna som har markerat sig som redo att presentera. Författarna undersöker huruvida Shortest Job Next-principen kan ge ett betydande övertag i antal presentationer per tidsenhet. De skapar en simulation av ett labbtillfälle och testar simulationen mot både FIFO och SJN, under ett antal olika värden på tid per presentation, antal tillgängliga övningsassistenter och antal rum i labbsessionen. Det visar sig att Shortest Job Next ger ett konsekvent högre antal presentationer per tidsenhet, men att den också medför en risk att vissa grupper får vänta väldigt länge på att presentera. Effekten på antal avklarade presentationer är som störst när tiden per presentation är låg och antalet rum är stort.

Place, publisher, year, edition, pages
2018.
Series
TRITA-EECS-EX ; 2018:223
National Category
Engineering and Technology
Identifiers
URN: urn:nbn:se:kth:diva-229694OAI: oai:DiVA.org:kth-229694DiVA, id: diva2:1214051
Subject / course
Computer Science
Educational program
Master of Science in Engineering - Computer Science and Technology
Supervisors
Examiners
Available from: 2018-07-10 Created: 2018-06-05 Last updated: 2018-07-10Bibliographically approved

Open Access in DiVA

fulltext(509 kB)1 downloads
File information
File name FULLTEXT01.pdfFile size 509 kBChecksum SHA-512
b4414d60f5bb6606fc9b9885f6215f441f8c87962e759bf2e1c82a653451e88054a9d79e7b955677c3d902689f4088774a5e1190841501275d21fb4a1f3087d1
Type fulltextMimetype application/pdf

By organisation
School of Electrical Engineering and Computer Science (EECS)
Engineering and Technology

Search outside of DiVA

GoogleGoogle Scholar
Total: 1 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: 7 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