Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints

Cited In (96)

Scheduling problems with partially ordered jobs
Can transitive orientation make sandwich problems easier?
Approximating Single Machine Scheduling with Scenarios
The complexity of machine scheduling for stability with a single disrupted job
N-free posets as generalizations of series-parallel posets
Parallel recognition and decomposition of two terminal series parallel graphs
Scheduling with bully selfish jobs
Scheduling stochastic jobs with due dates on parallel machines
Single-machine scheduling with deteriorating jobs under a series-parallel graph constraint
Concurrency and atomicity
Adamant digraphs
File space utilization in database conversion
On strictly optimal schedules for the cumulative cost-optimal scheduling problem
On the measurement of complexity in activity networks
A survey on how the structure of precedence constraints may change the complexity class of scheduling problems
Title not available (Why is that?)
Bounds on the performance of a heuristic to schedule precedence-related jobs on parallel machines
The poset scheduling problem
Precedence constrained scheduling to minimize sum of weighted completion times on a single machine
Base polytopes of series-parallel posets: Linear description and optimization
Scheduling with release dates on a single machine to minimize total weighted completion time
`Strong'-`weak' precedence in scheduling: extensions to series-parallel orders
Job lateness in a two-machine flowshop with setup times separated
On the single machine serial batching scheduling problem to minimize total completion time with precedence constraints, release dates and identical processing times.
Sequencing with general precedence constraints
Polynomial Time Approximation Schemes for the Traveling Repairman and Other Minimum Latency Problems
A 2-OPT procedure to reduce total inspection time in a serial inspection process
Exact algorithms for single-machine scheduling with time windows and precedence constraints
Optimal ordering of independent tests with precedence constraints
Improving local search heuristics for some scheduling problems. II
Lower bounds and algorithms for flowtime minimization on a single machine with set-up times
Optimal restricted due date assignment in scheduling
\(P_ 4\)-trees and substitution decomposition
Genetic algorithm based scheduling of parallel batch machines with incompatible job families to minimize total weighted tardiness
NP-Complete operations research problems and approximation algorithms
Scheduling to minimize total weighted completion time: performance guarantees of LP-based heuristics and lower bounds
How to make OR-results available: A proposal for project scheduling
On the approximability of average completion time scheduling under precedence constraints.
Scheduling results applicable to decision-theoretic troubleshooting
A decomposition theory based on a dominance relation and composite jobs
Scheduling chain-structured tasks to minimize makespan and mean flow time
Complexity results for scheduling chains on a single machine
Improving local search heuristics for some scheduling problems. I
Single machine scheduling models with deterioration and learning: Handling precedence constraints via priority generation
A 2-approximation algorithm for interval data minmax regret sequencing problems with the total flow time criterion
Scheduling identical parallel machines to minimize total weighted completion time
Single-machine scheduling with precedence constraints and position-dependent processing times
The bandwidth problem for graphs and matrices—a survey
A structure theory for ordered sets
Scheduling of parallel machines to minimize total completion time subject to s-precedence constraints
Single machine precedence constrained scheduling is a Vertex cover problem
Scheduling UET-UCT series-parallel graphs on two processors
A Note on Stochastic Scheduling on a Single Machine Subject to Breakdown and Repair
Task scheduling with precedence constraints to minimize the total completion time
Approximability of single machine scheduling with fixed jobs to minimize total completion time
The permutahedron of series-parallel posets
Extensions of Decision-Theoretic Troubleshooting: Cost Clusters and Precedence Constraints
Facets of the generalized permutahedron of a poset
Nonpreemptive flowshop scheduling with machine dominance
Optimal ordering of statistically dependent tests
A half-integral linear programming relaxation for scheduling precedence-constrained jobs on a single machine
Single machine scheduling with decreasing linear deterioration under precedence constraints
An exact algorithm for the precedence-constrained single-machine scheduling problem
On the complexity of scheduling unit-time jobs with or-precedence constraints
On some complexity properties of N-free posets and posets with bounded decomposition diameter
A compact labelling scheme for series-parallel graphs
Single machine scheduling with precedence constraints and positionally dependent processing times
Decision diagrams for solving a job scheduling problem under precedence constraints
On the Complexity of Scheduling to Optimize Average Response Time
A General Framework for Approximating Min Sum Ordering Problems
Cross-series-parallel digraphs
Time-critical testing and search problems
Single-machine scheduling with supporting tasks
An improved algorithm for parallel machine scheduling under additional resource constraints
Precedence theorems and dynamic programming for the single-machine weighted tardiness problem
Single-machine scheduling with an external resource
Two scheduling problems in group technology with deteriorating jobs
Approximating weighted completion time for order scheduling with setup times
An NC algorithm for finding a minimum weighted completion time schedule on series parallel graphs
Confluence up to garbage
Confluence up to garbage in graph transformation
A review of four decades of time-dependent scheduling: main results, new topics, and open problems
Online Linear Optimization for Job Scheduling Under Precedence Constraints
Polyhedral results for position-based scheduling of chains on a single machine
Single-machine scheduling problems with precedence constraints and simple linear deterioration
Vertex cover in graphs with locally few colors
Dynamic expression trees
Setting due dates to minimize the total weighted possibilistic mean value of the weighted earliness-tardiness costs on a single machine
Hardness of flow time minimization in a crossdock with a single door and asymmetric handover relations
\(N\)-extendible posets, and how to minimize total weighted completion time
Integrated optimization of test case selection and sequencing for reliability testing of the mainboard of Internet backbone routers
Single machine scheduling with a generalized job-dependent cumulative effect
Miscellaneous digraph classes
A branch and bound algorithm for the minimum storage-time sequencing problem
LAD models, trees, and an analog of the fundamental theorem of arithmetic
On Submodular Search and Machine Scheduling

This page was built for publication: Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4151722)