Polyhedral Reformulation of a Scheduling Problem And Related Theoretical Results
From MaRDI portal
Recommendations
Cites work
- A branch and bound algorithm for the resource-constrained project scheduling problem
- A linear programming and constraint propagation-based lower bound for the RCPSP
- A polynomial activity insertion algorithm in a multi-resource schedule with cumulative constraints and multiple modes
- A relation between multiprocessor scheduling and linear programming
- Algorithmic characterizations of interval orderd hypergraphs and applications
- An almost optimal heuristic for preemptive \(C_{\text{max}}\) scheduling of dependent tasks on parallel identical machines
- An exact algorithm for the resource-constrained project scheduling problem based on a new mathematical formulation
- Characterization and Generation of a General Class of Resource-Constrained Project Scheduling Problems
- File organization
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- scientific article; zbMATH DE number 108110 (Why is no real title available?)
- scientific article; zbMATH DE number 3894816 (Why is no real title available?)
- Incidence matrices and interval graphs
- Incidence matrices, interval graphs and seriation in archeology
- Insertion techniques for static and dynamic resource-constrained project scheduling.
- Linear programming based algorithms for preemptive and non-preemptive RCPSP
- New Benchmark Results for the Resource-Constrained Project Scheduling Problem
- Optimal preemptive scheduling on a fixed number of identical parallel machines
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Partially Ordered Sets
- Polynomial Complete Consecutive Information Retrieval Problems
- Preemptive scheduling of interval orders is polynomial
- Preemptive Scheduling of Real-Time Tasks on Multiprocessor Systems
- Rational preemptive scheduling
- Resource-constrained project scheduling: Notation, classification, models, and methods
- Scheduling Interval-Ordered Tasks
- Scheduling precedence graphs of bounded height
- Scheduling preemptive jobs with precedence constraints on parallel machines
- Storage for consecutive retrieval
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- The Jump Number of Dags and Posets: An Introduction
- Tight LP bounds for resource constrained project scheduling
- Towards a general theory of action and time
Cited in
(8)- Preemptive scheduling and antichain polyhedra
- On the extension complexity of scheduling polytopes
- Sub-polyhedral scheduling using (unit-)two-variable-per-inequality polyhedra
- Reformulation and Solution Approaches for an Integrated Scheduling Model
- scientific article; zbMATH DE number 3968299 (Why is no real title available?)
- scientific article; zbMATH DE number 1946760 (Why is no real title available?)
- scientific article; zbMATH DE number 1560545 (Why is no real title available?)
- scientific article; zbMATH DE number 850294 (Why is no real title available?)
This page was built for publication: Polyhedral Reformulation of a Scheduling Problem And Related Theoretical Results
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3598041)
