| Article ID: | iaor201113472 |
| Volume: | 192 |
| Issue: | 1 |
| Start Page Number: | 141 |
| End Page Number: | 150 |
| Publication Date: | Jan 2012 |
| Journal: | Annals of Operations Research |
| Authors: | Cheng T, Ng C, Ding Q, Lam S |
| Keywords: | combinatorial optimization, programming: nonlinear, programming: linear, scheduling |
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.