Abstract
We study the multi-loan-repayment problem by formulating it as a single-machine scheduling problem with preemptive and time-dependent processing times to minimize the makespan. We transform the scheduling problem into a continuous non-linear optimization problem and obtain an approximate solution by solving a series of the corresponding linear programming problems. We also identify agreeable conditions for the problem and discuss the computational complexity of the problem.
| Original language | English |
|---|---|
| Pages (from-to) | 141-150 |
| Number of pages | 10 |
| Journal | Annals of Operations Research |
| Volume | 192 |
| Issue number | 1 |
| DOIs | |
| Publication status | Published - Jan 2012 |
Keywords
- Cash flow
- Interest rate
- Makespan
- Multiple loan repayment
- Preemptive scheduling