Preemptive repayment policy for multiple loans
From MaRDI portal
(Redirected from Publication:763209)
Recommendations
- Preemptive scheduling of independent jobs on parallel machines subject to financial constraints
- scientific article; zbMATH DE number 1670665
- Mathematical Foundations of Computer Science 2004
- Pre-emptive scheduling problems with controllable processing times
- Preemptive scheduling with two minimax criteria
Cites work
- A concise survey of scheduling with time-dependent processing times
- Complexity of scheduling tasks with time-dependent execution times
- scientific article; zbMATH DE number 5345854 (Why is no real title available?)
- Minimizing the makespan with late start penalties added to processing times in a single facility scheduling problem
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Scheduling Deteriorating Jobs on a Single Processor
- Scheduling deteriorating jobs to minimize makespan
- Scheduling jobs with piecewise linear decreasing processing times
- Scheduling jobs with varying processing times
- Single machine scheduling with a variable common due date and resource-dependent processing times.
- Single machine scheduling with learning effect considerations
- Single machine scheduling with start time dependent processing times: Some solvable cases
Cited in
(5)- Short communication: American student loans: repayment and valuation
- Minimizing the repayment cost of federal student loans
- Pricing and revenue management for bank home loans: a mathematical approach
- On a Flexible Loan Repayment Method Depending on Borrower’s Asset with an Early Termination Clause
- Theory and methodology of time-dependent scheduling: past, present and future
This page was built for publication: Preemptive repayment policy for multiple loans
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q763209)
