Solving multiple processor and multiple resource constrained scheduling problems using a genetic algorithm approach (Q4498115): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 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.1080/00207160008804963 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2106137923 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fair on-line scheduling of a dynamic set of tasks on a single resource / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with Concurrency-Based Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity Results for Multiprocessor Scheduling under Resource Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resource constrained scheduling as generalized bin packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692508 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4079017 / rank
 
Normal rank

Latest revision as of 13:17, 30 May 2024

scientific article; zbMATH DE number 1495724
Language Label Description Also known as
English
Solving multiple processor and multiple resource constrained scheduling problems using a genetic algorithm approach
scientific article; zbMATH DE number 1495724

    Statements

    Solving multiple processor and multiple resource constrained scheduling problems using a genetic algorithm approach (English)
    0 references
    20 May 2001
    0 references
    0 references
    multiprocessor scheduling
    0 references
    genetic algorithm
    0 references
    first fit decreasing method
    0 references
    0 references