Scheduling preemptive jobs with precedence constraints on parallel machines

DOI10.1016/S0377-2217(98)00234-3zbMath0998.90033MaRDI QIDQ1847175

Khaled Djellab

Publication date: 17 November 2002

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

linear programminginterval orderpreemptive schedulingforest

Mathematics Subject Classification ID

Linear programming (90C05) Deterministic scheduling theory in operations research (90B35)

Related Items

A survey on how the structure of precedence constraints may change the complexity class of scheduling problems, Unnamed Item, A multi-objective optimization for preemptive identical parallel machines scheduling problem, Optimal preemptive scheduling on a fixed number of identical parallel machines, Polyhedral Reformulation of a Scheduling Problem And Related Theoretical Results, Preemptive hybrid flowshop scheduling problem of interval orders, A polynomial algorithm for recognizing the \(\mathcal A\)-order class

Uses Software

• CPLEX

Cites Work

• Unnamed Item
• NP-complete scheduling problems
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
• Scheduling with Deadlines and Loss Functions
• Scheduling Interval-Ordered Tasks
• Worst Case Analysis of Two Scheduling Algorithms
• Preemptive Scheduling of Real-Time Tasks on Multiprocessor Systems