Pareto-scheduling of two competing agents with their own equal processing times
From MaRDI portal
Publication:2140187
DOI10.1016/j.ejor.2021.10.064zbMath1506.90095OpenAlexW3215014550MaRDI QIDQ2140187
Zhichao Geng, Rubing Chen, Yuan Zhang, Jinjiang Yuan, Ling-Fa Lu
Publication date: 20 May 2022
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2021.10.064
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items
Bicriterion Pareto‐scheduling of equal‐length jobs on a single machine related to the total weighted late work ⋮ Pareto‐scheduling with double‐weighted jobs to minimize the weighted number of tardy jobs and total weighted late work ⋮ Competitive two-agent scheduling with release dates and preemption on a single machine ⋮ Faster algorithms for bicriteria scheduling of identical jobs on uniform machines
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
- Two-agent scheduling in a flowshop
- Scheduling problems with two competing agents to minimized weighted earliness-tardiness
- 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
- Scheduling problems with two competing agents to minimize minmax and minsum earliness measures
- Bicriterion scheduling of identical processing time jobs by uniform processors
- Complexities of four problems on two-agent scheduling
- Polynomial time approximation scheme for two parallel machines scheduling with a common due date to maximize early work
- Competitive two-agent scheduling with deteriorating jobs on a single parallel-batching machine
- A two-agent single-machine scheduling problem with late work criteria
- Scheduling on parallel identical machines with late work criterion: offline and online cases
- Price of fairness in two-agent single-machine scheduling problems
- Complexity analyses for multi-agent scheduling problems with a global agent and equal length jobs
- Bi-criteria Pareto-scheduling on a single machine with due indices and precedence constraints
- Two-agent scheduling on a single parallel-batching machine with equal processing time and non-identical job sizes
- Equal processing time bicriteria scheduling on parallel machines
- A further study on two-agent parallel-batch scheduling with release dates and deteriorating jobs to minimize the makespan
- A note on competing-agent Pareto-scheduling
- Two-agent scheduling of unit processing time jobs to minimize total weighted completion time and total weighted number of tardy jobs
- Minimizing total late work on a single machine with generalized due-dates
- A survey of due-date related single-machine with two-agent scheduling problem
- Single-machine scheduling with multi-agents to minimize total weighted late work
- Single-machine scheduling with maintenance activities and rejection
- Two-agent single-machine scheduling problem with just-in-time jobs
- A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems
- The complexity of CO-agent scheduling to minimize the total completion time and total 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
- Two-agent scheduling problems on a single-machine to minimize the total weighted late work
- A note on a two-agent scheduling problem related to the total weighted late work
- Scheduling two agents on uniform parallel machines with~makespan and cost functions
- A multiple-criterion model for machine scheduling
- Multicriteria scheduling
- Competitive Two-Agent Scheduling and Its Applications
- A competitive scheduling problem and its relevance to UMTS channel assignment
- Scheduling identical jobs on uniform parallel machines
- Scheduling Problems with Two Competing Agents
- Approximation schemes for single‐machine scheduling with a fixed maintenance activity to minimize the total amount of late work
- Single Machine Scheduling to Minimize Total Weighted Late Work
- Multiagent Scheduling
- Pareto‐optimization of three‐agent scheduling to minimize the total weighted completion time, weighted number of tardy jobs, and total weighted late work
