Optimal scheduling on parallel machines for a new order class
DOI10.1016/S0167-6377(99)00003-6zbMATH Open0956.90010WikidataQ126297485 ScholiaQ126297485MaRDI QIDQ1306374FDOQ1306374
Authors: A. Moukrim 
Publication date: 1999
Published in: Operations Research Letters (Search for Journal in Brave)
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
parallel machinesinterval orderslinear time algorithmnonpreemptive schedulinglist scheduling algorithmsprecedence graphsseries parallel orders
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cites Work
- Title not available (Why is that?)
- Bounds for Certain Multiprocessing Anomalies
- Bounds on Multiprocessing Timing Anomalies
- The Recognition of Series Parallel Digraphs
- Optimal scheduling for two-processor systems
- Scheduling Interval-Ordered Tasks
- Optimal Sequencing of Two Equivalent Processors
- NP-complete scheduling problems
- Profile Scheduling of Opposing Forests and Level Orders
- Scheduling precedence graphs of bounded height
Cited In (14)
- Non-preemptive profile scheduling and quasi-interval orders
- A new polynomial algorithm for a parallel identical scheduling problem
- A survey on how the structure of precedence constraints may change the complexity class of scheduling problems
- Exact methods for order acceptance and scheduling on unrelated parallel machines
- Un nouveau concept de dominance pour l'ordonnancement de travaux sur une machine
- Optimality of HLF for scheduling divide-and-conquer UET task graphs on identical parallel processors
- A New Insight into the Coffman–Graham Algorithm
- The solvable cases of a scheduling algorithm
- A polynomial algorithm for recognizing the \(\mathcal A\)-order class
- Scheduling orders on either dedicated or flexible machines in parallel to minimize total weighted completion time
- An efficient parallel algorithm for scheduling interval ordered tasks
- Title not available (Why is that?)
- Scheduling unitary task systems with zero--one communication delays for quasi-interval orders
- Optimal preemptive scheduling on a fixed number of identical parallel machines
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)
