Full Text Available
Note: Clicking the button above will open the full text document at the original institutional repository in a new window.
Reentrant permutation flowshop scheduling with a deteriorating schedule
Dissertation (MEng (Industrial Engineering))--University of Pretoria, 2021.
Saved in:
| Other Authors: | |
|---|---|
| Format: | Thesis |
| Language: | English |
| Published: |
University of Pretoria
2021
|
| Subjects: | |
| Tags: |
No Tags, Be the first to tag this record!
|
| _version_ | 1867613630616305664 |
|---|---|
| access_status_str | Open Access |
| author2 | Adetunji, Olufemi |
| author_browse | Adetunji, Olufemi |
| author_facet | Adetunji, Olufemi |
| 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, 2021. |
| format | Thesis |
| id | oai:repository.up.ac.za:2263/78077 |
| institution | University of Pretoria (South Africa) |
| language | English |
| last_indexed | 2026-06-10T12:39:12.360Z |
| license_str | Other — see source repository |
| provenance_str_mv | Harvested via OAI-PMH from UPSpace — University of Pretoria Institutional Repository |
| publishDate | 2021 |
| publishDateRange | 2021 |
| publishDateSort | 2021 |
| 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/78077 Reentrant permutation flowshop scheduling with a deteriorating schedule Adetunji, Olufemi makgobamatsebe@gmail.com Makgoba, Matsebe Juliet Reentrant flow shop Deteriorating schedule Makespan minimisation NEH Algorithm Genetic Algorithm UCTD Dissertation (MEng (Industrial Engineering))--University of Pretoria, 2021. The classic flow shop problem assumes that jobs make only single passes through the processing machines and that the processing times are not affected by the length of the delay before jobs are processed. These assumptions are being relaxed in recent papers that consider reentrance problems and those with schedule deterioration. In this study, these two assumptions are both relaxed, and a model of a reentrant flowshop with a deteriorating schedule is considered. A linear programming formulation of the problem is first presented. Three solution heuristics are considered under different deterioration scenarios. It was observed that both Nawaz Enscor and Ham (NEH) algorithm and Genetic Algorithm (GA) performed much better than the Campbell Dudek and Smith (CDS) algorithm. Overall, when considering both the quality of solution and computational time together, the NEH algorithm seems to have performed much better than the others as the size of problems increases. This model would find useful applications in some metallurgical and manufacturing processes where such problems are usually encountered. Industrial and Systems Engineering MEng (Industrial Engineering) Unrestricted 2021-01-21T08:17:24Z 2021-01-21T08:17:24Z 2021 2021 Dissertation * A2021 http://hdl.handle.net/2263/78077 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 | Reentrant flow shop Deteriorating schedule Makespan minimisation NEH Algorithm Genetic Algorithm UCTD Reentrant permutation flowshop scheduling with a deteriorating schedule |
| title | Reentrant permutation flowshop scheduling with a deteriorating schedule |
| title_full | Reentrant permutation flowshop scheduling with a deteriorating schedule |
| title_fullStr | Reentrant permutation flowshop scheduling with a deteriorating schedule |
| title_full_unstemmed | Reentrant permutation flowshop scheduling with a deteriorating schedule |
| title_short | Reentrant permutation flowshop scheduling with a deteriorating schedule |
| title_sort | reentrant permutation flowshop scheduling with a deteriorating schedule |
| topic | Reentrant flow shop Deteriorating schedule Makespan minimisation NEH Algorithm Genetic Algorithm UCTD |
| url | http://hdl.handle.net/2263/78077 |