Ideal schedules in parallel machine settings
From MaRDI portal
Publication:2029359
Recommendations
- An efficient algorithm for finding ideal schedules
- Ideal preemptive schedules on two processors
- scientific article; zbMATH DE number 2221458
- Interval scheduling on identical machines
- Shortest path to nonpreemptive schedules of unit-time jobs on two identical parallel machines with minimum total completion time
Cites work
- A Fast Algorithm for Multiprocessor Scheduling of Unit-Length Jobs
- A Level Algorithm for Preemptive Scheduling
- A polynomial algorithm for \(P | p_j = 1,r_j, outtree\,| \sum C_j\)
- A survey on how the structure of precedence constraints may change the complexity class of scheduling problems
- An efficient algorithm for finding ideal schedules
- Bounds on Multiprocessing Timing Anomalies
- Complexity of scheduling problems with multi-purpose machines
- Complexity of Scheduling under Precedence Constraints
- scientific article; zbMATH DE number 3883931 (Why is no real title available?)
- scientific article; zbMATH DE number 3780551 (Why is no real title available?)
- scientific article; zbMATH DE number 3560745 (Why is no real title available?)
- Ideal preemptive schedules on two processors
- Minimizing mean flow time for UET tasks
- Minimizing mean flow time with release time constraint
- Minimizing total completion time for UET tasks with release time and outtree precedence constraints
- Multiprocessor Scheduling of Unit-Time Jobs with Arbitrary Release Times and Deadlines
- NP-complete scheduling problems
- On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming
- Optimal scheduling for two-processor systems
- Optimal Sequencing of a Single Machine Subject to Precedence Constraints
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Preemptive Scheduling of Equal Length Jobs on Two Machines to Minimize Mean Flow Time
- Preemptive Scheduling of Real-Time Tasks on Multiprocessor Systems
- Scheduling algorithms
- Scheduling chain-structured tasks to minimize makespan and mean flow time
- Scheduling equal length jobs with eligibility restrictions
- Scheduling Equal-Length Tasks Under Treelike Precedence Constraints to Minimize Maximum Lateness
- Scheduling identical jobs on uniform parallel machines
- Scheduling identical jobs with chain precedence constraints on two uniform machines
- Scheduling independent tasks to reduce mean finishing time
- Scheduling jobs with equal processing times subject to machine eligibility constraints
- Scheduling Unit–Time Tasks with Arbitrary Release Times and Deadlines
- Scheduling with deadlines and loss functions
- Scheduling. Theory, algorithms, and systems
- Shortest path to nonpreemptive schedules of unit-time jobs on two identical parallel machines with minimum total completion time
- Technical Note—Minimizing Average Flow Time with Parallel Machines
- Ten notes on equal-processing-time scheduling: at the frontiers of solvability in polynomial time
- The ``least flexible job first rule in scheduling and in queueing
- The complexity of mean flow time scheduling problems with release times
- Two machine preemptive scheduling problem with release dates, equal processing times and precedence constraints
- Two-Processor Scheduling with Start-Times and Deadlines
Cited in
(10)- Ideal preemptive schedules on two processors
- Approximation algorithms for bicriteria scheduling problems on identical parallel machines for makespan and total completion time
- Efficient algorithms for scheduling equal-length jobs with processing set restrictions on uniform parallel batch machines
- Feasible Schedules for Rotating Transmissions
- Performance analysis of active schedules in identical parallel machine
- scientific article; zbMATH DE number 1990707 (Why is no real title available?)
- Bicriteria two-machine flowshop scheduling: approximation algorithms and their limits
- A branch-and-price algorithm for unrelated parallel machine scheduling with machine usage costs
- A bi-objective unrelated parallel machine scheduling problem with additional resources and soft precedence constraints
- An efficient metaheuristic algorithm for unrelated parallel machine scheduling to minimize total weighted completion time
This page was built for publication: Ideal schedules in parallel machine settings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2029359)
