Authors: Arogundade O. Tale, Ikotun A. Motunrayo, Akinwale A. Taofik, Ogunsanwo Olubunmi
International Journal of Software Engineering and Technology, Vol. 3, No, 1, 2011
Abstract
Deployment scheme is a variant of bin packing problem .M is known to obtained. be an NP-complete problem. The deployment problem asks for the minimum number k of identical bins (states)of capacity C needed to store a finite collection of weights (OOlpS members) wI, w2, w3, … , wn so that no bin has weights stored in it whose sum exceeds the bin’s capacity. Traditionally, the capacity C i chosen to be 1 and the weights are real numbers which lie between 0 and I,but here, for convenience of exposition, the consideration will be a situation where C is a positive integer and the weights are positive integer which are less than the capacity.The bin packing concepts was modified by adding some other soft and hard constraints.The algorithm was tested with real life data of graduate from Nigerian tertiary institutions who are to be deployed for the National Youth Service Corps (NYSC) Scheme and interesting results were