Pages that link to "Item:Q3750504"

The following pages link to Optimal Sequencing by Modular Decomposition: Polynomial Algorithms (Q3750504):

Displaying 24 items.

• Scheduling results applicable to decision-theoretic troubleshooting (Q473374) (← links)
• Scheduling problems with partially ordered jobs (Q612206) (← links)
• Finding the largest suborder of fixed width (Q687176) (← links)
• Single machine scheduling models with deterioration and learning: Handling precedence constraints via priority generation (Q835616) (← links)
• On the complexity of dynamic programming for sequencing problems with precedence constraints (Q922284) (← links)
• A linear time algorithm to find the jump number of 2-dimensional bipartite partial orders (Q1090688) (← links)
• The discrete time-cost tradeoff problem revisited (Q1129886) (← links)
• Computing the optimal IO sequences of a protocol in polynomial time (Q1183459) (← links)
• \(P_ 4\)-trees and substitution decomposition (Q1201812) (← links)
• Optimal procedures for the discrete time/cost trade-off problem in project networks (Q1266562) (← links)
• Job selection and sequencing on a single machine in a random environment (Q1310027) (← links)
• A \(k\)-structure generalization of the theory of 2-structures (Q1334662) (← links)
• Shortest-route formulation of mixed-model assembly line balancing problem (Q1610143) (← links)
• Single machine scheduling with precedence constraints and positionally dependent processing times (Q1762097) (← links)
• Scheduling of resource tasks (Q1809809) (← links)
• \(N\)-extendible posets, and how to minimize total weighted completion time (Q1962041) (← links)
• Modular decomposition of graphs and the distance preserving property (Q2312661) (← links)
• Scheduling with due date assignment under special conditions on job processing (Q2434296) (← links)
• Optimal Consecutive-k-out-of-n:F Component Sequencing (Q3698029) (← links)
• (Q3750498) (← links)
• Optimal Sequencing Via Modular Decomposition: Characterization of Sequencing Functions (Q3760291) (← links)
• NP-completeness of some optimal sequencing problems with a given grouping of elements (Q4723552) (← links)
• On Submodular Search and Machine Scheduling (Q5108249) (← links)
• A Theoretical Framework for Instance Complexity of the Resource-Constrained Project Scheduling Problem (Q5870371) (← links)