Sequencing with general precedence constraints
From MaRDI portal
Publication:1142151
DOI10.1016/0166-218X(81)90038-XzbMATH Open0438.90037OpenAlexW2057192029MaRDI QIDQ1142151FDOQ1142151
Authors: Clyde l. Monma
Publication date: 1981
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0166-218x(81)90038-x
transformationssequencinggeneral precedence constraintsleast-cost fault detection problemminimum-cost permutationone-machine total weighted completion time problemtwo-machine maximum flow-time problemworst-case effectiveness
Cites Work
- Title not available (Why is that?)
- Optimal Sequencing of a Single Machine Subject to Precedence Constraints
- Optimal two- and three-stage production schedules with set-up time included
- The Recognition of Series Parallel Digraphs
- Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints
- Optimal Linear Ordering
- Decomposition Algorithms for Single-Machine Sequencing with Precedence Relations and Deferral Costs
- Sequencing with Series-Parallel Precedence Constraints
- Single Machine Job Sequencing with Precedence Constraints
- Optimal task sequencing with precedence constraints
- Sequencing to Minimize the Maximum Job Cost
- Scheduling to Minimize Maximum Cumulative Cost Subject to Series-Parallel Precedence Constraints
- The Two-Machine Maximum Flow Time Problem with Series-Parallel Precedence Constraints: An Algorithm and Extensions
- Minimization of Time-Varying Costs in Single-Machine Scheduling
- The Two-Machine Maximum Flow Time Problem with Series Parallel Precedence Relations
- TWO-MACHINE SCHEDULING UNDER REQUIRED PRECEDENCE AMONG JOBS
- Single-Machine Job Sequencing with Treelike Precedence Ordering and Linear Delay Penalties
Cited In (3)
This page was built for publication: Sequencing with general precedence constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1142151)