Online scheduling on a single machine with linear deteriorating processing times and delivery times
type: Item
instance of: scholarly article
title: Online scheduling on a single machine with linear deteriorating processing times and delivery times
zbMATH Open document ID: 1502.90070
author: Xing Chai
author: Wenhua Li
author: Hang Yuan
author: Libo Wang
published in: Journal of Combinatorial Optimization
publication date: 2022-10-04T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 7595924
zbMATH Keywords: online scheduling
zbMATH Keywords: linear deteriorating jobs
zbMATH Keywords: delivery time
zbMATH Keywords: competitive ratio
MaRDI profile type: Publication
full work available at URL: s10878-020-00557-5
OpenAlex ID: W3009065144
cites work: Scheduling with time dependent processing times: Review and extensions
cites work: Q4223058
cites work: Scheduling Deteriorating Jobs on a Single Processor
cites work: A heuristic MBLS algorithm for the two semi-online parallel machine scheduling problems with deterioration jobs
cites work: A concise survey of scheduling with time-dependent processing times
cites work: Online batch scheduling on parallel machines with delivery times
cites work: A Best Possible Deterministic On-Line Algorithm for Minimizing Maximum Delivery Time on a Single Machine
cites work: Minimizing the makespan with late start penalties added to processing times in a single facility scheduling problem
cites work: Q3995531
cites work: Online unbounded batch scheduling on parallel machines with delivery times
cites work: Online scheduling on two parallel machines with release dates and delivery times
cites work: Optimal algorithms for online single machine scheduling with deteriorating jobs
cites work: Scheduling jobs under simple linear deterioration
cites work: On-line scheduling with delivery time on a single batch machine
cites work: An improved on-line algorithm for single parallel-batch machine scheduling with delivery times
cites work: Online over time scheduling on parallel-batch machines: a survey
cites work: Online scheduling of simple linear deteriorating jobs to minimize the total general completion time
cites work: A best on-line algorithm for the single machine parallel-batch scheduling with restricted delivery times
DOI: 10.1007/S10878-020-00557-5
description: scientific article; zbMATH DE number 7595924