Single machine batch scheduling with two competing agents to minimize total flowtime (Q420859): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
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: A survey of scheduling problems with setup times or costs / 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: 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: Two-Agent Scheduling with Linear Deteriorating Jobs 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: A single machine batch scheduling problem with bounded batch size / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing flow-time on a single machine with integer batch sizes / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-pass batching algorithms for the one-machine problem / 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: Batching in single operation manufacturing systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial algorithm for a one machine batching problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling two agents with controllable processing times / rank
 
Normal rank

Latest revision as of 06:57, 5 July 2024

scientific article
Language Label Description Also known as
English
Single machine batch scheduling with two competing agents to minimize total flowtime
scientific article

    Statements

    Single machine batch scheduling with two competing agents to minimize total flowtime (English)
    0 references
    0 references
    0 references
    23 May 2012
    0 references
    0 references
    two-agent scheduling
    0 references
    batch scheduling
    0 references
    single machine
    0 references
    flowtime
    0 references
    0 references