نوع مقاله : پژوهشی
تازه های تحقیق
عنوان مقاله English
نویسندگان English
This study investigates a capacitated lot sizing problem for a perishable single item considering a 1-breakpoint all-units quantity discount and resale possibility. It is assumed that the lead time is zero, backlogging is not permitted, and the quality of items remains constant during their ages. Because of discount base incentives, the firm may decide to order a quantity more than what is needed during the lifetime of the order, to use the discount. In this case, the firm resells surplus items at a lower price at the ordering period. To deal with this problem, first, a mathematical model is presented. Second, some properties of the optimal solution are proved. Then, these properties are exploited in an implicit enumeration exact algorithm that solves the problem in O(T4) time complexity. Finally, the efficiency of the proposed algorithm is examined by developing an experimental design with various environments. Based on the observed runtimes, the proposed exact algorithm is found to outperform the CPLEX solver in solving the mathematical model.
کلیدواژهها English
