An \(O(n^2)\) algorithm for time-bound adjustments for the cumulative scheduling problem (Q2184136): Difference between revisions

From MaRDI portal
Changed an 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.1016/j.ejor.2020.03.079 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3016605981 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Energetic reasoning for energy-constrained scheduling with a continuous resource / rank
 
Normal rank
Property / cites work
 
Property / cites work: Satisfiability tests and time-bound adjustments for cumulative scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4217293 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear programming and constraint propagation-based lower bound for the RCPSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: The one-machine sequencing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling jobs with release dates and tails on identical machines to minimize the makespan / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adjustment of heads and tails for the job-shop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Jackson's pseudo preemptive schedule for the \(Pm/r_i, q_i/C_{\text{max}}\) scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Jackson's pseudo-preemptive schedule and cumulative scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cumulative scheduling with variable task profiles and concave piecewise linear processing rate functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A \(O(n\log ^2 n)\) checker and \(O(n^2\log n)\) filtering algorithm for the energetic reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Timetable Edge Finding Filtering Algorithm for Discrete Cumulative Resources / rank
 
Normal rank

Latest revision as of 18:53, 22 July 2024

scientific article
Language Label Description Also known as
English
An \(O(n^2)\) algorithm for time-bound adjustments for the cumulative scheduling problem
scientific article

    Statements

    An \(O(n^2)\) algorithm for time-bound adjustments for the cumulative scheduling problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    27 May 2020
    0 references
    scheduling
    0 references
    cumulative resource
    0 references
    energetic reasoning
    0 references
    adjustment
    0 references

    Identifiers