Online scheduling on a single machine with linear deteriorating processing times and delivery times

This paper considers a class of problems with linear deteriorating jobs. Jobs are released over time and become known to the online scheduler until their release times. Jobs are with deteriorating processing times or deteriorating delivery times. The objective is to minimize the time by which all jo...

Full description

Saved in:
Bibliographic Details
Published in:Journal of combinatorial optimization 2022-10, Vol.44 (3), p.1900-1912
Main Authors: Chai, Xing, Li, Wenhua, Yuan, Hang, Wang, Libo
Format: Article
Language:English
Subjects:
Algorithms
Combinatorics
Computer aided scheduling
Convex and Discrete Geometry
Deterioration
Mathematical Modeling and Industrial Mathematics
Mathematics
Mathematics and Statistics
Operations Research/Decision Theory
Optimization
Theory of Computation
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper considers a class of problems with linear deteriorating jobs. Jobs are released over time and become known to the online scheduler until their release times. Jobs are with deteriorating processing times or deteriorating delivery times. The objective is to minimize the time by which all jobs are delivered. We consider five different models on a single machine, and present an optimal online algorithm in competitiveness for each model, respectively.
ISSN:1382-6905
1573-2886
DOI:10.1007/s10878-020-00557-5