Scheduling problems in a practical allocation model
From MaRDI portal
Publication:1369746
DOI10.1023/A:1009799631608zbMath0894.90078MaRDI QIDQ1369746
Lisa Hollerman, Dian Rae Lopez, Keith Vertanen, Tsan-sheng Hsu
Publication date: 17 December 1997
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
heuristicssimulationNP-hardprecedence constraintslinear-time algorithmmulti-stage interconnected parallel machine
Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)
Related Items (4)
STEADY-STATE SCHEDULING ON HETEROGENEOUS CLUSTERS ⋮ A polyhedral study on \(0\)-\(1\) knapsack problems with disjoint cardinality constraints: facet-defining inequalities by sequential lifting ⋮ Mapping pipeline skeletons onto heterogeneous platforms ⋮ Using basis dependence distance vectors in the modified Floyd-Warshall algorithm
This page was built for publication: Scheduling problems in a practical allocation model
