Approximation schemes for two-machine flow shop scheduling with two agents (Q1928514): 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.1007/s10878-011-9378-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2043831821 / 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 Lagrangian approach to single-machine scheduling problems with two competing agents / rank
 
Normal rank
Property / cites work
 
Property / cites work: A competitive scheduling problem and its relevance to UMTS channel assignment / 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: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey / 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: 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: Planning Machine Maintenance in Two-Machine Shop Scheduling / 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: A note on the scheduling with two families of jobs / rank
 
Normal rank

Latest revision as of 01:04, 6 July 2024

scientific article
Language Label Description Also known as
English
Approximation schemes for two-machine flow shop scheduling with two agents
scientific article

    Statements

    Approximation schemes for two-machine flow shop scheduling with two agents (English)
    0 references
    0 references
    0 references
    0 references
    3 January 2013
    0 references
    scheduling with two agents
    0 references
    flow shop
    0 references
    approximation scheme
    0 references

    Identifiers