A relation between multiprocessor scheduling and linear programming

DOI10.1023/A:1006025717772zbMath0912.90178MaRDI QIDQ1267552

Aziz Moukrim, Alain Quilliot

Publication date: 3 February 1999

Published in: Order (Search for Journal in Brave)

zbMATH Keywords

non-preemptive multiprocessor scheduling

Mathematics Subject Classification ID

Linear programming (90C05) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (6)

A survey on how the structure of precedence constraints may change the complexity class of scheduling problems ⋮ Linear programming based algorithms for preemptive and non-preemptive RCPSP ⋮ Optimal preemptive scheduling on a fixed number of identical parallel machines ⋮ Polyhedral Reformulation of a Scheduling Problem And Related Theoretical Results ⋮ Preemptive scheduling and antichain polyhedra ⋮ A polynomial algorithm for recognizing the \(\mathcal A\)-order class

This page was built for publication: A relation between multiprocessor scheduling and linear programming