Ideal schedules in parallel machine settings
From MaRDI portal
Publication:2029359
DOI10.1016/j.ejor.2020.08.010zbMath1487.90297OpenAlexW3063630510MaRDI QIDQ2029359
Xiaojuan Jiang, Kangbok Lee, Michael L. Pinedo
Publication date: 3 June 2021
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2020.08.010
Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (2)
Efficient algorithms for scheduling equal-length jobs with processing set restrictions on uniform parallel batch machines ⋮ Approximation algorithms for bicriteria scheduling problems on identical parallel machines for makespan and total completion time
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Scheduling jobs with equal processing times subject to machine eligibility constraints
- Shortest path to nonpreemptive schedules of unit-time jobs on two identical parallel machines with minimum total completion time
- An efficient algorithm for finding ideal schedules
- The complexity of mean flow time scheduling problems with release times
- Minimizing mean flow time with release time constraint
- NP-complete scheduling problems
- Complexity of scheduling problems with multi-purpose machines
- Ideal preemptive schedules on two processors
- A survey on how the structure of precedence constraints may change the complexity class of scheduling problems
- A polynomial algorithm for \(P | p_j = 1,r_j, outtree\,| \sum C_j\)
- Scheduling chain-structured tasks to minimize makespan and mean flow time
- Ten notes on equal-processing-time scheduling: at the frontiers of solvability in polynomial time
- Scheduling identical jobs with chain precedence constraints on two uniform machines
- Scheduling equal length jobs with eligibility restrictions
- Minimizing total completion time for UET tasks with release time and outtree precedence constraints
- The ``least flexible job first rule in scheduling and in queueing
- Optimal scheduling for two-processor systems
- Two machine preemptive scheduling problem with release dates, equal processing times and precedence constraints
- Scheduling with Deadlines and Loss Functions
- Minimizing mean flow time for UET tasks
- Preemptive Scheduling of Equal Length Jobs on Two Machines to Minimize Mean Flow Time
- Scheduling identical jobs on uniform parallel machines
- Multiprocessor Scheduling of Unit-Time Jobs with Arbitrary Release Times and Deadlines
- Scheduling Unit–Time Tasks with Arbitrary Release Times and Deadlines
- A Level Algorithm for Preemptive Scheduling
- Two-Processor Scheduling with Start-Times and Deadlines
- Complexity of Scheduling under Precedence Constraints
- On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming
- Scheduling Equal-Length Tasks Under Treelike Precedence Constraints to Minimize Maximum Lateness
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- A Fast Algorithm for Multiprocessor Scheduling of Unit-Length Jobs
- Scheduling independent tasks to reduce mean finishing time
- Bounds on Multiprocessing Timing Anomalies
- Preemptive Scheduling of Real-Time Tasks on Multiprocessor Systems
- Optimal Sequencing of a Single Machine Subject to Precedence Constraints
- Technical Note—Minimizing Average Flow Time with Parallel Machines
- Scheduling
This page was built for publication: Ideal schedules in parallel machine settings
