Sequencing with general precedence constraints
From MaRDI portal
(Redirected from Publication:1142151)
Cites work
- scientific article; zbMATH DE number 2146482 (Why is no real title available?)
- Decomposition Algorithms for Single-Machine Sequencing with Precedence Relations and Deferral Costs
- Minimization of Time-Varying Costs in Single-Machine Scheduling
- Optimal Linear Ordering
- Optimal Sequencing of a Single Machine Subject to Precedence Constraints
- Optimal task sequencing with precedence constraints
- Optimal two- and three-stage production schedules with set-up time included
- Scheduling to Minimize Maximum Cumulative Cost Subject to Series-Parallel Precedence Constraints
- Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints
- Sequencing to Minimize the Maximum Job Cost
- Sequencing with Series-Parallel Precedence Constraints
- Single Machine Job Sequencing with Precedence Constraints
- Single-Machine Job Sequencing with Treelike Precedence Ordering and Linear Delay Penalties
- TWO-MACHINE SCHEDULING UNDER REQUIRED PRECEDENCE AMONG JOBS
- The Recognition of Series Parallel Digraphs
- The Two-Machine Maximum Flow Time Problem with Series Parallel Precedence Relations
- The Two-Machine Maximum Flow Time Problem with Series-Parallel Precedence Constraints: An Algorithm and Extensions
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)