On-line Scheduling with a Monotonous Subsequence Constraint

DOI10.1007/978-3-319-59605-1_17zbMath1429.90027OpenAlexW2617886826MaRDI QIDQ4632214

Wei Luo, Kelin Luo, Hui-Li Zhang, Yin-Feng Xu

Publication date: 26 April 2019

Published in: Frontiers in Algorithmics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-59605-1_17

zbMATH Keywords

schedulingcompetitive analysisonline algorithmmonotonous subsequence

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Online algorithms; streaming algorithms (68W27)

Cites Work

• Unnamed Item
• On the optimality of the \(TLS\) algorithm for solving the online-list scheduling problem with two job types on a set of multipurpose machines
• Optimal online selection of a monotone subsequence: a central limit theorem
• Competitive analysis of preemptive single-machine scheduling
• An algorithm for solving the longest increasing circular subsequence problem
• On computing the length of longest increasing subsequences
• Longest increasing subsequences in sliding windows
• The Surprising Mathematics of Longest Increasing Subsequences
• A New Approach to Online Scheduling: Approximating the Optimal Competitive Ratio
• Tight Bounds for Permutation Flow Shop Scheduling

This page was built for publication: On-line Scheduling with a Monotonous Subsequence Constraint