A metaheuristic for the fixed job scheduling problem under spread time constraints (Q2654393): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Interval scheduling on identical machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spread time considerations in operational fixed job scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4289899 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Fixed Job Schedule Problem with Spread-Time Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Fixed Job Schedule Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theoretical Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact and approximation algorithms for the operational fixed interval scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two heuristics for the one-dimensional bin-packing problem / rank
 
Normal rank

Latest revision as of 08:49, 2 July 2024

scientific article
Language Label Description Also known as
English
A metaheuristic for the fixed job scheduling problem under spread time constraints
scientific article

    Statements

    A metaheuristic for the fixed job scheduling problem under spread time constraints (English)
    0 references
    0 references
    0 references
    0 references
    15 January 2010
    0 references
    fixed job scheduling
    0 references
    spread time constraints
    0 references
    genetic algorithms
    0 references

    Identifiers