![Open Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltextgreen.png)
![Restricted Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltextred.png)
![Open Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltextgreen.png)
![Open Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltext_open_medium.gif)
![Restricted Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltextred.png)
![Restricted Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltext_restricted_medium.gif)
Optimizing Deployment- Scheme System Using the Concept of Bin Packing Algorithm
Subscribe/Renew Journal
Deployment scheme is a variant of bin packing problem which is known to be an NP-complete problem. The deployment scheme problem asks for the minimum number k of identical bins (states) of capacity C needed to store a finite collection of weights (corps members) w1, w2, w3, ... , wn so that no bin has weights stored in it whose sum exceeds the bin's capacity. Traditionally, the capacity C is chosen to be 1 and the weights are real numbers which lie between 0 and 1, but here, for convenience of exposition, the consideration will be a situation where C is a positive integer and the weights are positive integers 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 obtained.
Keywords
Bin Packing Algorithm, Hard and Soft Constraints, NP Problem, Optimization.
User
Subscription
Login to verify subscription
Font Size
Information
![](https://i-scholar.in/public/site/images/abstractview.png)
Abstract Views: 181
![](https://i-scholar.in/public/site/images/pdfview.png)
PDF Views: 3