Full Text Available

Note: Clicking the button above will open the full text document at the original institutional repository in a new window.

Solving the buffer allocation problem using simulation-based optimisation

Dissertation (MEng (Industrial Engineering))--University of Pretoria, 2020.

Saved in:
Bibliographic Details
Other Authors: Joubert, Johan
Format: Thesis
Language:English
Published: University of Pretoria 2020
Subjects:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1867613500445032448
access_status_str Open Access
author2 Joubert, Johan
author_browse Joubert, Johan
author_facet Joubert, Johan
collection Thesis
dc_rights_str_mv © 2019 University of Pretoria. All rights reserved. The copyright in this work vests in the University of Pretoria. No part of this work may be reproduced or transmitted in any form or by any means, without the prior written permission of the University of Pretoria.
description Dissertation (MEng (Industrial Engineering))--University of Pretoria, 2020.
format Thesis
id oai:repository.up.ac.za:2263/73469
institution University of Pretoria (South Africa)
language English
last_indexed 2026-06-10T12:37:08.286Z
license_str Other — see source repository
provenance_str_mv Harvested via OAI-PMH from UPSpace — University of Pretoria Institutional Repository
publishDate 2020
publishDateRange 2020
publishDateSort 2020
publisher University of Pretoria
publisherStr University of Pretoria
record_format dspace
source_str UPSpace — University of Pretoria Institutional Repository
spelling oai:repository.up.ac.za:2263/73469 Solving the buffer allocation problem using simulation-based optimisation Joubert, Johan dirk.j.kotze12@gmail.com Kotze, Dirk Jacobus UCTD Dissertation (MEng (Industrial Engineering))--University of Pretoria, 2020. This dissertation solves the BAP, using SBO. Chapter 1 describes the role buffers play within a production line. Buffer is allocated to decouple stations and reduce the effect station failure and differing process times have on the complete line throughput. Adding buffer to the line increases the working capital required to run the line, thus the optimal number of buffer to add to a line is an important design question. The problem statement is introduced. The research design is discussed in this Chapter. A DES is specifically designed to simulate a production line for the BAP. An inner and outer loop is used to generate various buffer configurations. The ATS for the inner loop is modified by exploiting theory of constraints. The ideology states that the overall performance of a line can be improved by ensuring the bottleneck is never starved nor blocked. The proposed TOCT uses the block or starved ratio of stations to generate neighbours, reducing the number of neighbours that need to be evaluated per iteration. Small-sized, medium and large-seized lines with various process time, failure rate and repair time is used to scrutinise the proposed method, detailed computation results are shown. In Chapter 2 a literature study is done on approaches for solving the BAP. Three main objectives are considered when solving the BAP. This dissertation focuses on objective two, a prescribed throughput must be achieved with the minimum total buffer size. Various search methods, meta-heuristics and complete enumeration is discussed as an option for the evaluative method. The works of Demir et al. [9, 11] show that TS is an effective approach as a generative method for the BAP. Analytical methods and simulation is discussed as evaluative methods. The decomposition method is most common in literature. The disadvantage is that the decomposition method has limitations on the line topology it can solve as well as distribution types for the machine parameters. Alternatively, simulation or meta-models have been employed to represent more complex lines. Simulation has a more accurate representation of the production line than a meta-model but takes longer to compute. To overcome this DES can be used to create a specific program. In Chapter 3 a specific solution approach for the BAP is developed. The use of DES to design a simulation in Java specifically for the BAP problem addresses the computational burden of generic simulation models. Two event types are created for the model, departure and failure events. The works of Demir et al. [9, 11] establish a solid foundation for the use of tabu search in a two-loop manner to solve the BAP. In Chapter 4 the proposed method for creating and simulating serial production lines using the program designed in Java is comparable to a commercial program and is faster. Initial tests using DES with the ATS inner loop proved that SBO is capable of solving the BAP. However, long execution time makes it unusable for medium and large-sized problems. Two alterations are considered for the ATS and a new inner tabu loop is proposed based on theory of constraints, TOCT as well as a list that saves previously tested buffer scenarios and their throughput so that same scenarios are not re-evaluated with the simulation model. The proposed method is 18 times faster than ATS for small-sized problems and 5.5 times for medium-sized problems. The proposed method is used to solve the BAP for objective two, showing that SBO is an effective model. Finally, in Chapter 5, the solution approach scalability is tested on an actual, complex automotive production line. Industrial and Systems Engineering MEng (Industrial Engineering) Unrestricted 2020-02-21T08:32:11Z 2020-02-21T08:32:11Z 2020-06-30 2020-01-14 Dissertation Kotze, DJ 2020, Solving the buffer allocation problem using simulation-based optimisation, MEng (Industrial Engineering) Dissertation, University of Pretoria, Pretoria, viewed yymmdd <http://hdl.handle.net/2263/73469> A2020 http://hdl.handle.net/2263/73469 en © 2019 University of Pretoria. All rights reserved. The copyright in this work vests in the University of Pretoria. No part of this work may be reproduced or transmitted in any form or by any means, without the prior written permission of the University of Pretoria. application/pdf University of Pretoria
spellingShingle UCTD
Solving the buffer allocation problem using simulation-based optimisation
title Solving the buffer allocation problem using simulation-based optimisation
title_full Solving the buffer allocation problem using simulation-based optimisation
title_fullStr Solving the buffer allocation problem using simulation-based optimisation
title_full_unstemmed Solving the buffer allocation problem using simulation-based optimisation
title_short Solving the buffer allocation problem using simulation-based optimisation
title_sort solving the buffer allocation problem using simulation based optimisation
topic UCTD
url http://hdl.handle.net/2263/73469