scientific article; zbMATH DE number 4181112
From MaRDI portal
Publication:3204309
zbMATH Open0716.90051MaRDI QIDQ3204309FDOQ3204309
Publication date: 1990
Title of this publication is not available (Why is that?)
Programming involving graphs or networks (90C35) Deterministic scheduling theory in operations research (90B35) Abstract computational complexity for mathematical programming problems (90C60)
Cited In (12)
- Integer Programming and Combinatorial Optimization
- An integer programming approach to optimal basic block instruction scheduling for single-issue processors
- A new formulation for scheduling unrelated processor under precedence constraints
- Single Machine Scheduling with Series-Parallel Precedence Constraints
- Minimizing non-decreasing separable objective functions for the unit-time open shop scheduling problem
- Title not available (Why is that?)
- Single-Machine Scheduling with Precedence Constraints
- Single machine precedence constrained scheduling is a Vertex cover problem
- Parametric precedence relations in single machine scheduling
- A half-integral linear programming relaxation for scheduling precedence-constrained jobs on a single machine
- An improved precedence rule for single machine sequencing problems with quadratic penalty
- Review of properties of different precedence graphs for scheduling problems
Recommendations
- Single-Machine Scheduling Polyhedra with Precedence Constraints 👍 👎
- Single Machine Scheduling with Series-Parallel Precedence Constraints 👍 👎
- Integer Programming and Combinatorial Optimization 👍 👎
- Single-Machine Scheduling with Precedence Constraints 👍 👎
- A polyhedral approach to single-machine scheduling problems. 👍 👎
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3204309)
