Finding critical edges in schedules for re-entrant manufacturing machines

Bachelor thesis (2022)

Authors

A. van Delft Electrical Engineering, Mathematics and Computer Science

Contributors

E. Eigbe Algorithmics - EEMCS (mentor)
N. Yorke-Smith Algorithmics - EEMCS (mentor)
M.J.T. Reinders Pattern Recognition and Bioinformatics - EEMCS (graduation committee member)
Faculty
Electrical Engineering, Mathematics and Computer Science, Electrical Engineering, Mathematics and Computer Science
Copyright: © 2022 Amir van Delft
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

Critical constraints in re-entrant flexible manufacturing systems(FMSs) schedules are those constraints that for some change to their weight (and only the weight), could make the sequence of operation in the schedule infeasible. This paper describes how to find critical constraints by representing the benchmark as a graph and finding its strongly connected components and by exploiting the properties of FMSs.
We also find we can force the schedule to have non-participating constraints at some points in the sequence. Finally, we see two possible relationships between critical constraints and describe how these can be found.
We conclude that the points in the sequence where non-critical edges lay, have infinite temporal flexibility.

Files

Research_paper_Final_1.pdf
(pdf | 0.304 Mb)
Unknown license