Optimal On-Line Algorithms to Minimize Makespan on Two Machines With Resource Augmentation

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-540-24592-6_9
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Optimal Online Algorithms on Two Hierarchical Machines With Resource Augmentation

Discrete Mathematics, Algorithms and Applications
CombinatoricsDiscrete Mathematics
2012English

A Worm Optimization Algorithm to Minimize the Makespan on Unrelated Parallel Machines With Sequence-Dependent Setup Times

Annals of Operations Research
Management ScienceDecision SciencesOperations Research
2019English

Scheduling With Discretely Compressible Release Dates to Minimize Makespan

Asia-Pacific Journal of Operational Research
Management ScienceOperations Research
2010English

On-Line Reconfigurable Machines

AI Magazine
Artificial Intelligence
2013English

Optimal Time-Critical Scheduling via Resource Augmentation

Algorithmica
Applied MathematicsComputer Science ApplicationsComputer Science
2002English

Scheduling Jobs With Stochastically Ordered Processing Times on Parallel Machines to Minimize Expected Flowtime

Journal of Applied Probability
MathematicsStatisticsUncertaintyProbability
1986English

Single-Machine Scheduling With Deteriorating Jobs and Learning Effects to Minimize the Makespan

European Journal of Operational Research
Information SystemsSimulationManagement ScienceManagementComputer ScienceModelingOperations Research
2007English

Optimal On-Line Algorithms for the Uniform Machine Scheduling Problem With Ordinal Data

Information and Computation
Theoretical Computer ScienceComputational TheoryComputer Science ApplicationsInformation SystemsMathematics
2005English

Minimizing Makespan and Preemption Costs on a System of Uniform Machines

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2002English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy