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

Cited in

(only showing first 100 items - show all)

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

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)