Optimal scheduling on parallel machines for a new order class

DOI10.1016/S0167-6377(99)00003-6zbMath0956.90010WikidataQ126297485 ScholiaQ126297485MaRDI QIDQ1306374

Aziz Moukrim

Publication date: 1999

Published in: Operations Research Letters (Search for Journal in Brave)

zbMATH Keywords

parallel machineslinear time algorithminterval ordersnonpreemptive schedulinglist scheduling algorithmsprecedence graphsseries parallel orders

Mathematics Subject Classification ID

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

Related Items (5)

A survey on how the structure of precedence constraints may change the complexity class of scheduling problems ⋮ Unnamed Item ⋮ Optimal preemptive scheduling on a fixed number of identical parallel machines ⋮ Optimality of HLF for scheduling divide-and-conquer UET task graphs on identical parallel processors ⋮ Scheduling unitary task systems with zero--one communication delays for quasi-interval orders

Cites Work

• Unnamed Item
• NP-complete scheduling problems
• Optimal scheduling for two-processor systems
• Scheduling precedence graphs of bounded height
• Profile Scheduling of Opposing Forests and Level Orders
• Scheduling Interval-Ordered Tasks
• The Recognition of Series Parallel Digraphs
• Bounds for Certain Multiprocessing Anomalies
• Bounds on Multiprocessing Timing Anomalies
• Optimal Sequencing of Two Equivalent Processors

This page was built for publication: Optimal scheduling on parallel machines for a new order class