Use this URL to cite or link to this record in EThOS:
Title: Job shop scheduling with flexible maintenance planning
Author: Struijker Boudier, Ivar
ISNI:       0000 0004 6421 6978
Awarding Body: Lancaster University
Current Institution: Lancaster University
Date of Award: 2017
Availability of Full Text:
Access from EThOS:
Access from Institution:
This thesis considers the scheduling challenges encountered at a particular facility in the nuclear industry. The scheduling problem is modelled as a variant of the job shop scheduling problem. Important aspects of the considered problem include the scheduling of jobs with both soft and hard due dates, and the integration of maintenance planning with job scheduling. Two variants of the scheduling problem are considered: The first variant makes the classic job shop assumption of infinite queueing capacity at each machine, while such queueing capacity is non-existent in the second variant. Without queueing capacity, the scheduling problem is a variant of the blocking job shop problem. For the non-blocking variant of the problem, it is shown that good solutions can be obtained quickly by hybridising a novel Ant Colony Optimisation method with a novel Branch and Bound method. For the blocking variant of the problem, it is shown that a novel Branch and Bound method can rapidly find optimal solutions. This Branch and Bound method is shown to provide good performance due to, amongst other things, a novel search strategy and a novel branching strategy.
Supervisor: Epitropakis, Michael ; Glazebrook, Kevin ; Jennings, Paul Sponsor: Not available
Qualification Name: Thesis (Ph.D.) Qualification Level: Doctoral