Pareto-scheduling of two competing agents with their own equal processing times (Q2140187): Difference between revisions

From MaRDI portal

Jump to:navigation, search

Latest revision as of 05:14, 17 December 2024

scientific article

Language	Label	Description	Also known as
English	Pareto-scheduling of two competing agents with their own equal processing times	scientific article

Statements

scholarly article

0 references

Pareto-scheduling of two competing agents with their own equal processing times (English)

0 references

0 references

0 references

0 references

0 references

0 references

European Journal of Operational Research

0 references

publication date

20 May 2022

0 references

zbMATH Keywords

scheduling

0 references

single machine

0 references

Pareto frontier

0 references

two-agent

0 references

own equal processing times

0 references

MaRDI profile type

0 references

full work available at URL

https://doi.org/10.1016/j.ejor.2021.10.064

0 references

Multiagent Scheduling

0 references

Price of fairness in two-agent single-machine scheduling problems

0 references

Scheduling Problems with Two Competing Agents

0 references

A competitive scheduling problem and its relevance to UMTS channel assignment

0 references

A multiple-criterion model for machine scheduling

0 references

The complexity of CO-agent scheduling to minimize the total completion time and total number of tardy jobs

0 references

Scheduling on parallel identical machines with late work criterion: offline and online cases

0 references

Two-agent single-machine scheduling problem with just-in-time jobs

0 references

Scheduling identical jobs on uniform parallel machines

0 references

Single machine scheduling with two competing agents, arbitrary release dates and unit processing times

0 references

Scheduling two agents on uniform parallel machines with~makespan and cost functions

0 references

Two-agent scheduling on uniform parallel machines with min-max criteria

0 references

Two-agent scheduling in a flowshop

0 references

Bi-criteria Pareto-scheduling on a single machine with due indices and precedence constraints

0 references

A further study on two-agent parallel-batch scheduling with release dates and deteriorating jobs to minimize the makespan

0 references

A note on competing-agent Pareto-scheduling

0 references

0 references

Scheduling problems with two competing agents to minimized weighted earliness-tardiness

0 references

Single Machine Scheduling to Minimize Total Weighted Late Work

0 references

Multicriteria scheduling

0 references

0 references

Competitive Two-Agent Scheduling and Its Applications

0 references

A survey of due-date related single-machine with two-agent scheduling problem

0 references

Single-machine scheduling with multi-agents to minimize total weighted late work

0 references

Scheduling problems with two competing agents to minimize minmax and minsum earliness measures

0 references

Minimizing total late work on a single machine with generalized due-dates

0 references

Single machine scheduling with two competing agents and equal job processing times

0 references

A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems

0 references

Complexity analyses for multi-agent scheduling problems with a global agent and equal length jobs

0 references

Equal processing time bicriteria scheduling on parallel machines

0 references

Polynomial time approximation scheme for two parallel machines scheduling with a common due date to maximize early work

0 references

Competitive two-agent scheduling with deteriorating jobs on a single parallel-batching machine

0 references

0 references

Bicriterion scheduling of identical processing time jobs by uniform processors

0 references

Two-agent scheduling of unit processing time jobs to minimize total weighted completion time and total weighted number of tardy jobs

0 references

Pareto optimization scheduling with two competing agents to minimize the number of tardy jobs and the maximum cost

0 references

A two-agent single-machine scheduling problem with late work criteria

0 references

Two-agent scheduling on a single parallel-batching machine with equal processing time and non-identical job sizes

0 references

Approximation schemes for single‐machine scheduling with a fixed maintenance activity to minimize the total amount of late work

0 references

Complexities of four problems on two-agent scheduling

0 references

Scheduling with release dates and preemption to minimize multiple max-form objective functions

0 references

Two-agent scheduling problems on a single-machine to minimize the total weighted late work

0 references

A note on a two-agent scheduling problem related to the total weighted late work

0 references

Pareto‐optimization of three‐agent scheduling to minimize the total weighted completion time, weighted number of tardy jobs, and total weighted late work

0 references

Bicriteria scheduling of equal length jobs on uniform parallel machines

0 references

Single-machine scheduling with maintenance activities and rejection

0 references

Identifiers

zbMATH Open document ID

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

10.1016/J.EJOR.2021.10.064

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2140187

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2140187&oldid=38901776"