Preemptive scheduling with simple linear deterioration on a single machine

DOI10.1016/J.TCS.2010.05.032zbMath1207.68112OpenAlexW1969746719MaRDI QIDQ708208

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

zbMATH Keywords

schedulingrelease datesregular functionpreemptionlinear deterioration

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (7)

Preemptive scheduling in a two-stage supply chain to minimize the makespan ⋮ SINGLE-MACHINE SCHEDULING WITH PROPORTIONALLY DETERIORATING JOBS SUBJECT TO AVAILABILITY CONSTRAINTS ⋮ Single machine problem with multi-rate-modifying activities under a time-dependent deterioration ⋮ Online scheduling of simple linear deteriorating jobs to minimize the total general completion time ⋮ Single-machine scheduling of proportional-linearly deteriorating jobs with positional due indices ⋮ Optimal algorithms for online single machine scheduling with deteriorating jobs ⋮ An approximation algorithm based on game theory for scheduling simple linear deteriorating jobs

Cites Work

• Scheduling deteriorating jobs subject to job or machine availability constraints
• Time-dependent scheduling
• Scheduling linear deteriorating jobs to minimize makespan with an availability constraint on a single machine
• Scheduling jobs under simple linear deterioration
• Complexity analysis of job-shop scheduling with deteriorating jobs
• A concise survey of scheduling with time-dependent processing times
• How useful are preemptive schedules?
• Parallel machine scheduling with time dependent processing times
• Scheduling in a contaminated area: a model and polynomial algorithms
• Scheduling linear deteriorating jobs with an availability constraint on a single machine
• Minimizing the makespan with late start penalties added to processing times in a single facility scheduling problem
• Scheduling with time dependent processing times: Review and extensions
• Scheduling Deteriorating Jobs on a Single Processor
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Some simple scheduling algorithms
• Scheduling start time dependent jobs to minimize the total weighted completion time
• Due-date assignment and single machine scheduling with deteriorating jobs
• Multi-Machine Scheduling With Linear Deterioration
• The NP-completeness column: An ongoing guide
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Preemptive scheduling with simple linear deterioration on a single machine