Preemptive scheduling with simple linear deterioration on a single machine
From MaRDI portal
Publication:708208
DOI10.1016/J.TCS.2010.05.032zbMATH Open1207.68112OpenAlexW1969746719MaRDI QIDQ708208FDOQ708208
Authors: D. Kharzeev 
Publication date: 11 October 2010
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2010.05.032
Recommendations
- Single-machine scheduling problems with precedence constraints and simple linear deterioration
- Scheduling jobs under simple linear deterioration
- Single-machine scheduling with deteriorating jobs
- scientific article; zbMATH DE number 2100940
- Online scheduling of simple linear deteriorating jobs to minimize the total general completion time
Cites Work
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Title not available (Why is that?)
- How useful are preemptive schedules?
- Time-dependent scheduling
- Title not available (Why is that?)
- Scheduling Deteriorating Jobs on a Single Processor
- Some simple scheduling algorithms
- Due-date assignment and single machine scheduling with deteriorating jobs
- A concise survey of scheduling with time-dependent processing times
- Scheduling with time dependent processing times: Review and extensions
- Scheduling jobs under simple linear deterioration
- Minimizing the makespan with late start penalties added to processing times in a single facility scheduling problem
- Multi-Machine Scheduling With Linear Deterioration
- Parallel machine scheduling with time dependent processing times
- Scheduling deteriorating jobs subject to job or machine availability constraints
- Scheduling start time dependent jobs to minimize the total weighted completion time
- Scheduling linear deteriorating jobs to minimize makespan with an availability constraint on a single machine
- Scheduling linear deteriorating jobs with an availability constraint on a single machine
- The NP-completeness column: An ongoing guide
- Scheduling in a contaminated area: a model and polynomial algorithms
- Complexity analysis of job-shop scheduling with deteriorating jobs
- Title not available (Why is that?)
Cited In (12)
- New bounds for single-machine time-dependent scheduling with uniform deterioration
- Single-machine scheduling of proportional-linearly deteriorating jobs with positional due indices
- Scheduling linearly shortening jobs under precedence constraints
- Partial dominated schedules and minimizing the total completion time of deteriorating jobs
- Optimal algorithms for online single machine scheduling with deteriorating jobs
- Preemptive scheduling in a two-stage supply chain to minimize the makespan
- Complexity of scheduling with proportional deterioration and release dates
- Single-machine scheduling problems with precedence constraints and simple linear deterioration
- Single machine problem with multi-rate-modifying activities under a time-dependent deterioration
- Single-machine scheduling with proportionally deteriorating jobs subject to availability constraints
- Online scheduling of simple linear deteriorating jobs to minimize the total general completion time
- An approximation algorithm based on game theory for scheduling simple linear deteriorating jobs
This page was built for publication: Preemptive scheduling with simple linear deterioration on a single machine
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q708208)
