A heuristic algorithm for two-machine re-entrant shop scheduling (Q1290158): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(3 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: Vitaly A. Strusevich / rank
Normal rank
 
Property / author
 
Property / author: Vitaly A. Strusevich / 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.1023/a:1018927407164 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1558121634 / rank
 
Normal rank

Latest revision as of 12:07, 30 July 2024

scientific article
Language Label Description Also known as
English
A heuristic algorithm for two-machine re-entrant shop scheduling
scientific article

    Statements

    A heuristic algorithm for two-machine re-entrant shop scheduling (English)
    0 references
    10 June 1999
    0 references
    0 references
    two-machine re-entrant shop
    0 references
    maximum completion time
    0 references
    heuristic
    0 references
    worst-case performance ratio
    0 references
    0 references