Complexity analyses for multi-agent scheduling problems with a global agent and equal length jobs
From MaRDI portal
Publication:1751210
DOI10.1016/j.disopt.2017.01.001zbMath1387.90289OpenAlexW2586195032MaRDI QIDQ1751210
Publication date: 24 May 2018
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2017.01.001
Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items
Pareto-scheduling of two competing agents with their own equal processing times, Two-agent scheduling of unit processing time jobs to minimize total weighted completion time and total weighted number of tardy jobs, Bicriteria scheduling of equal length jobs on uniform parallel machines, Scheduling with release dates and preemption to minimize multiple max-form objective functions
Cites Work
- Unnamed Item
- Unnamed Item
- Two-agent scheduling on uniform parallel machines with min-max criteria
- A note on the scheduling with two families of jobs
- Effective implementation of the \(\varepsilon \)-constraint method in multi-objective mathematical programming problems
- Preemptive scheduling of equal length jobs with release dates on two uniform parallel machines
- Scheduling interfering job sets on parallel machines
- Parallel machine problems with equal processing times: a survey
- 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 to minimize total weighted number of tardy jobs
- Scheduling Problems with Two Competing Agents
- Multiagent Scheduling
- Solving multi-agent scheduling problems on parallel machines with a global objective function
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- Scheduling
