Change search
ReferencesLink to record
Permanent link

Direct link
Automated scheduling: Performance in different scenarios
KTH, School of Computer Science and Communication (CSC).
KTH, School of Computer Science and Communication (CSC).
2015 (English)Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesis
Abstract [en]

Scheduling is and has always been a time consuming problem. While our everyday life becomes more automated, more things need to be scheduled. This report presents established algorithms for automated scheduling by conducting a basic study of relevant literature, while testing the speed of the algorithms for different scenarios. The study shows that from the most commonly used algorithms, the forward chaining is the fastest in most scenarios but will not always find a solution. A partial-order planner will always find the solution if there is one, but with the expense of time. The conclusion is that the partial-order algorithm performs better overall when reliability is more important than speed.

Place, publisher, year, edition, pages
National Category
Computer Science
URN: urn:nbn:se:kth:diva-166446OAI: diva2:811084
Available from: 2015-05-28 Created: 2015-05-10 Last updated: 2015-05-28Bibliographically approved

Open Access in DiVA

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

By organisation
School of Computer Science and Communication (CSC)
Computer Science

Search outside of DiVA

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

Total: 43 hits
ReferencesLink to record
Permanent link

Direct link