Scheduling jobs within time windows on identical parallel machines: New model and algorithms (Q1388825): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Scheduling jobs with fixed start and end times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5615282 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A state-of-the-art review of parallel-machine scheduling research / rank
 
Normal rank
Property / cites work
 
Property / cites work: Games of Boldness, Where the Player Performing the Hardest Task Wins / rank
 
Normal rank
Property / cites work
 
Property / cites work: Permutation Graphs and Transitive Graphs / 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: Planification à moyen terme de la production d'un satellite défilant et ensembles stables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal Resources for Fixed and Variable Job Schedules / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3960718 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Les problèmes d'ordonnancement / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximation algorithm for the license and shift class design problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational complexity of (maximum) shift class scheduling / rank
 
Normal rank

Revision as of 11:55, 28 May 2024

scientific article
Language Label Description Also known as
English
Scheduling jobs within time windows on identical parallel machines: New model and algorithms
scientific article

    Statements

    Scheduling jobs within time windows on identical parallel machines: New model and algorithms (English)
    0 references
    19 January 1999
    0 references
    fixed job scheduling
    0 references
    graphs
    0 references
    heuristics
    0 references
    non-preemptive jobs
    0 references
    identical parallel machines
    0 references
    0 references

    Identifiers