{'fraction_non_alphanumeric': 0.013793103448275862, 'fraction_numerical': 0.0, 'mean_word_length': 5.0476190476190474, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
A Single Item Lot Sizing Problem Considering Capital Flow and Trade Credit

This paper studies the influence of capital flow and trade credit to the production planning problems. That is, when a company starts to produce a certain number of products, its present capital quantity should be no less than the total production cost, but it could delay payment using trade credit. We formulate the mathematical model of this problem and propose a polynomial recursive algorithm to solve it based on dynamic programming. Under certain conditions, the algorithm could get optimal solutions. And it could get a good feasible solution in other conditions. Numerical analysis shows that our algorithm could solve the problem in short time and the computational errors are rather small compared with optimal solutions in most situations. With a heuristic adjustment step, the computational error is even lower. It also shows that using trade credit could benefit a company’s production plan and increase the capital quantity.