Preemptive repayment policy for multiple loans
From MaRDI portal
Publication:763209
DOI10.1007/S10479-011-0872-9zbMATH Open1233.90167OpenAlexW2034797782MaRDI QIDQ763209FDOQ763209
Authors: D. Kharzeev 
Publication date: 9 March 2012
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-011-0872-9
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
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Title not available (Why is that?)
- Complexity of scheduling tasks with time-dependent execution times
- Scheduling Deteriorating Jobs on a Single Processor
- Single machine scheduling with start time dependent processing times: Some solvable cases
- A concise survey of scheduling with time-dependent processing times
- Single machine scheduling with learning effect considerations
- Minimizing the makespan with late start penalties added to processing times in a single facility scheduling problem
- Scheduling jobs with piecewise linear decreasing processing times
- Single machine scheduling with a variable common due date and resource-dependent processing times.
- Scheduling jobs with varying processing times
- Scheduling deteriorating jobs to minimize makespan
Cited In (1)
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)
