Preemptive scheduling and antichain polyhedra

DOI10.1016/J.DAM.2008.05.036MaRDI QIDQ1003473zbMATH OpenOpenAlexFDO

Authors Alain Quilliot

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

zbMATH Keywords

linear programminghypergraphspartially ordered setsmultiprocessor scheduling

Mathematics Subject Classification ID

Linear programming (90C05) Queues and service in operations research (90B22) Combinatorial optimization (90C27) Hypergraphs (05C65)

Recommendations

• Rational preemptive scheduling
• Single-Machine Scheduling Polyhedra with Precedence Constraints
• Polyhedral Reformulation of a Scheduling Problem And Related Theoretical Results
• Multiprocessor scheduling under precedence constraints: polyhedral results
• scientific article; zbMATH DE number 2080263

Cites work

• scientific article; zbMATH DE number 4089320 (Why is no real title available?)
• scientific article; zbMATH DE number 44978 (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?)
• scientific article; zbMATH DE number 3338381 (Why is no real title available?)
• 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 relation between multiprocessor scheduling and linear programming
• Algorithmic characterizations of interval orderd hypergraphs and applications
• 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
• Incidence matrices and interval graphs
• Incidence matrices, interval graphs and seriation in archeology
• 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
• Polynomial Complete Consecutive Information Retrieval Problems
• Preemptive Scheduling of Real-Time Tasks on Multiprocessor Systems
• Preemptive scheduling of interval orders is polynomial
• Profile Scheduling of Opposing Forests and Level Orders
• Rational preemptive scheduling
• Scheduling Interval-Ordered Tasks
• Scheduling precedence graphs of bounded height
• 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
• Towards a general theory of action and time

Cited in

(3)

• Preemptive Scheduling, Linear Programming and Network Flows
• Preemptive scheduling of interval orders is polynomial
• Polyhedral Reformulation of a Scheduling Problem And Related Theoretical Results

This page was built for publication: Preemptive scheduling and antichain polyhedra

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1003473)