|
|
Digital Library of the
European Council for Modelling and Simulation |
|
Title: |
Simulation
Based Priority Rules For Scheduling Of A Flow Shop With Simultaneously Loaded
Stations |
|
Authors: |
Frank Herrmann |
|
Published in:
|
(2013).ECMS 2013 Proceedings edited
by: W. Rekdalsbakken, R. T. Bye, H. Zhang European Council for Modeling
and Simulation. doi:10.7148/2013 ISBN:
978-0-9564944-6-7 27th
European Conference on Modelling and Simulation, Aalesund, Norway, May 27th –
30th, 2013 |
|
Citation
format: |
Frank
Herrmann (2013). Simulation Based Priority Rules For Scheduling Of A Flow
Shop With Simultaneously Loaded Stations,
ECMS 2013 Proceedings edited by: W. Rekdalsbakken, R. T. Bye, H. Zhang, European Council for Modeling
and Simulation. doi:10.7148/2013-0775 |
|
DOI: |
http://dx.doi.org/10.7148/2013-0775 |
|
Abstract: |
In
this study, a real world flow shop with a transportation restriction is
regarded. This restriction reduces the set of feasible schedules even more
than the no-buffer restrictions 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.
This NP-hard problem is solved by priority rules, because of the addressed
dynamic environment (and a high number of jobs) at the company site. Due to
the technological restrictions the real duration of a job is significantly
larger than its net processing time. By a simulation of the processing time many
priority rules are improved and some even significantly. With extensive
simulations successful priority rules in the literature are analysed. |
|
Full
text: |
|
