Two-agent scheduling on a bounded series-batch machine to minimize makespan and maximum cost (Q2081468): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q114191393 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2022.08.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4292702007 / rank
 
Normal rank
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: Sequencing games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with or without precedence relations on a serial-batch machine to minimize makespan and maximum cost / 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: On games corresponding to sequencing situations with ready times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simultaneous optimization scheduling with two agents on an unbounded serial-batching machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved algorithms for two-agent scheduling on an unbounded serial-batching machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded serial-batching scheduling for minimizing maximum lateness and makespan / rank
 
Normal rank
Property / cites work
 
Property / cites work: Serial-batching scheduling with two agents to minimize makespan and maximum cost / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicriteria scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-agent scheduling with agent specific batches on an unbounded serial batching machine / 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: Complexities of some problems on multi-agent scheduling on a single machine / rank
 
Normal rank

Latest revision as of 10:32, 30 July 2024

scientific article
Language Label Description Also known as
English
Two-agent scheduling on a bounded series-batch machine to minimize makespan and maximum cost
scientific article

    Statements

    Two-agent scheduling on a bounded series-batch machine to minimize makespan and maximum cost (English)
    0 references
    0 references
    0 references
    0 references
    13 October 2022
    0 references
    series-batch
    0 references
    bounded
    0 references
    two-agent scheduling
    0 references
    makespan
    0 references
    maximum cost
    0 references

    Identifiers