Two-agent scheduling on uniform parallel machines with min-max criteria (Q744634): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Scheduling Problems with Two Competing Agents / 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: Scheduling interfering job sets on parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling equal-length jobs on identical parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on scheduling multiprocessor tasks with identical processing times. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4875168 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling jobs with equal processing times and time windows on identical parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel-Machine Scheduling Problems with Earliness and Tardiness Penalties / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on scheduling equal-length jobs to maximize throughput / 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: Bound sets for biobjective combinatorial optimization problems / 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: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new dynamic programming formulation for scheduling independent tasks with common due date on parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single machine scheduling with interfering job sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Sequencing of a Single Machine Subject to Precedence Constraints / 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: Scheduling <i>n</i> Independent Jobs on <i>m</i> Uniform Machines with both Flowtime and Makespan Objectives: A Parametric Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the complexity of the problem of two-agent scheduling on a single machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Multiobjective Branch-and-Bound Framework: Application to the Biobjective Spanning Tree Problem / 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: A note on the scheduling with two families of jobs / rank
 
Normal rank

Latest revision as of 01:44, 9 July 2024

scientific article
Language Label Description Also known as
English
Two-agent scheduling on uniform parallel machines with min-max criteria
scientific article

    Statements

    Two-agent scheduling on uniform parallel machines with min-max criteria (English)
    0 references
    0 references
    0 references
    26 September 2014
    0 references
    multi-agent scheduling
    0 references
    parallel machines
    0 references
    Pareto optimum
    0 references
    0 references

    Identifiers