A decomposition algorithm for the single machine total tardiness problem (Q1838424): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Finding an Optimal Sequence by Dynamic Programming: An Extension to Precedence-Related Tasks / 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: A dual algorithm for the one-machine scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4124332 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing Total Costs in One-Machine Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Programming Solution of Sequencing Problems with Precedence Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the <i>N</i>-Job One-Machine, Sequence-Independent Scheduling Problem with Tardiness Penalties: A Branch-Bound Solution / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid algorithm for the one machine sequencing problem to minimize total tardiness / rank
 
Normal rank

Latest revision as of 17:30, 13 June 2024

scientific article
Language Label Description Also known as
English
A decomposition algorithm for the single machine total tardiness problem
scientific article

    Statements

    Identifiers