|Communications on Applied Electronics|
|Foundation of Computer Science (FCS), NY, USA|
|Volume 2 - Number 8|
|Year of Publication: 2015|
|Authors: Taiwo O. Ojeyinka|
Taiwo O. Ojeyinka . Bin Packing Algorithms with Applications to Passenger Bus Loading and Multiprocessor Scheduling Problems. Communications on Applied Electronics. 2, 8 ( September 2015), 38-44. DOI=10.5120/cae2015651851
The problem of arranging items into bins in order to minimize the overall number of used bins was implemented and evaluated using the online and offline bin packing heuristics. The study implemented the fill function to evaluate the performance of both the online and offline variants of bin packing heuristics. The algorithms were applied to some commonly occurring NP-hard problems whose solutions require optimisation e.g. the passenger-bus scheduling and the multiprocessor job scheduling problems. The results of the evaluation show that the minimisation function varied w.r.t. the sizes of the items and also of the bins. Results further shows that a minimised resource allocation and makespan are feasible for the passenger-bus scheduling and the multiprocessor job allocation respectively.