Preemptive Scheduling Policy for Multiple Loan Repayment

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...

Full description

Saved in:
Bibliographic Details
Main Authors: Ng, C. T., DING, Qing, Cheng, T. C. E., Lam, Franklin
Format: text
Language:English
Published: Institutional Knowledge at Singapore Management University 2012
Subjects:
Preemptive scheduling – Makespan – Multiple loan repayment – Interest rate – Cash flow
Business Administration, Management, and Operations
Online Access:https://ink.library.smu.edu.sg/lkcsb_research/3179
https://doi.org/10.1007/s10479-011-0872-9
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Singapore Management University
Language: English
Description
Summary: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.

Similar Items