Preemptive Scheduling Policy for Multiple Loan Repayment
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.
Preemptive scheduling – Makespan – Multiple loan repayment – Interest rate – Cash flow
Business Administration, Management, and Operations
Annals of Operations Research
Ng, C. T.; DING, Qing; Cheng, T. C. E.; and Lam, Franklin.
Preemptive Scheduling Policy for Multiple Loan Repayment. (2012). Annals of Operations Research. 192, (1), 141-150. Research Collection Lee Kong Chian School Of Business.
Available at: http://ink.library.smu.edu.sg/lkcsb_research/3179