A branch, bound, and remember algorithm for the \(1|r _{i }|\sum t _{i }\) scheduling problem (Q842556): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A branch-and-bound procedure to minimize total tardiness on one machine with arbitrary release dates / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound to minimize the number of late jobs on a single machine with release time constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new tabu search procedure for an audit-scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On decomposition of the total tardiness problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993992 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some new efficient methods to solve the \(n/1/r_ i/\sum{}T_ i\) scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact method to minimize the number of tardy jobs in single machine scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing Total Tardiness on One Machine is NP-Hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-Machine Sequencing to Minimize Certain Functions of Job Tardiness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5675139 / 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: Q4124332 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A decomposition algorithm for the single machine total tardiness problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4843187 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of the single machine total tardiness problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic paradoxes of the single-machine total tardiness problem / rank
 
Normal rank

Latest revision as of 00:27, 2 July 2024

scientific article
Language Label Description Also known as
English
A branch, bound, and remember algorithm for the \(1|r _{i }|\sum t _{i }\) scheduling problem
scientific article

    Statements

    A branch, bound, and remember algorithm for the \(1|r _{i }|\sum t _{i }\) scheduling problem (English)
    0 references
    0 references
    0 references
    0 references
    25 September 2009
    0 references
    0 references
    0 references
    0 references
    0 references
    branch and bound algorithms
    0 references
    scheduling theory and algorithms
    0 references
    dynamic programming
    0 references
    0 references