Proportionate flow shop scheduling with multi-agents to maximize total gains of JIT jobs (Q1640602): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Review of the ordered and proportionate flow shop scheduling research / rank
 
Normal rank
Property / cites work
 
Property / cites work: The just-in-time scheduling problem in a flow-shop scheduling system / 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: Heterogeneous-criteria scheduling: Minimizing weighted number of tardy jobs and weighted completion time / 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: Rescheduling for New Orders / 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: Scheduling Problems with Two Competing Agents / 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: Competitive Two-Agent Scheduling and Its Applications / 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: Approximation schemes for two-machine flow shop scheduling with two agents / 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: Bounded parallel-batching scheduling with two competing agents / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-agent scheduling on a single parallel-batching machine with equal processing time and non-identical job sizes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical programming models for competitive two-agent single-machine scheduling with flexible periodic maintenance activities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-agent single-machine scheduling problem with just-in-time jobs / 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: Scheduling two job families on a single machine with two competitive agents / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-agent scheduling in a flowshop / 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 single machine scheduling / 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: Single-machine multi-agent scheduling problems with a global objective function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiagent Scheduling / 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: Single machine scheduling to minimize the number of early and tardy jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing total weighted completion time in a proportionate flow shop / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems / rank
 
Normal rank

Latest revision as of 21:53, 15 July 2024

scientific article
Language Label Description Also known as
English
Proportionate flow shop scheduling with multi-agents to maximize total gains of JIT jobs
scientific article

    Statements

    Proportionate flow shop scheduling with multi-agents to maximize total gains of JIT jobs (English)
    0 references
    0 references
    0 references
    0 references
    14 June 2018
    0 references
    multi-agent scheduling
    0 references
    JIT jobs
    0 references
    proportionate flow shop
    0 references
    FPTAS
    0 references
    0 references
    0 references

    Identifiers