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

Xing Chai, Wenhua Li (), Hang Yuan and Libo Wang
Additional contact information
Xing Chai: Henan University of Technology
Wenhua Li: Zhengzhou University
Hang Yuan: State University of New York at Binghamton
Libo Wang: Zhengzhou University

Journal of Combinatorial Optimization, 2022, vol. 44, issue 3, No 27, 1900-1912

Abstract: Abstract 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.

Keywords: Online scheduling; Linear deteriorating jobs; Delivery time; Competitive ratio (search for similar items in EconPapers)
Date: 2022
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-020-00557-5 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:44:y:2022:i:3:d:10.1007_s10878-020-00557-5

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-020-00557-5

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().