Two-agent scheduling in a flowshop (Q322895): 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: 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: 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: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal two- and three-stage production schedules with setup times included / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-machine flowshop scheduling with availability constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A two-machine flowshop problem with two agents / 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: Scheduling problems with two competing agents to minimize minmax and minsum earliness measures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single machine batch scheduling with two competing agents to minimize total flowtime / 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: Two-agent scheduling to minimize the total cost / 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: Structure of a simple scheduling polyhedron / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4877166 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling two agents with controllable processing times / rank
 
Normal rank

Latest revision as of 17:11, 12 July 2024

scientific article
Language Label Description Also known as
English
Two-agent scheduling in a flowshop
scientific article

    Statements

    Two-agent scheduling in a flowshop (English)
    0 references
    7 October 2016
    0 references
    0 references
    scheduling
    0 references
    competitive agents
    0 references
    flowshop
    0 references
    approximation algorithm
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references