Time-of-use scheduling problem with equal-length jobs (Q6111939): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: An O\((n^4)\) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ten notes on equal-processing-time scheduling: at the frontiers of solvability in polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preemptive scheduling of equal-length jobs to maximize weighted throughput. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4859840 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stability of service under time-of-use pricing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with time-of-use costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal algorithms for scheduling under time-of-use tariffs / 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: Algorithms for Cost-Aware Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Knapsack-like scheduling problems, the Moore-Hodgson algorithm and the `Tower of Sets' property / rank
 
Normal rank
Property / cites work
 
Property / cites work: An <i>n</i> Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity and algorithms for min cost and max profit scheduling under time-of-use electricity tariffs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with variable time slot costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Calibration scheduling with time slot cost / rank
 
Normal rank
Property / cites work
 
Property / cites work: On scheduling with non-increasing time slot cost to minimize total weighted completion time / rank
 
Normal rank

Latest revision as of 11:59, 2 August 2024

scientific article; zbMATH DE number 7722828
Language Label Description Also known as
English
Time-of-use scheduling problem with equal-length jobs
scientific article; zbMATH DE number 7722828

    Statements

    Time-of-use scheduling problem with equal-length jobs (English)
    0 references
    4 August 2023
    0 references
    time-of-use
    0 references
    scheduling
    0 references
    dynamic programming
    0 references
    uniform processing time
    0 references

    Identifiers