Low-complexity algorithms for sequencing jobs with a fixed number of job-classes (Q2564755): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Q185359 / rank
Normal rank
 
Property / author
 
Property / author: Shu-Zhong Zhang / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1999466794 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sequencing problem in the weaving industry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3686500 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling tasks with sequence-dependent processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4658190 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Traveling Salesman Problem with Many Visits to Few Cities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of a Large-Scale Traveling-Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strongly Polynomial Algorithms for the High Multiplicity Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming with a Fixed Number of Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dynamic Programming Approach for Sequencing Groups of Identical Jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3818127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Models Arising from a Flexible Manufacturing Machine, Part I: Minimization of the Number of Tool Switches / rank
 
Normal rank

Latest revision as of 10:22, 27 May 2024

scientific article
Language Label Description Also known as
English
Low-complexity algorithms for sequencing jobs with a fixed number of job-classes
scientific article

    Statements

    Low-complexity algorithms for sequencing jobs with a fixed number of job-classes (English)
    0 references
    0 references
    15 January 1997
    0 references
    0 references
    makespan
    0 references
    parallel machines
    0 references
    identical processing times
    0 references
    0 references