Preemptive repayment policy for multiple loans

Chi To Ng; Q. Ding; Edwin Tai Chiu Cheng; S. S. Lam

doi:10.1007/s10479-011-0872-9

Preemptive repayment policy for multiple loans

Chi To Ng, Q. Ding, Edwin Tai Chiu Cheng, S. S. Lam

Research output: Journal article publication › Journal article › Academic research › peer-review

3 Citations (Scopus)

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	https://doi.org/10.1007/s10479-011-0872-9
Publication status	Published - 1 Jan 2012

Keywords

Cash flow
Interest rate
Makespan
Multiple loan repayment
Preemptive scheduling

ASJC Scopus subject areas

Management Science and Operations Research
General Decision Sciences

More information

10.1007/s10479-011-0872-9

Cite this

@article{1e8fdb36be01470d9660ed34650d4d66,

title = "Preemptive repayment policy for multiple loans",

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

keywords = "Cash flow, Interest rate, Makespan, Multiple loan repayment, Preemptive scheduling",

author = "Ng, {Chi To} and Q. Ding and Cheng, {Edwin Tai Chiu} and Lam, {S. S.}",

year = "2012",

month = jan,

day = "1",

doi = "10.1007/s10479-011-0872-9",

language = "English",

volume = "192",

pages = "141--150",

journal = "Annals of Operations Research",

issn = "0254-5330",

publisher = "Springer Netherlands",

number = "1",

}

TY - JOUR

T1 - Preemptive repayment policy for multiple loans

AU - Ng, Chi To

AU - Ding, Q.

AU - Cheng, Edwin Tai Chiu

AU - Lam, S. S.

PY - 2012/1/1

Y1 - 2012/1/1

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

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

KW - Cash flow

KW - Interest rate

KW - Makespan

KW - Multiple loan repayment

KW - Preemptive scheduling

UR - http://www.scopus.com/inward/record.url?scp=82955236146&partnerID=8YFLogxK

U2 - 10.1007/s10479-011-0872-9

DO - 10.1007/s10479-011-0872-9

M3 - Journal article

SN - 0254-5330

VL - 192

SP - 141

EP - 150

JO - Annals of Operations Research

JF - Annals of Operations Research

IS - 1

ER -

Preemptive repayment policy for multiple loans

Abstract

Keywords

ASJC Scopus subject areas

More information

Other files and links

Fingerprint

Cite this