On the Approximability of Average Completion Time Scheduling Under Precedence Constraints

Lecture Notes in Computer Science - Germany
doi 10.1007/3-540-48224-5_72
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

On the Approximability of Average Completion Time Scheduling Under Precedence Constraints

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2003English

Approximability of Average Completion Time Scheduling on Unrelated Machines

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
English

Two-Machine Scheduling Under Arbitrary Precedence Constraints

Journal of the Operations Research Society of Japan
Management ScienceDecision SciencesOperations Research
1977English

Non-Preemptive Scheduling of Real-Time Tasks Under Precedence and Resource Constraints

Information Technology Journal
2003English

On Stochastic Scheduling With In-Tree Precedence Constraints

SIAM Journal on Computing
MathematicsComputer Science
1987English

Three-Machine Scheduling Problem With Precedence Constraints

Journal of the Operations Research Society of Japan
Management ScienceDecision SciencesOperations Research
1977English

Energy-Aware Stochastic Scheduling Model With Precedence Constraints on DVFS-enabled Processors

Turkish Journal of Electrical Engineering and Computer Sciences
Electronic EngineeringElectricalComputer Science
2016English

Approximability of Two-Machine No-Wait Flowshop Scheduling With Availability Constraints

Operations Research Letters
IndustrialApplied MathematicsManufacturing EngineeringManagement ScienceOperations ResearchSoftware
2003English

Scheduling Under Unavailability Constraints to Minimize Flow-Time Criteria

2007English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy