An approximation algorithm based on game theory for scheduling simple linear deteriorating jobs (Q2250443): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2014.05.023 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2037527261 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the makespan with late start penalties added to processing times in a single facility scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling jobs under simple linear deterioration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-Machine Scheduling With Linear Deterioration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Deteriorating Jobs on a Single Processor / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online scheduling of simple linear deteriorating jobs to minimize the total general completion time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel-machine scheduling with simple linear deterioration to minimize total completion time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel-machine scheduling of simple linear deteriorating jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded parallel-batch scheduling on single and multi machines for deteriorating jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal algorithms for online single machine scheduling with deteriorating jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel-machine scheduling with deteriorating jobs and rejection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preemptive scheduling with simple linear deterioration on a single machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-machine scheduling with linear decreasing deterioration to minimize earliness penalties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coordination mechanisms for selfish scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Game-theoretic static load balancing for distributed systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-case equilibria / rank
 
Normal rank

Latest revision as of 17:14, 8 July 2024

scientific article
Language Label Description Also known as
English
An approximation algorithm based on game theory for scheduling simple linear deteriorating jobs
scientific article

    Statements

    An approximation algorithm based on game theory for scheduling simple linear deteriorating jobs (English)
    0 references
    0 references
    0 references
    0 references
    7 July 2014
    0 references
    approximation algorithm
    0 references
    non-cooperative game theory
    0 references
    price of anarchy
    0 references
    simple linear deterioration
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references