The group scheduling problem commonly arises in cellular manufacturing systems, where parts are grouped into part families. It is characterized by a sequencing task on two levels: on the one hand, a sequence of jobs within each part family has to be identified while, on the other hand, a family sequence has to be determined. In order to solve this NP-hard problem usually heuristic solution approaches are used. In this thesis different aspects of group scheduling are discussed and problem specific heuristics are developed to solve group scheduling problems efficiently. Thereby, particularly characteristic properties of flowshop group scheduling problems, such as the structure of a group schedule or missing operations, are identified and exploited. In a simulation study for job shop manufacturing cells several novel dispatching rules are analyzed. Furthermore, a comprehensive review of the existing group scheduling literature is presented, identifying fruitful directions for future research.
| Identifer | oai:union.ndltd.org:DRESDEN/oai:qucosa.de:bsz:14-qucosa-207063 |
| Date | 19 July 2016 |
| Creators | Neufeld, Janis Sebastian |
| Contributors | Technische Universität Dresden, Fakultät Wirtschaftswissenschaften, Prof. Dr. Udo Buscher, Prof. Dr. Udo Buscher, Prof. Dr. Dominik Möst |
| Publisher | Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden |
| Source Sets | Hochschulschriftenserver (HSSS) der SLUB Dresden |
| Language | English |
| Detected Language | English |
| Type | doc-type:doctoralThesis |
| Format | application/pdf |
Page generated in 0.002 seconds