Capital flow constrained lot sizing problem with loss of goodwill and loan
Zhen Chen, Ren-qian Zhang

TL;DR
This paper introduces a novel lot sizing model incorporating capital flow constraints, goodwill loss, and loans, providing an efficient algorithm that outperforms traditional methods in large-scale deterministic single-item problems.
Contribution
It develops a mixed integer model with a new approach approximating it to a traveling salesman problem, and proposes a recursive heuristic algorithm for efficient solutions.
Findings
The algorithm achieves optimal solutions in specific cases with zero goodwill loss.
Numerical results show the algorithm is effective and faster than CPLEX for large problems.
Initial capital and loan interest significantly influence lot sizing decisions.
Abstract
We introduce capital flow constraints, loss of good will and loan to the lot sizing problem. Capital flow constraint is different from traditional capacity constraints: when a manufacturer launches production, its present capital should not be less than its present total production cost; otherwise, it must decrease production quantity or suspend production. Unsatisfied demand in one period may cause customer's demand to shrink in the next period considering loss of goodwill. Fixed loan can be adopted in the starting period for production. A mixed integer model for a deterministic single-item problem is constructed. Based on the analysis about the structure of optimal solutions, we approximate it to a traveling salesman problem, and divide it into sub-linear programming problems without integer variables. A forward recursive algorithm with heuristic adjustments is proposed to solve it.…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
