Print Email Facebook Twitter Finding upper bound for tightening of individual constraints in flexible manufacturing systems Title Finding upper bound for tightening of individual constraints in flexible manufacturing systems Author Karchev, Angel (TU Delft Electrical Engineering, Mathematics and Computer Science) Contributor Eigbe, E. (mentor) Yorke-Smith, N. (mentor) Degree granting institution Delft University of Technology Programme Computer Science and Engineering Project CSE3000 Research Project Date 2022-06-22 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. To reference this document use: http://resolver.tudelft.nl/uuid:8f951e15-684f-44b6-a9cf-a78b13647c80 Part of collection Student theses Document type bachelor thesis Rights © 2022 Angel Karchev Files PDF Research_Project_Paper_12_1_.pdf 571.7 KB Close viewer /islandora/object/uuid:8f951e15-684f-44b6-a9cf-a78b13647c80/datastream/OBJ/view