Scheduling jobs with varying processing times
From MaRDI portal
Publication:673617
DOI10.1016/0020-0190(95)00009-2zbMath0875.68421OpenAlexW2066570939MaRDI QIDQ673617
Stanisław Gawiejnowicz, Lidia Pankowska
Publication date: 28 February 1997
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(95)00009-2
Parallel algorithms in computer science (68W10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (16)
Scheduling algorithms for procrastinators ⋮ Single machine scheduling models with deterioration and learning: Handling precedence constraints via priority generation ⋮ A note on scheduling on a single processor with speed dependent on a number of executed jobs ⋮ A concise survey of scheduling with time-dependent processing times ⋮ Analysis of a time-dependent scheduling problem by signatures of deterioration rate sequences ⋮ Scheduling jobs with a V-shaped time-dependent processing time ⋮ Scheduling on a single processor with variable speed ⋮ Scheduling jobs with varying processing times ⋮ Single-machine scheduling with deteriorating jobs ⋮ Minimizing maximum lateness under linear deterioration ⋮ Scheduling time-dependent jobs under mixed deterioration ⋮ A closed-form solution for the optimal release times for the \(F2|\) deteriorating jobs \(|\sum w_{j}c_{j}\) problem ⋮ Optimal composition ordering problems for piecewise linear functions ⋮ A review of four decades of time-dependent scheduling: main results, new topics, and open problems ⋮ Preemptive repayment policy for multiple loans ⋮ Pareto and scalar bicriterion optimization in scheduling deteriorating jobs
Cites Work
This page was built for publication: Scheduling jobs with varying processing times
