Decomposition Algorithms for Single-Machine Sequencing with Precedence Relations and Deferral Costs

Cited in

(46)

Single machine precedence constrained scheduling is a Vertex cover problem
A decomposition of distributive lattices
On some complexity properties of N-free posets and posets with bounded decomposition diameter
File space utilization in database conversion
Sequencing with general precedence constraints
On the measurement of complexity in activity networks
\(P_ 4\)-trees and substitution decomposition
On batch scheduling of jobs with stochastic service times and cost structures on a single server
On strictly optimal schedules for the cumulative cost-optimal scheduling problem
Base polytopes of series-parallel posets: Linear description and optimization
On the approximability of average completion time scheduling under precedence constraints.
A survey on how the structure of precedence constraints may change the complexity class of scheduling problems
Single machine scheduling with precedence constraints and positionally dependent processing times
A decomposition theory based on a dominance relation and composite jobs
Ranking the vertices of a complete multipartite paired comparison digraph
An NC algorithm for finding a minimum weighted completion time schedule on series parallel graphs
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
Precedence theorems and dynamic programming for the single-machine weighted tardiness problem
Time-critical testing and search problems
Single-machine scheduling problems with precedence constraints and simple linear deterioration
An exact algorithm for the precedence-constrained single-machine scheduling problem
Single-machine scheduling with deteriorating jobs under a series-parallel graph constraint
Asymptotically optimal schedules for single-server flow shop problems with setup costs and times
The pairwise flowtime network construction problem
Finding a maximum-weight convex set in a chordal graph
Bounds on the performance of a heuristic to schedule precedence-related jobs on parallel machines
Single-machine scheduling with precedence constraints and position-dependent processing times
Sensitivity analysis for some scheduling problems
Effective solution of certain problems of theory of schedulings of nets
Single Machine General Maximum Cost Problem with Parallel-Chain Precedence Constraints
Decomposition of Directed Graphs
A branch and bound algorithm for the minimum storage-time sequencing problem
Task scheduling with precedence constraints to minimize the total completion time
Exact and Approximation Algorithms for the Expanding Search Problem
A General Framework for Approximating Min Sum Ordering Problems
On Submodular Search and Machine Scheduling
Solving zero-sum games using best-response oracles with applications to search games
The permutahedron of series-parallel posets
`Strong'-`weak' precedence in scheduling: extensions to series-parallel orders
An allocation rule for connection scheduling problems
On the convexity of precedence sequencing games
A 2-OPT procedure to reduce total inspection time in a serial inspection process
Partially ordered knapsack and applications to scheduling
Scheduling of parallel machines to minimize total completion time subject to s-precedence constraints
Single machine scheduling with decreasing linear deterioration under precedence constraints

This page was built for publication: Decomposition Algorithms for Single-Machine Sequencing with Precedence Relations and Deferral Costs

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