Competitive two-agent scheduling with release dates and preemption on a single machine (Q6116025): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
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: Multi-agent single machine scheduling / 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: 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: Preemptive scheduling of equal-length jobs to maximize weighted throughput. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3425131 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hard Real-Time Computing Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The one-machine sequencing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pareto-scheduling of two competing agents with their own equal processing times / 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: Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-agent scheduling on a single machine with max-form criteria / 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: Minimizing Total Tardiness on One Machine is NP-Hard / 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: A note on competing-agent Pareto-scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pareto optimization scheduling of family jobs on a p-batch machine to minimize makespan and maximum lateness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online real-time preemptive scheduling of jobs with deadlines on multiple machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-agent preemptive Pareto-scheduling to minimize the number of tardy jobs and total late work / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicriteria scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some simple scheduling algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-machine multi-agent scheduling problems with a global objective function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-agent scheduling with deteriorating jobs on a single parallel-batching machine: refining computational complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel machine problems with equal processing times: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3217922 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Knapsack-like scheduling problems, the Moore-Hodgson algorithm and the `Tower of Sets' property / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Functional Equation and its Application to Resource Allocation and Sequencing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4124328 / 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: Two‐agent scheduling on a single sequential and compatible batching machine / 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: An <i>n</i> Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs / 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: 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: Preemptive scheduling with two minimax criteria / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(O( n^2)\) algorithm for scheduling equal-length preemptive jobs on a single machine to minimize total tardiness / 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: A note on the preemptive scheduling to minimize total completion time with release time and deadline constraints / 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: Two-agent scheduling on unrelated parallel machines with total completion time and weighted number of tardy jobs criteria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Due date-related scheduling with two agents. Models and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-agent single-machine scheduling with release dates and preemption to minimize the maximum lateness / 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: A note on a two-agent scheduling problem related to the 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

Revision as of 18:12, 1 August 2024

scientific article; zbMATH DE number 7712131
Language Label Description Also known as
English
Competitive two-agent scheduling with release dates and preemption on a single machine
scientific article; zbMATH DE number 7712131

    Statements

    Competitive two-agent scheduling with release dates and preemption on a single machine (English)
    0 references
    0 references
    0 references
    13 July 2023
    0 references
    scheduling
    0 references
    single-machine
    0 references
    two-agent
    0 references
    release date
    0 references
    preemption
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers