Optimal algorithms for online single machine scheduling with deteriorating jobs
DOI10.1016/J.TCS.2012.05.004zbMATH Open1243.68116OpenAlexW2041327540MaRDI QIDQ442286FDOQ442286
Authors: Feifeng Zheng, Shijin Wang, Jiazhen Huo, Ming Liu 
Publication date: 10 August 2012
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2012.05.004
Recommendations
- Online scheduling on a single machine with linear deteriorating processing times and delivery times
- Online scheduling on a single machine with deteriorating jobs and job delivery
- Online scheduling of simple linear deteriorating jobs to minimize the total general completion time
- An alternative proof of an optimal online algorithm for single-machine scheduling with deteriorating jobs
- Online makespan scheduling of linear deteriorating jobs on parallel machines
Online algorithms; streaming algorithms (68W27) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cites Work
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Title not available (Why is that?)
- Scheduling Parallel Machines On-Line
- Title not available (Why is that?)
- A class of on-line scheduling algorithms to minimize total completion time
- A Best Possible Deterministic On-Line Algorithm for Minimizing Maximum Delivery Time on a Single Machine
- Minimizing the total completion time on-line on a single machine, using restarts
- Scheduling linear deteriorating jobs with rejection on a single machine
- Scheduling on identical machines: How good is LPT in an on-line setting?
- A best on-line algorithm for single machine scheduling with small delivery times
- Scheduling jobs under simple linear deterioration
- Preemptive scheduling with simple linear deterioration on a single machine
- Batch scheduling of simple linear deteriorating jobs on a single machine to minimize makespan
- Title not available (Why is that?)
- PERFORMANCE ANALYSIS OF SIX APPROXIMATION ALGORITHMS FOR THE ONE-MACHINE MAXIMUM LATENESS SCHEDULING PROBLEM WITH READY TIMES
Cited In (14)
- Online scheduling on a single machine with grouped processing times
- New bounds for single-machine time-dependent scheduling with uniform deterioration
- Single-machine online scheduling of jobs with non-delayed processing constraint
- Online scheduling on a single machine with deteriorating jobs and job delivery
- An alternative proof of an optimal online algorithm for single-machine scheduling with deteriorating jobs
- A review of four decades of time-dependent scheduling: main results, new topics, and open problems
- Online scheduling for degradation data processing on a single processor
- A best possible algorithm for an online scheduling problem with deteriorating effect in steel box girder section production
- Online scheduling on a single machine with linear deteriorating processing times and delivery times
- An optimal online algorithm for single-processor scheduling problem with learning effect
- An online batch scheduling with linear deterioration effect
- Online scheduling with linear deteriorating jobs to minimize the total weighted completion time
- 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: Optimal algorithms for online single machine scheduling with deteriorating jobs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q442286)
