Shop scheduling problems with transportation

Autor(en): Knust, Sigrid 
Stichwörter: Materialflusssteuerung; Flexible Fertigungszelle; Reihenfolgeproblem
Erscheinungsdatum: 1999
Startseite: Online-Ressource (PostScript-Datei: 134 S., 1,01 MB)
In this thesis scheduling problems with transportation aspects are studied. Classical scheduling models for problems with multiple operations are the so-called shop-scheduling models. In these models jobs consisting of different operations have to be planned on certain machines in such a way that a given objective function is minimized. Each machine may process at most one operation at a time and operations belonging to the same job cannot be processed simultaneously. We generalize these classical shop-scheduling problems by assuming that the jobs additionally have to be transported between the machines. This transportation has to be done by robots which can handle at most one job at a time. Besides transportation times which occur for the jobs during their transport, also empty moving times are considered which arise when a robot moves empty from one machine to another. Two types of problems are distinguished: on the one hand, problems without transportation conflicts (i.e. each transportation can be performed without delay), and on the other hand, problems where transportation conflicts may arise due to a limited capacity of transport robots...
Osnabrück, Univ., Diss., 1999
Externe URL:

Show full item record

Page view(s)

Last Week
Last month
checked on Apr 20, 2024

Google ScholarTM