Please use this identifier to cite or link to this item: http://ir.juit.ac.in:8080/jspui/jspui/handle/123456789/7261
Full metadata record
DC FieldValueLanguage
dc.contributor.authorSharma, Sakshi-
dc.contributor.authorGarg, Abhishek [Guided by]-
dc.contributor.authorAgarwal, Shishir [Guided by]-
dc.date.accessioned2022-10-04T08:55:20Z-
dc.date.available2022-10-04T08:55:20Z-
dc.date.issued2019-
dc.identifier.urihttp://ir.juit.ac.in:8080/jspui/jspui/handle/123456789/7261-
dc.description.abstractWorkforce scheduling can be a difficult task to perform especially when it comes to providing services to multiple clients. To meet the service requirements, personnel are deployed daily for different shifts, customer sites, rules, contracts, and the list goes on and on. If all this work was to be done manually using excel based tools, then it would be a nightmare for anyone. So, the need of the hour is to have a flexible and scalable rostering solution. As of now, there is no one-stop-shop rostering solution available in the market. All the solutions available are in bits and pieces. PRS (Personnel Rostering Solution) aims to fill that gap. The rostering solution must take care if performance issues. The rostering engine must be capable of processing high loads without degrading the speed aspect. PRS caters to a wide range of functions. It can integrate with other systems to get clocking times of rostered personnel. Multiple individual software is used for various rostering related functions. PRS offers highly configurable, scalable and flexible system.en_US
dc.language.isoenen_US
dc.publisherJaypee University of Information Technology, Solan, H.P.en_US
dc.subjectRosteringen_US
dc.subjectGraphical user interfaceen_US
dc.subjectJavaScripten_US
dc.subjectAlgorithmen_US
dc.titlePersonnel Rostering Solutionen_US
dc.typeProject Reporten_US
Appears in Collections:B.Tech. Project Reports

Files in This Item:
File Description SizeFormat 
Personnel Rostering Solution.pdf956.05 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.