Optimal scheduling on parallel machines for a new order class

DOI10.1016/S0167-6377(99)00003-6MaRDI QIDQ1306374zbMATH OpenWikidataFDO

Authors A. Moukrim

Publication date 1999

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

zbMATH Keywords

parallel machinesinterval orderslinear time algorithmnonpreemptive 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)

Recommendations

• Optimal preemptive scheduling on a fixed number of identical parallel machines
• On a parallel machine scheduling problem with precedence constraints
• An efficient parallel algorithm for scheduling interval ordered tasks
• scientific article; zbMATH DE number 512819
• Scheduling Interval Ordered Tasks in Parallel

Cites work

• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• Bounds for Certain Multiprocessing Anomalies
• Bounds on Multiprocessing Timing Anomalies
• NP-complete scheduling problems
• Optimal Sequencing of Two Equivalent Processors
• Optimal scheduling for two-processor systems
• Profile Scheduling of Opposing Forests and Level Orders
• Scheduling Interval-Ordered Tasks
• Scheduling precedence graphs of bounded height
• The Recognition of Series Parallel Digraphs

Cited in

(14)

• A survey on how the structure of precedence constraints may change the complexity class of scheduling problems
• Scheduling unitary task systems with zero--one communication delays for quasi-interval orders
• A polynomial algorithm for recognizing the \(\mathcal A\)-order class
• Non-preemptive profile scheduling and quasi-interval orders
• Scheduling orders on either dedicated or flexible machines in parallel to minimize total weighted completion time
• Optimal preemptive scheduling on a fixed number of identical parallel machines
• Un nouveau concept de dominance pour l'ordonnancement de travaux sur une machine
• scientific article; zbMATH DE number 4057269 (Why is no real title available?)
• A new polynomial algorithm for a parallel identical scheduling problem
• A New Insight into the Coffman–Graham Algorithm
• Optimality of HLF for scheduling divide-and-conquer UET task graphs on identical parallel processors
• The solvable cases of a scheduling algorithm
• Exact methods for order acceptance and scheduling on unrelated parallel machines
• An efficient parallel algorithm for scheduling interval ordered tasks

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

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