Hybrid flow-shop scheduling problems with multiprocessor task systems. (Q1410328): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4339078 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tabu search approach for the flow shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling multiprocessor tasks on three dedicated processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Multiprocessor Tasks to Minimize Schedule Length / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling independent two processor tasks on a uniform duo-processor system / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4396949 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling UET task systems with concurrency on two parallel identical processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial algorithms for resource-constrained and multiprocessor task scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of Classes of Heuristics for Scheduling a Two-Stage Flow Shop with Parallel Machines at One Stage / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling multiprocessor tasks -- An overview / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling multiprocessor tasks for mean flow time criterion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Scheduling Parallel Task Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu Search—Part I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu Search—Part II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Stage, Hybrid Flowshop Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic algorithms for the two-stage hybrid flowshop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Current trends in deterministic scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing makespan in hybrid flowshops / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concurrent Task Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The flow shop with parallel machines: A tabu search approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid three-stage flowshop problem: Efficient heuristics to minimize makespan / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some efficient heuristic methods for the flow shop sequencing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Application of the simulated annealing algorithm to the combinatorial optimization problem with permutation property: An investigation of generation mechanism / rank
 
Normal rank

Latest revision as of 11:44, 6 June 2024

scientific article
Language Label Description Also known as
English
Hybrid flow-shop scheduling problems with multiprocessor task systems.
scientific article

    Statements

    Hybrid flow-shop scheduling problems with multiprocessor task systems. (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    14 October 2003
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Complexity theory
    0 references
    Dynamic programming
    0 references
    Scheduling
    0 references
    Tabu search
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references