eTheses Repository

Worst-case bounds for bin-packing heuristics with applications to the duality gap of the one-dimensional cutting stock problem

Tuenter, Hans J. H. (1997)
Ph.D. thesis, University of Birmingham.

Loading
PDF (10Mb)

Abstract

The thesis considers the one-dimensional cutting stock problem, the bin-packing problem, and their relationship. The duality gap of the former is investigated and a characterisation of a class of cutting stock problems with the next round-up property is given. It is shown that worst-case bounds for bin-packing heuristics can be and are best expressed in terms of the linear programming relaxation of the corresponding cutting stock problem. The concept of recurrency is introduced for a bin-packing heuristic, which allows a more natural derivation of a measure for the worst-case behaviour. The ideas are tested on some well known bin-packing heuristics and (slightly) tighter bounds for these are derived. These new bounds (in terms of the linear programming relaxation) are then used to make inferences about the duality gap of the cutting stock problem. In particular; these bounds allow à priori, problem-specific bounds. The thesis ends with conclusions and a number of suggestions to extend the analysis to higher dimensional problems.

Type of Work:Ph.D. thesis.
Supervisor(s):Cuninghame-Green, R. A.
School/Faculty:Faculties (to 1997) > Faculty of Science
Department:School of Mathematics and Statistics, Research group of Management Mathematics
Subjects:QA Mathematics
T Technology (General)
Institution:University of Birmingham
Library Catalogue:Check for printed version of this thesis
ID Code:266
This unpublished thesis/dissertation is copyright of the author and/or third parties. The intellectual property rights of the author or third parties in respect of this work are as defined by The Copyright Designs and Patents Act 1988 or as modified by any successor legislation. Any use made of information contained in this thesis/dissertation must be in accordance with that legislation and must be properly acknowledged. Further distribution or reproduction in any format is prohibited without the permission of the copyright holder.
Export Reference As : ASCII + BibTeX + Dublin Core + EndNote + HTML + METS + MODS + OpenURL Object + Reference Manager + Refer + RefWorks
Share this item :
QR Code for this page

Repository Staff Only: item control page