A new approximation algorithm for multi-agent scheduling to minimize makespan on two machines (Q283263): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10951-015-0460-y / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2285763352 / 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 Lagrangian approach to single-machine scheduling problems with two competing agents / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiagent Scheduling / 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: Bounded parallel-batching scheduling with two competing agents / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on Multiprocessing Timing Anomalies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for multi-agent scheduling to minimize total weighted completion time / 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: Unbounded parallel-batching scheduling with two competitive agents / rank
 
Normal rank
Property / cites work
 
Property / cites work: A decomposition scheme for single stage scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analyzing scheduling with transient failures / rank
 
Normal rank

Latest revision as of 23:14, 11 July 2024

scientific article
Language Label Description Also known as
English
A new approximation algorithm for multi-agent scheduling to minimize makespan on two machines
scientific article

    Statements

    A new approximation algorithm for multi-agent scheduling to minimize makespan on two machines (English)
    0 references
    0 references
    0 references
    0 references
    13 May 2016
    0 references
    multi-agent scheduling
    0 references
    identical machines
    0 references
    makespan
    0 references
    approximation algorithm
    0 references
    performance ratio vector
    0 references

    Identifiers