Optimal Sequencing by Modular Decomposition: Polynomial Algorithms
From MaRDI portal
Publication:3750504
DOI10.1287/opre.34.4.606zbMath0609.90068OpenAlexW2097544772MaRDI QIDQ3750504
Jeffrey B. Sidney, George Steiner
Publication date: 1986
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.34.4.606
Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)
Related Items (19)
A \(k\)-structure generalization of the theory of 2-structures ⋮ Single machine scheduling models with deterioration and learning: Handling precedence constraints via priority generation ⋮ A linear time algorithm to find the jump number of 2-dimensional bipartite partial orders ⋮ The discrete time-cost tradeoff problem revisited ⋮ Scheduling problems with partially ordered jobs ⋮ On Submodular Search and Machine Scheduling ⋮ Scheduling with due date assignment under special conditions on job processing ⋮ \(N\)-extendible posets, and how to minimize total weighted completion time ⋮ On the complexity of dynamic programming for sequencing problems with precedence constraints ⋮ Scheduling results applicable to decision-theoretic troubleshooting ⋮ Finding the largest suborder of fixed width ⋮ \(P_ 4\)-trees and substitution decomposition ⋮ Single machine scheduling with precedence constraints and positionally dependent processing times ⋮ Scheduling of resource tasks ⋮ Optimal procedures for the discrete time/cost trade-off problem in project networks ⋮ Modular decomposition of graphs and the distance preserving property ⋮ Job selection and sequencing on a single machine in a random environment ⋮ A Theoretical Framework for Instance Complexity of the Resource-Constrained Project Scheduling Problem ⋮ Shortest-route formulation of mixed-model assembly line balancing problem
This page was built for publication: Optimal Sequencing by Modular Decomposition: Polynomial Algorithms
