Scheduling maintenance jobs based on criticality

Sala, C. (2017) Scheduling maintenance jobs based on criticality. Master's Thesis / Essay, Industrial Engineering and Management.

	Text Master_IEM__Research_Project_2_1.pdf - Published Version Restricted to RUG campus only Download (546kB)
	Text toestemming.pdf - Other Restricted to Backend only Download (79kB)

Abstract

Annual shutdowns are a common practice in many companies, where the maintenance department uses this time to perform as many activities as possible. This scenario, here called "Maintenance Scheduling Problem", can be formulated as a mix of an FJSP and a RCPSP with a fixed makespan and a maximizing priority objective. This model is not very common, and there are no similar formulations in the literature. Moreover, a problem like this is considered to be NP-hard, which makes it very difficult to solve optimally. Therefore, we approach the solution of the Maintenance Scheduling Problem utilizing heuristic methods. The heuristic is comprised of simple sorting rules and two modes, one that schedules the maintenance jobs as soon as possible (ASAP), and the other as late as possible (ALAP). In this document, we can observe how a heuristic, as simple as it is, can be an alternative to an optimal method in terms of computational time and sometimes even solution performance

Item Type:	Thesis (Master's Thesis / Essay)
Degree programme:	Industrial Engineering and Management
Thesis type:	Master's Thesis / Essay
Language:	English
Date Deposited:	15 Feb 2018 08:28
Last Modified:	15 Feb 2018 08:28
URI:	https://fse.studenttheses.ub.rug.nl/id/eprint/15290

Actions (login required)

View Item