Tight complexity analysis of the relocation problem with arbitrary release dates (Q638514): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Scheduling subject to resource constraints: Classification and complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resource-constrained project scheduling: Notation, classification, models, and methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Johnson's rule, composite jobs and the relocation problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3821925 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resource-constrained project scheduling: A survey of recent developments. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal two- and three-stage production schedules with setup times included / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast feasibility test for relocation problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On relocation problems with multiple identical working crews / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the total weighted completion time in the relocation problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Exact Algorithm for the Resource-Constrained Project Scheduling Problem Based on a New Mathematical Formulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planning and Scheduling in Manufacturing and Services / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial algorithms for single machine scheduling problems with financial constraints / rank
 
Normal rank

Latest revision as of 11:21, 4 July 2024

scientific article
Language Label Description Also known as
English
Tight complexity analysis of the relocation problem with arbitrary release dates
scientific article

    Statements

    Tight complexity analysis of the relocation problem with arbitrary release dates (English)
    0 references
    0 references
    0 references
    0 references
    12 September 2011
    0 references
    relocation problem
    0 references
    resource constraints
    0 references
    release dates
    0 references
    makespan
    0 references
    NP-hardness
    0 references
    multi-parametric dynamic programming
    0 references

    Identifiers