Show simple item record

dc.contributor.advisorWinikoff, Michael
dc.contributor.advisorCranefield, Stephen
dc.contributor.authorLi, Cheng
dc.date.available2014-10-27T19:36:24Z
dc.date.copyright2014
dc.identifier.citationLi, C. (2014). Optimizing Container Unloading and Loading Using a Hybrid Job-Shop Formulation with Buffers (Thesis, Master of Science). University of Otago. Retrieved from http://hdl.handle.net/10523/5067en
dc.identifier.urihttp://hdl.handle.net/10523/5067
dc.description.abstractThis dissertation develops an approach to solving a job-shop scheduling problem with a limited buffer capacity. The research problem is derived from solving a container unloading and loading problem at Port Otago. By modelling it as a job-shop problem and designing a graph-based solution for it, the problem can be implemented and solved using a Tabu search framework. The practical problem is a variant of a classic job-shop problem with a limited buffer capacity, input constraints and setup times. The first stage of solving the problem is to model it using a suitable representation. The next stage is to generate an initial solution and convert it into a graph representation. A set of algorithms was designed to propose and implement moves on the graph to improve the cost. Techniques to find valid and improving moves and to calculate new costs were also developed. Then these algorithms and techniques were implemented using a Tabu Search framework which iterates through the neighbourhoods s of the initial solution to find an optimized cost after a certain number of iterations. The results of measurement show that this approach can solve this unloading and loading problem with optimized costs.
dc.language.isoen
dc.publisherUniversity of Otago
dc.rightsAll items in OUR Archive are provided for private study and research purposes and are protected by copyright with all rights reserved unless otherwise indicated.
dc.subjectScheduling
dc.subjectJob-shop
dc.subjectLimited buffer capacity
dc.subjectGraph representation
dc.subjectTabu Search
dc.titleOptimizing Container Unloading and Loading Using a Hybrid Job-Shop Formulation with Buffers
dc.typeThesis
dc.date.updated2014-10-24T08:51:04Z
dc.language.rfc3066en
thesis.degree.disciplineInformation Science
thesis.degree.nameMaster of Science
thesis.degree.grantorUniversity of Otago
thesis.degree.levelMasters
otago.interloanyes
otago.openaccessAbstract Only
 Find in your library

Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item is not available in full-text via OUR Archive.

If you would like to read this item, please apply for an inter-library loan from the University of Otago via your local library.

If you are the author of this item, please contact us if you wish to discuss making the full text publicly available.

This item appears in the following Collection(s)

Show simple item record