Home > Research > Publications & Outputs > Job Shop Scheduling with Flexible Maintenance P...

Electronic data

  • 2017struijker boudierphd.pdf

    Final published version, 1.82 MB, PDF document

    Available under license: CC BY-NC-ND: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License

Text available via DOI:

View graph of relations

Job Shop Scheduling with Flexible Maintenance Planning

Research output: ThesisDoctoral Thesis

Published
Publication date9/08/2017
Number of pages304
QualificationPhD
Awarding Institution
Supervisors/Advisors
Thesis sponsors
  • EPSRC
  • National Nuclear Laboratory
Award date9/08/2017
Place of PublicationLancaster
Publisher
  • Lancaster University
Original languageEnglish

Abstract

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.