A 3/2-approximation algorithm for two-machine flow-shop sequencing subject to release dates. (Q5954096): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Two-Machine No-Wait Flow Shop Scheduling with Missing Operations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4231913 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal two- and three-stage production schedules with setup times included / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new polynomial-time algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3995531 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4124328 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of Heuristics for Two-Machine Flow-Shop Sequencing Subject to Release Dates / rank
 
Normal rank

Revision as of 21:33, 3 June 2024

scientific article; zbMATH DE number 1698522
Language Label Description Also known as
English
A 3/2-approximation algorithm for two-machine flow-shop sequencing subject to release dates.
scientific article; zbMATH DE number 1698522

    Statements

    A 3/2-approximation algorithm for two-machine flow-shop sequencing subject to release dates. (English)
    0 references
    0 references
    0 references
    0 references
    30 January 2002
    0 references
    Scheduling
    0 references
    Flow shop
    0 references
    Release dates
    0 references
    Approximation algorithm
    0 references

    Identifiers