Preemptive scheduling and antichain polyhedra

DOI10.1016/J.DAM.2008.05.036zbMATH Open1155.90356OpenAlexW2011472863MaRDI QIDQ1003473FDOQ1003473

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

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

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)

Cites Work

• Title not available (Why is that?)
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Characterization and Generation of a General Class of Resource-Constrained Project Scheduling Problems
• Towards a general theory of action and time
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
• Incidence matrices and interval graphs
• Incidence matrices, interval graphs and seriation in archeology
• An exact algorithm for the resource-constrained project scheduling problem based on a new mathematical formulation
• Title not available (Why is that?)
• A branch and bound algorithm for the resource-constrained project scheduling problem
• Scheduling Interval-Ordered Tasks
• Title not available (Why is that?)
• File organization
• New Benchmark Results for the Resource-Constrained Project Scheduling Problem
• A linear programming and constraint propagation-based lower bound for the RCPSP
• Title not available (Why is that?)
• Optimal preemptive scheduling on a fixed number of identical parallel machines
• Preemptive Scheduling of Real-Time Tasks on Multiprocessor Systems
• Title not available (Why is that?)
• The Jump Number of Dags and Posets: An Introduction
• Polynomial Complete Consecutive Information Retrieval Problems
• Algorithmic characterizations of interval orderd hypergraphs and applications
• Storage for consecutive retrieval
• Rational preemptive scheduling
• Profile Scheduling of Opposing Forests and Level Orders
• Scheduling precedence graphs of bounded height
• A relation between multiprocessor scheduling and linear programming
• Preemptive scheduling of interval orders is polynomial

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)