Preemptive scheduling and antichain polyhedra
From MaRDI portal
Publication:1003473
DOI10.1016/j.dam.2008.05.036zbMath1155.90356OpenAlexW2011472863MaRDI QIDQ1003473
Publication date: 4 March 2009
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2008.05.036
Linear programming (90C05) Hypergraphs (05C65) Queues and service in operations research (90B22) Combinatorial optimization (90C27)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Preemptive scheduling of interval orders is polynomial
- Towards a general theory of action and time
- Rational preemptive scheduling
- Storage for consecutive retrieval
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- A relation between multiprocessor scheduling and linear programming
- A branch and bound algorithm for the resource-constrained project scheduling problem
- Algorithmic characterizations of interval orderd hypergraphs and applications
- A linear programming and constraint propagation-based lower bound for the RCPSP
- Incidence matrices and interval graphs
- Optimal preemptive scheduling on a fixed number of identical parallel machines
- Incidence matrices, interval graphs and seriation in archeology
- An Exact Algorithm for the Resource-Constrained Project Scheduling Problem Based on a New Mathematical Formulation
- Scheduling precedence graphs of bounded height
- Profile Scheduling of Opposing Forests and Level Orders
- Scheduling Interval-Ordered Tasks
- The Jump Number of Dags and Posets: An Introduction
- Polynomial Complete Consecutive Information Retrieval Problems
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- New Benchmark Results for the Resource-Constrained Project Scheduling Problem
- Preemptive Scheduling of Real-Time Tasks on Multiprocessor Systems
- File organization
- Characterization and Generation of a General Class of Resource-Constrained Project Scheduling Problems
This page was built for publication: Preemptive scheduling and antichain polyhedra
