Two-dedicated-machine scheduling problem with precedence relations to minimize makespan (Q2448211): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Evgeny R. Gafarov / rank
Normal rank
 
Property / author
 
Property / author: Alexandre Dolgui / rank
Normal rank
 
Property / author
 
Property / author: Evgeny R. Gafarov / rank
 
Normal rank
Property / author
 
Property / author: Alexandre Dolgui / 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.1007/s11590-013-0671-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1964627392 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling incompatible tasks on two machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unknown Input Observers Designed by Eigenstructure Assignment / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the two-stage hybrid flow shop problem with dedicated machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximization problems in single machine scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: State-of-the-art exact and heuristic solution procedures for simple assembly line balancing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Survey of Exact Algorithms for the Simple Assembly Line Balancing Problem / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:53, 8 July 2024

scientific article
Language Label Description Also known as
English
Two-dedicated-machine scheduling problem with precedence relations to minimize makespan
scientific article

    Statements