A competitive two-agent scheduling problem on parallel machines with release dates and preemption (Q460140): 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.1155/2013/124083 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2009950250 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some simple scheduling algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preemptive Scheduling with Due Dates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Independent Tasks with Due Times on a Uniform Processor System / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3217922 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Maximal “Polymatroidal” Network Flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preemptive Scheduling with Release Times, Deadlines, and Due Times / 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 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: Multi-agent scheduling on a single machine with max-form criteria / 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: A note on the scheduling with two families of 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: Scheduling problems with two competing agents to minimize minmax and minsum earliness measures / 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: Q4198056 / 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: Scheduling with Deadlines and Loss Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4058442 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple version of Karzanov's blocking flow algorithm / rank
 
Normal rank

Latest revision as of 03:21, 9 July 2024

scientific article
Language Label Description Also known as
English
A competitive two-agent scheduling problem on parallel machines with release dates and preemption
scientific article

    Statements

    A competitive two-agent scheduling problem on parallel machines with release dates and preemption (English)
    0 references
    0 references
    0 references
    13 October 2014
    0 references

    Identifiers

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