An Optimal Strategy for Online Non-uniform Length Order Scheduling

DOI10.1007/978-3-540-68880-8_31MaRDI QIDQ3511440zbMATH OpenOpenAlexFDO

Authors

Publication date 10 July 2008

Published in Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-68880-8_31

zbMATH Keywords

Competitive RatioOnline StrategyScheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• On-line production order scheduling with preemption penalties
• Optimal on-line algorithms for the uniform machine scheduling problem with ordinal data
• scientific article; zbMATH DE number 1696639
• Algorithmic Applications in Management
• Online Order Scheduling Problem with the Same Order Size on Two Identical Machines

Cites work

• A Near Optimal Scheduler for On-Demand Data Broadcasts
• Algorithmic Applications in Management
• scientific article; zbMATH DE number 1003261 (Why is no real title available?)
• scientific article; zbMATH DE number 1232130 (Why is no real title available?)
• Improved On-Line Broadcast Scheduling with Deadlines
• Minimizing flow time nonclairvoyantly
• Nonclairvoyant scheduling
• Nonclairvoyant scheduling to minimize the total flow time on single and parallel machines
• Patience is a virtue: the effect of slack on competitiveness for admission control
• Scheduling broadcasts with deadlines
• Theoretical Computer Science

Cited in

(1)

• Algorithmic Applications in Management

This page was built for publication: An Optimal Strategy for Online Non-uniform Length Order Scheduling

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