Asymptotic Worst-Case Analyses for the Open Bin Packing Problem
| dc.contributor.author | Ongkunaruk, Pornthipa | en |
| dc.contributor.committeechair | Chan, Lap Mui Ann | en |
| dc.contributor.committeecochair | Lin, Kyle Y. | en |
| dc.contributor.committeemember | Sarin, Subhash C. | en |
| dc.contributor.committeemember | Anderson-Cook, Christine M. | en |
| dc.contributor.committeemember | Bish, Ebru K. | en |
| dc.contributor.department | Industrial and Systems Engineering | en |
| dc.date.accessioned | 2014-03-14T20:20:20Z | en |
| dc.date.adate | 2006-01-06 | en |
| dc.date.available | 2014-03-14T20:20:20Z | en |
| dc.date.issued | 2005-10-07 | en |
| dc.date.rdate | 2008-01-06 | en |
| dc.date.sdate | 2005-12-15 | en |
| dc.description.abstract | The open bin packing problem (OBPP) is a new variant of the well-known bin packing problem. In the OBPP, items are packed into bins so that the total content before the last item in each bin is strictly less than the bin capacity. The objective is to minimize the number of bins used. The applications of the OBPP can be found in the subway station systems in Hong Kong and Taipei and the scheduling in manufacturing industries. We show that the OBPP is NP-hard and propose two heuristic algorithms instead of solving the problem to optimality. We propose two offline algorithms in which the information of the items is known in advance. First, we consider the First Fit Decreasing (FFD) which is a good approximation algorithm for the bin packing problem. We prove that its asymptotic worst-case performance ratio is no more than 3/2. We observe that its performance for the OBPP is worse than that of the BPP. Consequently, we modify it by adding the algorithm that the set of largest items is the set of last items in each bin. Then, we propose the Modified First Fit Decreasing (MFFD) as an alternative and prove that its asymptotic worst-case performance ratio is no more than 91/80. We conduct empirical tests to show their average-case performance. The results show that in general, the FFD and MFFD algorithms use no more than 33% and 1% of the number of bins than that of optimal packing, respectively. In addition, the MFFD is asymptotically optimal when the sizes of items are (0,1) uniformly distributed. | en |
| dc.description.degree | Ph. D. | en |
| dc.identifier.other | etd-12152005-230125 | en |
| dc.identifier.sourceurl | http://scholar.lib.vt.edu/theses/available/etd-12152005-230125/ | en |
| dc.identifier.uri | http://hdl.handle.net/10919/30105 | en |
| dc.publisher | Virginia Tech | en |
| dc.relation.haspart | final.pdf | en |
| dc.rights | In Copyright | en |
| dc.rights.uri | http://rightsstatements.org/vocab/InC/1.0/ | en |
| dc.subject | Asymptotic Worst-Case Performance Ratio | en |
| dc.subject | Off-Line Algorithms | en |
| dc.subject | Bin Packing | en |
| dc.title | Asymptotic Worst-Case Analyses for the Open Bin Packing Problem | en |
| dc.type | Dissertation | en |
| thesis.degree.discipline | Industrial and Systems Engineering | en |
| thesis.degree.grantor | Virginia Polytechnic Institute and State University | en |
| thesis.degree.level | doctoral | en |
| thesis.degree.name | Ph. D. | en |
Files
Original bundle
1 - 1 of 1