Match-up strategies and fuzzy robust scheduling for a complex dynamic real world job shop scheduling problem
Publication Date
July 15, 2013
Creator
Abstract
This thesis investigate a complex real world job shop scheduling / rescheduling problem, in which the presence of uncertainties and the occurrence of disruptions are tackled to produce efficient and reliable solutions. New orders arrive every day in the shop floor and they have to be integrated in the existent schedule. Match-up algorithms are introduced to collect the idle time on machines and accommodate these newly arriving orders. Their aim is to obtain new schedules with good performance which are at the same time highly stable, meaning that they resemble as closely as possible the initial schedule. Subsequently, a novel approach that combines these algorithms with a fuzzy robust scheduling system is proposed. The goal is to associate an effective repairing mechanism with the production of initial robust schedules that are able to facilitate the accommodation of future disruptions. Statistical analyses reveal that match-up algorithms are effective repairing strategies for managing complex disruptions, in which high quality stable schedules are delivered. Moreover, their combination with fuzzy robust scheduling has a positive effect on responding to these disruptions leading to even more reliable solutions in a real world dynamic and uncertain shop floor.
Item Type
ethesis
Thesis Type
PhD
Supervisors
Subjects (LC)
Associated Schools / Departments
School of Computer Science (UK)
eprints ID
13054
UoN Repository URI
Except where otherwise noted, this item's license is described as
File(s)![Thumbnail Image]()
Name
thesis.pdf
Type
Full-text
Description
Match-up Strategies and Fuzzy Robust Scheduling for a Complex Dynamic Real World Job Shop Scheduling Problem
Size
2.68 MB
Format
Adobe PDF
Checksum ()