Sequencing with Series-Parallel Precedence Constraints
From MaRDI portal
adjacent pairwise job interchangeefficient general algorithmleast cost fault detection problemmaximum cumulative cost problemone-machine total weighted completion time problemschedulingsequencingseries-parallel precedence constraintssubsequences of jobstotal preference orderingtwo-machine maximum completion time flow-shop problem
Cited in
(44)- A compact labelling scheme for series-parallel graphs
- Sequencing with general precedence constraints
- Approximation algorithms for single-machine sequencing with delivery times and unit batch set-up times
- On strictly optimal schedules for the cumulative cost-optimal scheduling problem
- The three-machine flow-shop problem with arbitrary precedence relations
- Stochastic scheduling and forwards induction
- Non-bottleneck machines in three-machine flow shops
- A survey on how the structure of precedence constraints may change the complexity class of scheduling problems
- Scheduling series-parallel task graphs to minimize peak memory
- Single machine scheduling with a generalized job-dependent cumulative effect
- Sequential testing of n-out-of-n systems: precedence theorems and exact methods
- Single machine scheduling with precedence constraints and positionally dependent processing times
- A decomposition theory based on a dominance relation and composite jobs
- Sequential testing of complex systems: a review
- Confluence up to garbage in graph transformation
- Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches
- Search and rescue in the face of uncertain threats
- Solutions for subset sum problems with special digraph constraints
- Time-critical testing and search problems
- A review of four decades of time-dependent scheduling: main results, new topics, and open problems
- Optimal ordering of statistically dependent tests
- The two-machine flow shop problem with arbitrary precedence relations
- Vyacheslav Tanaev: contributions to scheduling and related areas
- Minimizing the makespan in a two-machine cross-docking flow shop problem
- Miscellaneous digraph classes
- A Note on Stochastic Scheduling on a Single Machine Subject to Breakdown and Repair
- On nonpreemptive strategies in stochastic scheduling
- Scheduling modular projects on a bottleneck resource
- Scheduling results applicable to decision-theoretic troubleshooting
- Scheduling Opposing Forests
- A branch-and-bound algorithm for scheduling of new product development projects
- Exact and Approximation Algorithms for the Expanding Search Problem
- Confluence up to garbage
- On Submodular Search and Machine Scheduling
- A note on the optimality of index priority rules for search and sequencing problems
- `Strong'-`weak' precedence in scheduling: extensions to series-parallel orders
- Scheduling problems with partially ordered jobs
- On the optimal linear contraction order of tree tensor networks, and beyond
- Theory and methodology of time-dependent scheduling: past, present and future
- Sequential testing in sparse precedence networks
- Optimal ordering of independent tests with precedence constraints
- Discrete-continuous project scheduling with discounted cash inflows and various payment models -- a review of recent results
- Effective optimization methods for single-machine scheduling (survey)
- A two-machine flowshop problem with processing time-dependent buffer constraints-an application in multimedia presentations
This page was built for publication: Sequencing with Series-Parallel Precedence Constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3879034)
