Unbounded parallel-batching scheduling with two competitive agents (Q2434303): 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 multiple-criterion model for machine scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3425131 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling a batching machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity results for single-machine problems with positive finish-start time-lags / 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: The Batch Loading and Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bi-criteria scheduling on a single parallel-batch machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Algorithms for Scheduling Semiconductor Burn-In Operations / 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: Parallel-machine parallel-batching scheduling with family jobs and release dates to minimize makespan / 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 note on the complexity of the problem of two-agent scheduling on a single machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: The bounded single-machine parallel-batching scheduling problem with family jobs and release dates to minimize makespan / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with batching: A review / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling batches with simultaneous job processing for two-machine shop problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal methods for batch processing problem with makespan and maximum lateness objectives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved dynamic programs for some batching problems involving the maximum lateness criterion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling two agents with controllable processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan / rank
 
Normal rank

Latest revision as of 07:32, 7 July 2024

scientific article
Language Label Description Also known as
English
Unbounded parallel-batching scheduling with two competitive agents
scientific article

    Statements

    Unbounded parallel-batching scheduling with two competitive agents (English)
    0 references
    0 references
    0 references
    5 February 2014
    0 references
    agent scheduling
    0 references
    batching machine
    0 references
    dynamic programming
    0 references
    incompatible or compatible families
    0 references
    0 references

    Identifiers