Single Machine Job Sequencing with Precedence Constraints
From MaRDI portal
Cited in
(24)- k-optimal solution sets for some polynomially solvable scheduling problems
- Sequencing with general precedence constraints
- The \(S\)-\textsc{labeling} problem: an algorithmic tour
- Improved exact approaches for row layout problems with departments of equal length
- Precedence constrained scheduling to minimize sum of weighted completion times on a single machine
- Node set optimization problem for complete Josephus cubes
- Optimal ordering of statistically dependent tests
- Setting due dates to minimize the total weighted possibilistic mean value of the weighted earliness-tardiness costs on a single machine
- Minimum linear arrangement of chord graphs
- Minimum Linear Arrangement of Series-Parallel Graphs
- Single Machine General Maximum Cost Problem with Parallel-Chain Precedence Constraints
- A branch and bound algorithm for the minimum storage-time sequencing problem
- On a binary distance model for the minimum linear arrangement problem
- Single machine due date assignment scheduling problem with precedence constraints and controllable processing times in fuzzy environment
- An optimal time algorithm for minimum linear arrangement of chord graphs
- Minimum linear arrangement of the Cartesian product of optimal order graph and path
- On Submodular Search and Machine Scheduling
- Experiments on the minimum linear arrangement problem
- Graphical methods for order-of-addition experiments
- A probabilistic algorithm for optimal linear arrangements
- Optimal ordering of independent tests with precedence constraints
- Effective optimization methods for single-machine scheduling (survey)
- Minimal cutwidth linear arrangements of abelian Cayley graphs
- Stochastic scheduling in an in-forest
This page was built for publication: Single Machine Job Sequencing with Precedence Constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4118824)