Algorithmic Approaches to Setup Minimization
From MaRDI portal
Publication:3694689
DOI10.1137/0214068zbMath0575.68046OpenAlexW2042523737MaRDI QIDQ3694689
Ulrich Faigle, Gerhard Gierz, Rainer Schrader
Publication date: 1985
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0214068
schedulinggreedy algorithmNP-complete problemspartially ordered setsN-free ordered setsseries-parallel connections
Analysis of algorithms and problem complexity (68Q25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items
Interval orders without odd crowns are defect optimal ⋮ A linear time algorithm to find the jump number of 2-dimensional bipartite partial orders ⋮ Parallel \(N\)-free order recognition ⋮ A 3/2-approximation algorithm for the jump number of interval orders ⋮ NP-completeness properties about linear extensions ⋮ Jump number problem: The role of matroids ⋮ A setup heuristic for interval orders ⋮ The jump number and the lattice of maximal antichains ⋮ An algorithm for minimizing setups in precedence constrained scheduling
