Competitive two-agent scheduling with release dates and preemption on a single machine
From MaRDI portal
Publication:6116025
DOI10.1007/s10951-023-00779-5zbMath1518.90028OpenAlexW4360994763MaRDI QIDQ6116025
Publication date: 13 July 2023
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-023-00779-5
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Single machine scheduling with two competing agents, arbitrary release dates and unit processing times
- Single machine scheduling with two competing agents and equal job processing times
- Pareto optimization scheduling with two competing agents to minimize the number of tardy jobs and the maximum cost
- Two-agent scheduling on uniform parallel machines with min-max criteria
- An \(O( n^2)\) algorithm for scheduling equal-length preemptive jobs on a single machine to minimize total tardiness
- A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs
- Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications
- The one-machine sequencing problem
- Knapsack-like scheduling problems, the Moore-Hodgson algorithm and the `Tower of Sets' property
- Online real-time preemptive scheduling of jobs with deadlines on multiple machines
- Preemptive scheduling of equal-length jobs to maximize weighted throughput.
- Scheduling equal-length jobs on identical parallel machines
- Preemptive scheduling with two minimax criteria
- Price of fairness in two-agent single-machine scheduling problems
- Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times
- A note on competing-agent Pareto-scheduling
- Two-agent preemptive Pareto-scheduling to minimize the number of tardy jobs and total late work
- Two-agent scheduling of unit processing time jobs to minimize total weighted completion time and total weighted number of tardy jobs
- Pareto-scheduling of two competing agents with their own equal processing times
- Single-machine scheduling with multi-agents to minimize total weighted late work
- A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems
- Two-agent scheduling on unrelated parallel machines with total completion time and weighted number of tardy jobs criteria
- The complexity of CO-agent scheduling to minimize the total completion time and total number of tardy jobs
- Two-agent scheduling with deteriorating jobs on a single parallel-batching machine: refining computational complexity
- Due date-related scheduling with two agents. Models and algorithms
- Bicriteria scheduling of equal length jobs on uniform parallel machines
- Scheduling with release dates and preemption to minimize multiple max-form objective functions
- Two-agent single-machine scheduling with release dates and preemption to minimize the maximum lateness
- A note on the preemptive scheduling to minimize total completion time with release time and deadline constraints
- A note on the complexity of the problem of two-agent scheduling on a single machine
- A note on a two-agent scheduling problem related to the total weighted late work
- Parallel machine problems with equal processing times: a survey
- Scheduling two agents on uniform parallel machines with~makespan and cost functions
- Single-machine multi-agent scheduling problems with a global objective function
- A multiple-criterion model for machine scheduling
- Multi-agent scheduling on a single machine with max-form criteria
- Multi-agent single machine scheduling
- Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs
- Pareto optimization scheduling of family jobs on a p-batch machine to minimize makespan and maximum lateness
- Multicriteria scheduling
- Hard Real-Time Computing Systems
- Competitive Two-Agent Scheduling and Its Applications
- Minimizing Total Tardiness on One Machine is NP-Hard
- Scheduling Problems with Two Competing Agents
- Some simple scheduling algorithms
- Two‐agent scheduling on a single sequential and compatible batching machine
- Multiagent Scheduling
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
- A Functional Equation and its Application to Resource Allocation and Sequencing Problems
