A backward approach in list scheduling algorithms for multi-machine tardiness problems (Q1891242): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q3938812 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Survey of Scheduling Rules / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general search sequencing rule for job shop sequencing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hu's precedence tree scheduling algorithm: A simple proof / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Opposing Forests / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-Time Algorithms for Scheduling on Parallel Processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Equal-Length Tasks Under Treelike Precedence Constraints to Minimize Maximum Lateness / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Job Shop Scheduling by Simulated Annealing / rank
 
Normal rank

Revision as of 13:40, 23 May 2024

scientific article
Language Label Description Also known as
English
A backward approach in list scheduling algorithms for multi-machine tardiness problems
scientific article

    Statements

    A backward approach in list scheduling algorithms for multi-machine tardiness problems (English)
    0 references
    0 references
    13 December 1995
    0 references
    list scheduling
    0 references
    precedence relationships among operations
    0 references
    backward approach
    0 references

    Identifiers