This thesis deals with portation of the OptaPlanner tool to the Android operating system. The OptaPlanner is used for solving planning problems and it is completely written in the Java programming language which is also used for application development of the Android operating system. However, Android does not contain all of the Java Standard Edition Application Programming Interface libraries and porting of OptaPlanner to Android thus causes dependency problems. The result of the thesis is solution design and implementation of the problems mentioned above and model Android Vehicle Routing Problem application which uses ported OptaPlanner tool.

Examensarbetet undersöker huruvida det är möjligt att helt eller delvis automatisera en universitetslärares schemaläggning av tjänstgöringsplaneringen. För detta ändamål har Design and Creation använts som forskningsmetod genom att utveckla en prototyp som baseras på ’constraint problem solver’-verktyget OptaPlanner. Prototypen har testats med hjälp av ett fallexempel som tillät att jämföra de automatiskt genererade scheman med ett verkligt schema. Fallexemplet visar vilken information om arbetsuppgifterna för en lärare som är tillgänglig samt hur individuella krav och önskemål av en lärare beträffande schemaläggningen kan se ut. Resultaten visar att prototypen klarar av att lägga till aktiviteter och generera olika scheman baserat på lärarnas individuella önskemål och krav. Det förekommer fall där prototypen inte klarar av att lägga ett godkänt schema p.g.a. att några av de hårda reglerna bryts mot. Syftet med den automatiska schemaläggningen är att generera en grundstomme för planeringen, så att lärare vet att de aktiviteterna i schemat motsvarar de förväntade arbetsinsatserna enligt tjänstgöringsplanen. Det tillåter en kontroll av den egna arbetstiden som annars är mycket besvärlig att uppnå. Examensarbetets främsta bidrag är att visa på vilket sätt det är möjligt att schemalägga kalendertiden av en tjänstgöringsplan utan att det blir någon övertid. / This thesis examines whether it is possible to automate a university teacher’s scheduling of service planning fully or partially. For this purpose, Design and Creation has been used as a research method by developing a prototype based on the constraint problem solver tool OptaPlanner. The prototype has been tested using a case study that allowed to compare the automatically generated schemes with a real scheme. The case example shows what information about the tasks for a teacher is available and how individual requirements and wishes of a teacher regarding scheduling can look like. The results show that the prototype can add activities and generate different schedules based on the teachers' individual wishes and requirements. There are cases where the prototype is unable to schedule an approved schedule due to the hard rules are being violated. The purpose of the automatic scheduling is to generate a basic framework for the planning, so that teachers know that the activities in the schedule correspond to the expected work efforts according to the duty plan. It allows a control of one's own working hours which is otherwise very difficult to achieve. The main contribution of the degree project is to show in what way it is possible to schedule the calendar time of a duty plan without any overtime.

The efficiency of an assembly line depends on how the different tasks are distributed among the work stations that make up the assembly line. Assigning the tasks to the stations is called assembly line balancing (ALB) and is an NP-hard optimization problem. While automating line balancing has the potential to make manufacturing more efficient, and the problem has been studied for many decades, the research has not been widely adopted by industry, where planning is still largely done manually. This thesis discusses reasons for this theory-practice gap and suggests a direction that is more focused on real-world applications. This includes shifting the focus to a decision support system (DSS) rather than considering the ALB solver in isolation. Such a shift places the solver in a new context, where it plays a slightly different role and needs to fulfill slightly different requirements. A framework for building practical ALB solvers within a DSS context is proposed and then evaluated by implementing solvers for two different assembly line models. Increasingly refined versions of the ALB solvers are compared to each other, showing that the most specialized version performs substantially better than the simplest, which demonstrates that this framework allows an effective trade-off between development time and performance. One of the implemented solvers is also pitted against a state-of-the-art solver for the Simple Assembly Line Balancing Problem type 1 (SALBP-1) by comparing its results on a standard set of problem instances against the best published results. The comparison shows that the implemented solver is not just competitive but in some ways superior. On the largest instances, it produces improved solutions for 99 % of the instances that had not already been solved optimally, reducing the number of stations by more than 2 % on average. The solvers also demonstrated the potential to effectively trade off running time and solution quality, which is an important feature in an interactive system that is meant to support an iterative refinement process.