Deadline division-based heuristic for cost optimization in workflow scheduling

DOI10.1016/j.ins.2009.01.035zbMath1176.90253OpenAlexW1973485348MaRDI QIDQ2390377

Xiao-Ping Li, Qian Wang, Yingchun Yuan, Xia Zhu

Publication date: 22 July 2009

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2009.01.035

zbMATH Keywords

directed acyclic graphheuristicworkflowgrid computingcost/time tradeoff

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic scheduling theory in operations research (90B35) Stochastic scheduling theory in operations research (90B36)

Related Items (2)

A near-optimal database allocation for reducing the average waiting time in the grid computing environment ⋮ Fault-tolerant elastic scheduling algorithm for workflow in cloud systems

Uses Software

• GRID Infoware
• GrADS
• Condor-G

Cites Work

• QoS based resource scheduling by computational economy in computational grid
• Utility-based QoS optimisation strategy for multi-criteria scheduling on the grid
• The discrete time-cost tradeoff problem revisited
• Network decomposition-based benchmark results for the discrete time-cost tradeoff problem
• Bidirectional planning: Improving priority rule-based heuristics for scheduling resource-constrained projects
• Complexity of the Discrete Time-Cost Tradeoff Problem for Project Networks
• A computational economy for grid computing and its implementation in the Nimrod-G resource broker
• Economic models for resource management and scheduling in Grid computing
• Unnamed Item
• Unnamed Item

This page was built for publication: Deadline division-based heuristic for cost optimization in workflow scheduling