Assignation of Resources and Employees in an Industrial Food Company
Visualitza/Obre
appendix-alexandrefont.pdf (9,080Mb) (Accés restringit)
memory-alexandrefont.pdf (1,968Mb) (Accés restringit)
Estadístiques de LA Referencia / Recolecta
Inclou dades d'ús des de 2022
Cita com:
hdl:2117/372298
Tipus de documentTreball Final de Grau
Data2022-07-01
Condicions d'accésAccés restringit per decisió de l'autor
Tots els drets reservats. Aquesta obra està protegida pels drets de propietat intel·lectual i
industrial corresponents. Sense perjudici de les exempcions legals existents, queda prohibida la seva
reproducció, distribució, comunicació pública o transformació sense l'autorització del titular dels drets
Abstract
Overall, this project will treat matters regarding an industrial food company based in Catalunya. Basically, it will be differentiated in two different phases: a first phase which will basically correspond to a global study of the business, and a second one which will be focused on improving the scheduling procedure in the company. Particularly, the goal of this project is to minimize the number of delayed orders to the customers, and it will be approached by creating a heuristic algorithm that will generate the schedule plan automatically; this schedule is done nowadays manually every week. Thus, this algorithm will have to take into consideration a myriad of variables, so that it assigns both the resources and employees, in such a way to speeding up the manufacturing time of the products as much as possible. Basically, the food company works with different industrial processes simultaneously (each of which will be described in the first phase of the project), which work from Monday to Friday. Hence, the schedule plan must assign the sequence of products that will be manufactured in each of the processes, while indicating the number of employees required to do so. Particularly, the key factor to minimizing the weekly production time will be the sequence in which the products are assigned to each of the different industrial processes. Lastly, an example will be given of a real ordered list of products, and it will be executed in the designed algorithm, in order to reach a final interpretation of the results, and therefore conclude if the new scheduling procedure is applicable to the industry, or not.
TitulacióGRAU EN TECNOLOGIES INDUSTRIALS I ANÀLISI ECONÒMICA (Pla 2018)
Fitxers | Descripció | Mida | Format | Visualitza |
---|---|---|---|---|
appendix-alexandrefont.pdf | 9,080Mb | Accés restringit | ||
memory-alexandrefont.pdf | 1,968Mb | Accés restringit |