Branch and bound algorithm for the flow shop with multiple processors (Q809880): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A Comparative Study of Flow-Shop Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with earliest start and due date constraints on multiple machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preemptive Scheduling of Independent Jobs with Release and Due Times on Open, Flow and Job Shops / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3938812 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Flowshop and Jobshop Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flowshop and Jobshop Schedules: Complexity and Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A General Bounding Scheme for the Permutation Flow-Shop Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Adaptable Scheduling Algorithm for Flexible Flow Lines / rank
 
Normal rank

Latest revision as of 09:55, 24 June 2024

scientific article
Language Label Description Also known as
English
Branch and bound algorithm for the flow shop with multiple processors
scientific article

    Statements

    Branch and bound algorithm for the flow shop with multiple processors (English)
    0 references
    0 references
    0 references
    1991
    0 references
    sequencing
    0 references
    flow shop
    0 references
    multiple processors
    0 references
    branch and bound
    0 references
    maximum completion time
    0 references
    lower bounds
    0 references

    Identifiers