Pages that link to "Item:Q4060706"

The following pages link to Decomposition Algorithms for Single-Machine Sequencing with Precedence Relations and Deferral Costs (Q4060706):

Displaying 30 items.

• Single-machine scheduling with precedence constraints and position-dependent processing times (Q350351) (← links)
• `Strong'-`weak' precedence in scheduling: extensions to series-parallel orders (Q602755) (← links)
• On the convexity of precedence sequencing games (Q816513) (← links)
• A 2-OPT procedure to reduce total inspection time in a serial inspection process (Q877228) (← links)
• Partially ordered knapsack and applications to scheduling (Q881568) (← links)
• Scheduling of parallel machines to minimize total completion time subject to s-precedence constraints (Q955602) (← links)
• Single machine scheduling with decreasing linear deterioration under precedence constraints (Q980093) (← links)
• Single machine precedence constrained scheduling is a Vertex cover problem (Q1016523) (← links)
• A decomposition of distributive lattices (Q1057293) (← links)
• On some complexity properties of N-free posets and posets with bounded decomposition diameter (Q1086264) (← links)
• File space utilization in database conversion (Q1108069) (← links)
• Sequencing with general precedence constraints (Q1142151) (← links)
• On the measurement of complexity in activity networks (Q1145062) (← links)
• \(P_ 4\)-trees and substitution decomposition (Q1201812) (← links)
• On batch scheduling of jobs with stochastic service times and cost structures on a single server (Q1227237) (← links)
• On strictly optimal schedules for the cumulative cost-optimal scheduling problem (Q1258252) (← links)
• Base polytopes of series-parallel posets: Linear description and optimization (Q1290639) (← links)
• On the approximability of average completion time scheduling under precedence constraints. (Q1408829) (← links)
• A survey on how the structure of precedence constraints may change the complexity class of scheduling problems (Q1617290) (← links)
• Single machine scheduling with precedence constraints and positionally dependent processing times (Q1762097) (← links)
• A decomposition theory based on a dominance relation and composite jobs (Q1820683) (← links)
• Ranking the vertices of a complete multipartite paired comparison digraph (Q1923602) (← links)
• An NC algorithm for finding a minimum weighted completion time schedule on series parallel graphs (Q1924401) (← links)
• Precedence constrained scheduling to minimize sum of weighted completion times on a single machine (Q1961232) (← links)
• \(N\)-extendible posets, and how to minimize total weighted completion time (Q1962041) (← links)
• Precedence theorems and dynamic programming for the single-machine weighted tardiness problem (Q1991104) (← links)
• Exact and Approximation Algorithms for the Expanding Search Problem (Q5084651) (← links)
• A General Framework for Approximating Min Sum Ordering Problems (Q5087715) (← links)
• On Submodular Search and Machine Scheduling (Q5108249) (← links)
• Solving Zero-Sum Games Using Best-Response Oracles with Applications to Search Games (Q5126630) (← links)