A two-machine flowshop problem with two agents (Q709115): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
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.cor.2010.04.002 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2081899110 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3525911 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Problems with Two Competing Agents / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequencing games / 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: A multiple-criterion model for machine scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the scheduling with two families of jobs / 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: 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: 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: Two-Agent Scheduling with Linear Deteriorating Jobs on a Single Machine / 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: Approximation algorithms for multi-agent scheduling to minimize total weighted completion time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact, Approximate, and Guaranteed Accuracy Algorithms for the Flow-Shop Problem <i>n / 2 / F / F¯</i> / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Flowshop and Jobshop Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-machine flowshop scheduling to minimize mean flow time / rank
 
Normal rank
Property / cites work
 
Property / cites work: An asymptotic two-phase algorithm to minimize total flow time for a two-machine flowshop / rank
 
Normal rank
Property / cites work
 
Property / cites work: The two-machine total completion time flow shop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing Total Completion Time in a Two-Machine Flowshop: Analysis of Special Cases / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved branch-and-bound algorithm for the two machine total completion time flow shop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing total completion time in two-machine flow shops with exact delays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4124328 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization by Simulated Annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dual algorithm for the one-machine scheduling problem / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 08:55, 3 July 2024

scientific article
Language Label Description Also known as
English
A two-machine flowshop problem with two agents
scientific article

    Statements

    A two-machine flowshop problem with two agents (English)
    0 references
    0 references
    15 October 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    scheduling
    0 references
    two-machine flowshop
    0 references
    two-agent
    0 references
    total completion time
    0 references
    0 references
    0 references
    0 references
    0 references