On-line Scheduling with a Monotonous Subsequence Constraint

DOI10.1007/978-3-319-59605-1_17MaRDI QIDQ4632214zbMATH OpenOpenAlexFDO

Authors Kelin Luo, Wei Luo, Yinfeng Xu, Huili Zhang

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

competitive analysismonotonous subsequenceonline algorithmscheduling

Mathematics Subject Classification ID

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

Recommendations

• On-line scheduling with monotone subsequence constraints
• Online Scheduling with Increasing Subsequence Serving Constraint
• On-line scheduling with non-crossing constraints
• scientific article; zbMATH DE number 1617256
• On-line scheduling with precedence constraints
• On-line scheduling revisited
• On an on-line scheduling problem for parallel jobs
• On-line scheduling with hard deadlines
• Online Scheduling of Precedence Constrained Tasks
• A better lower bound for on-line scheduling

Cites work

• A new approach to online scheduling: approximating the optimal competitive ratio
• An algorithm for solving the longest increasing circular subsequence problem
• Competitive analysis of preemptive single-machine scheduling
• scientific article; zbMATH DE number 1232130 (Why is no real title available?)
• Longest increasing subsequences in sliding windows
• On computing the length of longest increasing subsequences
• 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
• The surprising mathematics of longest increasing subsequences
• Tight bounds for permutation flow shop scheduling

Cited in

(3)

• On-line scheduling with monotone subsequence constraints
• Online scheduling with increasing subsequence serving constraint
• On-line scheduling with non-crossing constraints

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4632214)