Pages that link to "Item:Q4151722"

The following pages link to Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints (Q4151722):

Displaying 50 items.

• Exact algorithms for single-machine scheduling with time windows and precedence constraints (Q310349) (← links)
• Optimal restricted due date assignment in scheduling (Q322834) (← links)
• Single-machine scheduling with precedence constraints and position-dependent processing times (Q350351) (← links)
• Scheduling results applicable to decision-theoretic troubleshooting (Q473374) (← links)
• `Strong'-`weak' precedence in scheduling: extensions to series-parallel orders (Q602755) (← links)
• Scheduling problems with partially ordered jobs (Q612206) (← links)
• Scheduling with bully selfish jobs (Q692928) (← links)
• Optimal ordering of independent tests with precedence constraints (Q741731) (← links)
• Scheduling stochastic jobs with due dates on parallel machines (Q750283) (← links)
• On the complexity of scheduling unit-time jobs with or-precedence constraints (Q813963) (← links)
• Single machine scheduling models with deterioration and learning: Handling precedence constraints via priority generation (Q835616) (← links)
• Approximability of single machine scheduling with fixed jobs to minimize total completion time (Q857360) (← links)
• A 2-OPT procedure to reduce total inspection time in a serial inspection process (Q877228) (← links)
• A 2-approximation algorithm for interval data minmax regret sequencing problems with the total flow time criterion (Q943795) (← 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)
• The poset scheduling problem (Q1062616) (← links)
• A compact labelling scheme for series-parallel graphs (Q1079115) (← links)
• On some complexity properties of N-free posets and posets with bounded decomposition diameter (Q1086264) (← links)
• N-free posets as generalizations of series-parallel posets (Q1097286) (← links)
• Parallel recognition and decomposition of two terminal series parallel graphs (Q1098313) (← links)
• Adamant digraphs (Q1104933) (← links)
• File space utilization in database conversion (Q1108069) (← links)
• Concurrency and atomicity (Q1124366) (← links)
• Sequencing with general precedence constraints (Q1142151) (← links)
• Complexity results for scheduling chains on a single machine (Q1142687) (← links)
• On the measurement of complexity in activity networks (Q1145062) (← links)
• A structure theory for ordered sets (Q1151913) (← links)
• Job lateness in a two-machine flowshop with setup times separated (Q1184446) (← links)
• Scheduling with release dates on a single machine to minimize total weighted completion time (Q1193720) (← links)
• \(P_ 4\)-trees and substitution decomposition (Q1201812) (← 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)
• Scheduling identical parallel machines to minimize total weighted completion time (Q1317043) (← links)
• Dynamic expression trees (Q1346771) (← links)
• Scheduling UET-UCT series-parallel graphs on two processors (Q1365936) (← links)
• On the approximability of average completion time scheduling under precedence constraints. (Q1408829) (← links)
• On the single machine serial batching scheduling problem to minimize total completion time with precedence constraints, release dates and identical processing times. (Q1413926) (← links)
• Nonpreemptive flowshop scheduling with machine dominance (Q1604067) (← links)
• A survey on how the structure of precedence constraints may change the complexity class of scheduling problems (Q1617290) (← links)
• Single machine scheduling with a generalized job-dependent cumulative effect (Q1702657) (← links)
• Single-machine scheduling with supporting tasks (Q1751119) (← links)
• Single machine scheduling with precedence constraints and positionally dependent processing times (Q1762097) (← links)
• Scheduling chain-structured tasks to minimize makespan and mean flow time (Q1814098) (← links)
• A decomposition theory based on a dominance relation and composite jobs (Q1820683) (← links)
• How to make OR-results available: A proposal for project scheduling (Q1897419) (← links)
• Improving local search heuristics for some scheduling problems. I (Q1917263) (← links)
• An NC algorithm for finding a minimum weighted completion time schedule on series parallel graphs (Q1924401) (← links)
• LAD models, trees, and an analog of the fundamental theorem of arithmetic (Q1949097) (← links)