Finding upper bound for tightening of individual constraints in flexible manufacturing systems
A.N. Karchev (TU Delft - Electrical Engineering, Mathematics and Computer Science)
E. Eigbe – Mentor (TU Delft - Algorithmics)
Neil Yorke-Smith – Mentor (TU Delft - Algorithmics)
More Info
expand_more
Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.
Abstract
Delays and complications in different schedules are a common and widely applicable issue in modern society. These problems, if severe enough can cause a preexisting schedule to become infeasible, thus creating additional problems with varying levels of severity. The focus of this work is to showcase a systematic method for modelling potential disturbances in the execution of a schedule, and to provide algorithms which can help analyze the maximum bounds in which each constraint of the schedule is allowed to change without making the schedule infeasible. Presented is a method that is proven to provide results for the entire schedule with cubic complexity with regard to the number of jobs, as well as a heuristic method with results that approximate the correct ones, but runs considerably faster.