Online Scheduling with Increasing Subsequence Serving Constraint

DOI10.1007/978-3-319-39817-4_14zbMath1475.90022OpenAlexW2484617299MaRDI QIDQ4632179

Xin Feng, Kelin Luo, 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-39817-4_14

zbMATH Keywords

competitive ratioonline schedulingonline strategyincreasing subsequence

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Optimal online selection of a monotone subsequence: a central limit theorem
• Effective on-line algorithms for reliable due date quotation and large-scale 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
• Setting due dates in a stochastic single machine environment
• The Surprising Mathematics of Longest Increasing Subsequences
• Markov Decision Problems Where Means Bound Variances
• Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date
• Due date demand management: Negotiating the trade-off between price and delivery
• Tight Bounds for Permutation Flow Shop Scheduling
• Algorithms for the on-line travelling salesman