Zum Inhalt springen
Job shop scheduling with buffer constraints and jobs consuming variable buffer space
- Link:
-
- Autor/in:
-
- Beteiligte Personen:
-
- Dangelmaier, Wilhelm
- Blecken, Alexander
- Delius, Robin
- Klöpfer, Stefan
- Verlag/Körperschaft:
- Springer
- Erscheinungsjahr:
- 2010
- Medientyp:
- Text
- Schlagworte:
-
- buffer
- generation scheme
- job shop
- Beschreibung:
-
- Job shop scheduling is among the most well studied problems in production planning. Yet, there is still a lack of comprehensive treatment of intermediate buffers. This paper deals with limited intermediate buffers with the important extension that not all jobs need to be handled in the same way regarding buffer space consumption. A heuristic to find feasible solutions is described and computational results are presented. While a reference procedure from literature devoted to case of unit buffer space consumption does not guarantee feasibility in all cases, the approach developed in this paper does. Moreover, it allows for variable space consumption, a feature which is new to literature paying better attention to more practical requirements than other models. © 2010 Springer-Verlag.
- Lizenz:
-
- info:eu-repo/semantics/closedAccess
- Quellsystem:
- Forschungsinformationssystem der UHH
Interne Metadaten
- Quelldatensatz
- oai:www.edit.fis.uni-hamburg.de:publications/dd17b1e6-503a-408d-b9d5-9cb82b4d3aea