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 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|