Splitting the Zones of Feasibility for a Given Schedule

Bachelor thesis (2022)

Authors

K. Wolsink Electrical Engineering, Mathematics and Computer Science

Contributors

E. Eigbe Algorithmics - EEMCS (mentor)
Faculty
Electrical Engineering, Mathematics and Computer Science, Electrical Engineering, Mathematics and Computer Science
Copyright: © 2022 Kasper Wolsink
More Info
expand_more

Published Date

22-06-2022

Language

English

Reuse Rights

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.

Faculty

Electrical Engineering, Mathematics and Computer Science

Abstract

Flexible manufacturing systems (FMS) such as large industrial printers can be modeled as re-entrant flow-shops with a set of constraints of processing times, setup times and relative due dates. This is a non-deterministic system in which the actual values for these constraints can be different from the ones originally estimated. Therefore, a way to quickly determine the ranges of constraint values for which a given schedule becomes feasible or infeasible can become highly useful. In this paper, a heuristic algorithm is proposed that can efficiently split the zones of feasibility for a given schedule. With the right settings, an accuracy of 99.9% can be achieved with relatively few queries on 2-dimensional examples.

Files

BEP_final_Kasper_Wolsink_Cover... (pdf)
(pdf | 0.716 Mb)
Unknown license