Online algorithms for scheduling with machine activation cost on two uniform machines

DOI10.1631/jzus.2007.A0127zbMath1119.68315MaRDI QIDQ886402

Juejiang Hu, Shuguang Han, Yiwei Jiang

Publication date: 27 June 2007

Published in: Journal of Zhejiang University. Science A (Search for Journal in Brave)

zbMATH Keywords

competitive analysisonline algorithmmachine activation costuniform machine scheduling

Mathematics Subject Classification ID

Network protocols (68M12)

Related Items

Inefficiency analysis of the scheduling game on limited identical machines with activation costs, Online Scheduling with Machine Cost and a Quadratic Objective Function, Scheduling games on uniform machines with activation cost

Cites Work

• Unnamed Item
• Flowshop scheduling with identical jobs and uniform parallel machines
• Preemptive online algorithms for scheduling with machine cost
• Optimal online algorithm for scheduling on two identical machines with machine availability constraints.
• A lower bound for on-line scheduling on uniformly related machines
• Parallel machine selection and job scheduling to minimize machine cost and job tardiness
• ONLINE ALGORITHMS FOR SCHEDULING WITH MACHINE ACTIVATION COST
• Bounds for List Schedules on Uniform Processors
• On-line routing of virtual circuits with applications to load balancing and machine scheduling
• Better Online Algorithms for Scheduling with Machine Cost
• On-line load balancing for related machines
• Randomized on-line scheduling on two uniform machines
• An optimal online algorithm for scheduling two machines with release times