Semi-Online Preemptive Scheduling: One Algorithm for All Variants

Theory of Computing Systems - United States
doi 10.1007/s00224-010-9287-2
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Science and Business Media LLC

Related search

LS Algorithm for Semi-Online Scheduling Jobs With Nondecreasing Release Times and Nondecreasing Processing Times

2015English

Multiprocessor Jobs, Preemptive Schedules, and One-Competitive Online Algorithms

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2015English

Online Grid Scheduling Using Ant Algorithm

International Journal of Engineering and Technology
2009English

Semi-Online Scheduling With “End of Sequence” Information

Journal of Combinatorial Optimization
ControlOptimizationCombinatoricsApplied MathematicsDiscrete MathematicsComputer Science ApplicationsMathematicsComputational Theory
2007English

A Tight 2-Approximation for Preemptive Stochastic Scheduling

Mathematics of Operations Research
Management ScienceComputer Science ApplicationsOperations ResearchMathematics
2014English

One Algorithm to Rule Them All

MRS Bulletin
Materials ScienceTheoretical ChemistryCondensed Matter PhysicsPhysical
2017English

A Genetic Algorithm for Scheduling Multimode Resource-Constrained Project Problem in the Presence of Preemptive Resources

Journal of Project Management
2019English

Semi-Preemptive Routing on Trees

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2008English

All for One and One for All

Optik & Photonik
2016English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy