Optimal Semi-online Scheduling Algorithms on a Small Number of Machines

DOI10.1007/978-3-540-74450-4_45MaRDI QIDQ3611938zbMATH OpenOpenAlexFDO

Authors Yong Wu, Zhiyi Tan, Qifan Yang

Publication date 3 March 2009

Published in Combinatorics, Algorithms, Probabilistic and Experimental Methodologies (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-74450-4_45

Mathematics Subject Classification ID

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

Recommendations

• Semi-online scheduling problems on a small number of machines
• Optimal semi-online algorithms for machine covering
• Semi-online algorithms for parallel machine scheduling problems
• A semi-online scheduling problem with the combined partial information on two identical machines with non-simultaneous machine available times
• Several semi-online scheduling problems on two identical machines with combined information

Cited in

(18)

• Extension of algorithm list scheduling for a semi-online scheduling problem
• Semi-online scheduling with machine cost.
• A survey on makespan minimization in semi-online environments
• Semi-online algorithms for parallel machine scheduling problems
• A note on on-line scheduling with partial information
• Optimal semi-online algorithms for scheduling problems with reassignment on two identical machines
• Optimal semi-online algorithms for preemptive scheduling problems with inexact partial information
• Semi-online scheduling jobs with tightly-grouped processing times on three identical machines
• Semi-online scheduling: a survey
• A semi-online scheduling problem with the combined partial information on two identical machines with non-simultaneous machine available times
• Almost sure asymptotic optimality for online routing and machine scheduling problems
• Semi-online scheduling algorithm under the \(l_p\) norm on two identical machines
• Optimal Semi-online Algorithms for Scheduling with Machine Activation Cost
• Randomized on-line and semi-on-line scheduling on identical machines
• Semi-online scheduling problems on a small number of machines
• A semi on-line algorithm for the partition problem
• OPTIMAL SEMI-ONLINE ALGORITHMS FOR m-BATCH-MACHINE FLOW SHOP SCHEDULING
• A semi-online algorithm and its competitive analysis for a single machine scheduling problem with bounded processing times

This page was built for publication: Optimal Semi-online Scheduling Algorithms on a Small Number of Machines

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