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

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ejor.2021.10.064 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Multiagent Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Price of fairness in two-agent single-machine scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Problems with Two Competing Agents / rank
 
Normal rank
Property / cites work
 
Property / cites work: A competitive scheduling problem and its relevance to UMTS channel assignment / rank
 
Normal rank
Property / cites work
 
Property / cites work: A multiple-criterion model for machine scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of CO-agent scheduling to minimize the total completion time and total number of tardy jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling on parallel identical machines with late work criterion: offline and online cases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-agent single-machine scheduling problem with just-in-time jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling identical jobs on uniform parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single machine scheduling with two competing agents, arbitrary release dates and unit processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling two agents on uniform parallel machines with~makespan and cost functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-agent scheduling on uniform parallel machines with min-max criteria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-agent scheduling in a flowshop / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bi-criteria Pareto-scheduling on a single machine with due indices and precedence constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A further study on two-agent parallel-batch scheduling with release dates and deteriorating jobs to minimize the makespan / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on competing-agent Pareto-scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling problems with two competing agents to minimized weighted earliness-tardiness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single Machine Scheduling to Minimize Total Weighted Late Work / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicriteria scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3048571 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive Two-Agent Scheduling and Its Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of due-date related single-machine with two-agent scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-machine scheduling with multi-agents to minimize total weighted late work / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling problems with two competing agents to minimize minmax and minsum earliness measures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing total late work on a single machine with generalized due-dates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single machine scheduling with two competing agents and equal job processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity analyses for multi-agent scheduling problems with a global agent and equal length jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equal processing time bicriteria scheduling on parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial time approximation scheme for two parallel machines scheduling with a common due date to maximize early work / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive two-agent scheduling with deteriorating jobs on a single parallel-batching machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3378953 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bicriterion scheduling of identical processing time jobs by uniform processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-agent scheduling of unit processing time jobs to minimize total weighted completion time and total weighted number of tardy jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pareto optimization scheduling with two competing agents to minimize the number of tardy jobs and the maximum cost / rank
 
Normal rank
Property / cites work
 
Property / cites work: A two-agent single-machine scheduling problem with late work criteria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-agent scheduling on a single parallel-batching machine with equal processing time and non-identical job sizes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation schemes for single‐machine scheduling with a fixed maintenance activity to minimize the total amount of late work / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexities of four problems on two-agent scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with release dates and preemption to minimize multiple max-form objective functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-agent scheduling problems on a single-machine to minimize the total weighted late work / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on a two-agent scheduling problem related to the total weighted late work / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pareto‐optimization of three‐agent scheduling to minimize the total weighted completion time, weighted number of tardy jobs, and total weighted late work / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bicriteria scheduling of equal length jobs on uniform parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-machine scheduling with maintenance activities and rejection / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.EJOR.2021.10.064 / rank
 
Normal rank

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

    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
    20 May 2022
    0 references
    scheduling
    0 references
    single machine
    0 references
    Pareto frontier
    0 references
    two-agent
    0 references
    own equal processing times
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers