相关参考文献
注意：仅列出部分参考文献，下载原文获取全部文献信息。Strip packing with precedence constraints and strip packing with release times
John Augustine et al.
THEORETICAL COMPUTER SCIENCE (2009)
A 3/2-approximation algorithm for scheduling independent monotonic malleable tasks
Gregory Mounie et al.
SIAM JOURNAL ON COMPUTING (2007)
An Approximation Algorithm for Scheduling Malleable Tasks under General Precedence Constraints
Klaus Jansen et al.
ACM TRANSACTIONS ON ALGORITHMS (2006)
On the complexity of adjacent resource scheduling
CW Duin et al.
JOURNAL OF SCHEDULING (2006)
Higher-dimensional packing with order constraints
Sandor P. Fekete et al.
SIAM JOURNAL ON DISCRETE MATHEMATICS (2006)
Scheduling malleable parallel tasks: An asymptotic fully polynomial time approximation scheme
K Jansen
ALGORITHMICA (2004)
Project scheduling with irregular costs: complexity, approximability, and algorithms
A Grigoriev et al.
ACTA INFORMATICA (2004)
An approximation algorithm for scheduling trees of malleable tasks
R Lepère et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2002)
Two-dimensional packing problems: A survey
A Lodi et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2002)
When does a dynamic programming formulation guarantee the existence of a fully polynomial time approximation scheme (FPTAS)?
GJ Woeginger
INFORMS JOURNAL ON COMPUTING (2000)
分享论文
