Optimal algorithms for online single machine scheduling with deteriorating jobs

Authors:
Ming Liu;Feifeng Zheng;Shijin Wang;Jiazhen Huo
Affiliations:
School of Economics & Management, Tongji University, Shanghai, 200092, PR China;Glorious Sun School of Business and Management, Donghua University, Shanghai, 200051, PR China and School of Management, Xian Jiaotong University, Xian, Shaanxi, 710049, PR China;School of Economics & Management, Tongji University, Shanghai, 200092, PR China;School of Economics & Management, Tongji University, Shanghai, 200092, PR China
Venue:
Theoretical Computer Science
Year:
2012

Citing 9
Cited 0

Scheduling jobs under simple linear deterioration

Computers and Operations Research
Scheduling Parallel Machines On-line

SIAM Journal on Computing
Online computation and competitive analysis

Online computation and competitive analysis
A Best Possible Deterministic On-Line Algorithm for Minimizing Maximum Delivery Time on a Single Machine

SIAM Journal on Discrete Mathematics
Note: A best on-line algorithm for single machine scheduling with small delivery times

Theoretical Computer Science
Minimizing the total completion time on-line on a single machine, using restarts

Journal of Algorithms
Preemptive scheduling with simple linear deterioration on a single machine

Theoretical Computer Science
Scheduling on identical machines: How good is LPT in an on-line setting?

Operations Research Letters
A class of on-line scheduling algorithms to minimize total completion time

Operations Research Letters

Quantified Score

Hi-index	5.23

Visualization

Abstract

In many realistic scenarios of job processing, one job consumes a longer time to be satisfied with a later start time of processing. This phenomenon is known as job's deterioration effect. Such effect is unexplored in the context of online environment. In this paper we study online single machine scheduling for deteriorating jobs, where jobs arrive over time and become known to any online algorithm on their arrivals. The processing time of each job is a linearly increasing function of its start time. We mainly investigate three online models that minimize makespan, total completion time and maximum delivery time, respectively. For each model we present an optimal online algorithm in competitiveness.