• Treffer 3 von 7
Zurück zur Trefferliste

Scheduling a flow shop with simultaneously loaded stations: A real world application

  • Companies use special designed flow shops, in order to satisfy specific demands. Products need to be transported (from one station to the next station) by a crane and the way of working of this crane excludes the intermediate storage (of a work piece). In addition, the way of working restricts the set of feasible schedules even more than the no-buffer restriction discussed in the literature in the case of limited storage. Since this scheduling problem is integrated in the usual hierarchical planning, the tardiness is minimised. A linear optimisation model is presented to provide a formal description of this NP-hard problem. It is also used to explain the performance of priority rule based heuristic solutions on small test problems. In detail, priority rules as well as a priority rule based branch and bound procedure are analysed; priority rules are regarded, because a priority rule is still the standard procedure for on-line scheduling in industrial practise. Out of successful priority rules in the literature the best one is identified by an extensive simulative investigation. An improved look-ahead is realised by a restricted search over all possible schedules.

Metadaten exportieren

Weitere Dienste

Teilen auf Twitter Suche bei Google Scholar Anzahl der Zugriffe auf dieses Dokument
Metadaten
Verfasserangaben:Frank HerrmannORCiDGND
DOI:https://doi.org/10.17265/2328-2231/2015.03.004
Titel des übergeordneten Werkes (Englisch):Journal of Control Science and Engineering
Dokumentart:Artikel aus einer Zeitschrift/Zeitung
Sprache der Veröffentlichung:Englisch
Jahr der Veröffentlichung:2015
Datum der Freischaltung:24.01.2020
Freies Schlagwort / Tag:Minimising tardiness; No buffer and no wait; Optimisation model; Priority rule based branch and bound procedure; Priority rules; Real world flow shop with restrictions; Scheduling
GND-Schlagwort:Fließfertigung; Flow-shop-Problem
Jahrgang:3
Erste Seite:147
Letzte Seite:163
Fakultäten / Institute / Einrichtungen:Fakultät Informatik und Mathematik
OpenAccess Publikationsweg:Gold Open Access- Erstveröffentlichung in einem/als Open-Access-Medium
Forschungsschwerpunkt:Produktion und Systeme
Lizenz (Deutsch):Creative Commons - CC BY-ND - Namensnennung - Keine Bearbeitungen 4.0 International