Online scheduling with linear deteriorating jobs to minimize the total weighted completion time
type: Item
instance of: scholarly article
title: Online scheduling with linear deteriorating jobs to minimize the total weighted completion time
zbMATH Open document ID: 1410.90091
author: Ran Ma
author: Jiping Tao
author: Jinjiang Yuan
published in: Applied Mathematics and Computation
publication date: 2019-03-19T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 68M20
Mathematics Subject Classification ID: 68W27
zbMATH DE Number: 7037921
zbMATH Keywords: scheduling
zbMATH Keywords: online algorithms
zbMATH Keywords: total weighted completion time
zbMATH Keywords: linear deterioration
MaRDI profile type: Publication
full work available at URL: j.amc.2015.10.058
OpenAlex ID: W2174588756
cites work: Scheduling with time dependent processing times: Review and extensions
cites work: Online Scheduling of a Single Machine to Minimize Total Weighted Completion Time
cites work: Scheduling Deteriorating Jobs on a Single Processor
cites work: A concise survey of scheduling with time-dependent processing times
cites work: Single-machine scheduling with deteriorating functions for job processing times
cites work: Time-dependent scheduling
cites work: Complexity and approximability of scheduling resumable proportionally deteriorating jobs
cites work: Single machine scheduling with release dates
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms
cites work: Q4242389
cites work: Minimizing the makespan with late start penalties added to processing times in a single facility scheduling problem
cites work: Q3217922
cites work: Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan
cites work: Optimal algorithms for online single machine scheduling with deteriorating jobs
cites work: On-line scheduling of parallel machines to minimize total completion times
cites work: Online scheduling on a single machine with rejection under an agreeable condition to minimize the total completion time plus the total rejection cost
cites work: Online scheduling to minimize the total weighted completion time plus the rejection cost
cites work: Scheduling jobs under simple linear deterioration
cites work: Minimizing average completion time in the presence of release dates
cites work: A better online algorithm for the parallel machine scheduling to minimize the total weighted completion time
cites work: An optimal semi-online algorithm for a single machine scheduling problem with bounded processing time
cites work: A semi-online algorithm and its competitive analysis for a single machine scheduling problem with bounded processing times
cites work: Q4368485
cites work: Flow shop scheduling problems with deteriorating jobs under dominating machines
cites work: Single-machine scheduling with deteriorating jobs under a series-parallel graph constraint
cites work: Single machine group scheduling with time dependent processing times and ready times
cites work: A single-machine scheduling with a truncated linear deterioration and ready times
cites work: A note on ``An optimal online algorithm for single machine scheduling to minimize total general completion time''
cites work: Online scheduling of simple linear deteriorating jobs to minimize the total general completion time
DOI: 10.1016/J.AMC.2015.10.058
description: scientific article; zbMATH DE number 7037921