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...
Saved in:
| Main Authors: | , , , |
|---|---|
| 格式: | text |
| 語言: | English |
| 出版: |
Institutional Knowledge at Singapore Management University
2012
|
| 主題: | |
| 在線閱讀: | https://ink.library.smu.edu.sg/lkcsb_research/3179 https://doi.org/10.1007/s10479-011-0872-9 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| 機構: | Singapore Management University |
| 語言: | English |
| id |
sg-smu-ink.lkcsb_research-4178 |
|---|---|
| record_format |
dspace |
| spelling |
sg-smu-ink.lkcsb_research-41782012-02-14T10:19:02Z Preemptive Scheduling Policy for Multiple Loan Repayment Ng, C. T. DING, Qing Cheng, T. C. E. Lam, Franklin 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. 2012-01-01T08:00:00Z text https://ink.library.smu.edu.sg/lkcsb_research/3179 info:doi/10.1007/s10479-011-0872-9 https://doi.org/10.1007/s10479-011-0872-9 Research Collection Lee Kong Chian School Of Business eng Institutional Knowledge at Singapore Management University Preemptive scheduling – Makespan – Multiple loan repayment – Interest rate – Cash flow Business Administration, Management, and Operations |
| institution |
Singapore Management University |
| building |
SMU Libraries |
| continent |
Asia |
| country |
Singapore Singapore |
| content_provider |
SMU Libraries |
| collection |
InK@SMU |
| language |
English |
| topic |
Preemptive scheduling – Makespan – Multiple loan repayment – Interest rate – Cash flow Business Administration, Management, and Operations |
| spellingShingle |
Preemptive scheduling – Makespan – Multiple loan repayment – Interest rate – Cash flow Business Administration, Management, and Operations Ng, C. T. DING, Qing Cheng, T. C. E. Lam, Franklin Preemptive Scheduling Policy for Multiple Loan Repayment |
| description |
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. |
| format |
text |
| author |
Ng, C. T. DING, Qing Cheng, T. C. E. Lam, Franklin |
| author_facet |
Ng, C. T. DING, Qing Cheng, T. C. E. Lam, Franklin |
| author_sort |
Ng, C. T. |
| title |
Preemptive Scheduling Policy for Multiple Loan Repayment |
| title_short |
Preemptive Scheduling Policy for Multiple Loan Repayment |
| title_full |
Preemptive Scheduling Policy for Multiple Loan Repayment |
| title_fullStr |
Preemptive Scheduling Policy for Multiple Loan Repayment |
| title_full_unstemmed |
Preemptive Scheduling Policy for Multiple Loan Repayment |
| title_sort |
preemptive scheduling policy for multiple loan repayment |
| publisher |
Institutional Knowledge at Singapore Management University |
| publishDate |
2012 |
| url |
https://ink.library.smu.edu.sg/lkcsb_research/3179 https://doi.org/10.1007/s10479-011-0872-9 |
| _version_ |
1770571137970864128 |