Online scheduling with linear deteriorating jobs to minimize the total weighted completion time
From MaRDI portal
Publication:668523
DOI10.1016/j.amc.2015.10.058zbMath1410.90091OpenAlexW2174588756MaRDI QIDQ668523
Ran Ma, Jiping Tao, Jinjiang Yuan
Publication date: 19 March 2019
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2015.10.058
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Online algorithms; streaming algorithms (68W27)
Related Items
Online scheduling to minimize maximum weighted flow-time on a bounded parallel-batch machine, Online scheduling on bounded batch machines to minimize the maximum weighted completion time, Online scheduling to minimize the total weighted completion time plus the rejection cost, Single-machine scheduling of proportional-linearly deteriorating jobs with positional due indices, A Production Plan Considering Parallel Machines and Deteriorating Effects: Minimizing the Makespan in the Section of Steel Box Girder Processing, A best possible algorithm for an online scheduling problem with deteriorating effect in steel box girder section production, An improved 2.11-competitive algorithm for online scheduling on parallel machines to minimize total weighted completion time, Online appointment scheduling for a nuclear medicine department in a Chinese hospital, A review of four decades of time-dependent scheduling: main results, new topics, and open problems, An Optimal Online Algorithm for Scheduling with Learning Consideration, A Semi-Online Algorithm for Single Machine Scheduling with Rejection
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A better online algorithm for the parallel machine scheduling to minimize the total weighted completion time
- Online scheduling of simple linear deteriorating jobs to minimize the total general completion time
- Optimal algorithms for online single machine scheduling with deteriorating jobs
- A single-machine scheduling with a truncated linear deterioration and ready times
- Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan
- Single-machine scheduling with deteriorating functions for job processing times
- Single machine group scheduling with time dependent processing times and ready times
- A note on ``An optimal online algorithm for single machine scheduling to minimize total general completion time
- Time-dependent scheduling
- A semi-online algorithm and its competitive analysis for a single machine scheduling problem with bounded processing times
- An optimal semi-online algorithm for a single machine scheduling problem with bounded processing time
- On-line scheduling of parallel machines to minimize total completion times
- Minimizing average completion time in the presence of release dates
- Scheduling jobs under simple linear deterioration
- A concise survey of scheduling with time-dependent processing times
- Complexity and approximability of scheduling resumable proportionally deteriorating jobs
- Online scheduling to minimize the total weighted completion time plus the rejection cost
- Online scheduling on a single machine with rejection under an agreeable condition to minimize the total completion time plus the total rejection cost
- Single-machine scheduling with deteriorating jobs under a series-parallel graph constraint
- Minimizing the makespan with late start penalties added to processing times in a single facility scheduling problem
- Single Machine Scheduling with Release Dates
- 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
- Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms
- Flow shop scheduling problems with deteriorating jobs under dominating machines
- Online Scheduling of a Single Machine to Minimize Total Weighted Completion Time
