Optimal preemptive online scheduling to minimize l_p norm on two processors

DOI10.3934/JIMO.2005.1.345zbMATH Open1127.90352OpenAlexW2333651175MaRDI QIDQ2386614FDOQ2386614

Authors: Xiaoyue Jiang, Donglei Du, Guochuan Zhang 

Publication date: 1 September 2005

Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/jimo.2005.1.345

Recommendations

• An Optimal On-Line Algorithm for Preemptive Scheduling on Two Uniform Machines in the ℓ p Norm
• On-line preemptive machine scheduling with \(\ell _p\) norm on two uniform machines
• Preemptive on-line scheduling for two uniform processors
• A Lower Bound for the On-Line Preemptive Machine Scheduling with ℓ p Norm
• An optimal algorithm for preemptive on-line scheduling

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Deterministic scheduling theory in operations research (90B35)

Cited In (5)

• Online Non-preemptive Scheduling in a Resource Augmentation Model based on Duality
• On-line preemptive machine scheduling with \(\ell _p\) norm on two uniform machines
• A Lower Bound for the On-Line Preemptive Machine Scheduling with ℓ p Norm
• Optimal preemptive semi-online scheduling on two uniform processors
• An Optimal On-Line Algorithm for Preemptive Scheduling on Two Uniform Machines in the ℓ p Norm

This page was built for publication: Optimal preemptive online scheduling to minimize \(l_p\) norm on two processors

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