期刊名称：International Journal of Innovative Research in Computer and Communication Engineering
印刷版ISSN：2320-9798
电子版ISSN：2320-9801
出版年度：2015
卷号：3
期号：11
DOI：10.15680/IJIRCCE.2015.0311019
出版社：S&S Publications
摘要：This paper formulates a retardant for production arrange as k- most demanding product (k-MDP). Givena group of consumers demanding a particular variety of product with multiple options, a group of current product of theclass, a group of candidate product that company is capable to supply, and a positive number k, it helps the corporate topick out k product from the candidate product such the expected variety of the whole customers for the k product ismaximized. One greedy algorithmic rule is implement to look inexact resolution for the difficulty conferred during thispaper is NP-hard once the amount of standards explains or options is three or quite three. To seek out general resolutionfor this issue, Apriori-Based (APR) algorithmic rule and boundary Pruning (UBP) algorithmic rule area unit projected.Boundary of expected figures of total customers is additionally enforced to seek out optimum resolution of the matter.Additionally to it, for computing least demanding product, AN algorithmic rule is projected to look the k-leastdemanding product. This may even be useful to production plans.
