A polynomial-time approximation scheme for the two machine flow shop problem with several availability constraints (Q691393): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s11590-011-0281-7 / rank
Normal rank
 
Property / cites work
 
Property / cites work: An improved approximation algorithm for two-machine flow shop scheduling with an availability constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved heuristic for two-machine flowshop scheduling with an availability constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Encyclopedia of Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A (\(\frac {4}{3}\))-approximation algorithm for a special case of the two machine flow shop problem with several availability constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved algorithm for the two machine flow shop problem with several availability constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved heuristic for two-machine flow shop scheduling with an availability constraint and nonresumable jobs / 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: Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-machine flowshop scheduling with availability constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation results for flow shop scheduling problems with machine availability constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-machine flow shops with limited machine availability / rank
 
Normal rank
Property / cites work
 
Property / cites work: An FPTAS for scheduling a two-machine flowshop with one unavailability interval / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S11590-011-0281-7 / rank
 
Normal rank

Latest revision as of 00:52, 10 December 2024

scientific article
Language Label Description Also known as
English
A polynomial-time approximation scheme for the two machine flow shop problem with several availability constraints
scientific article

    Statements

    A polynomial-time approximation scheme for the two machine flow shop problem with several availability constraints (English)
    0 references
    0 references
    30 November 2012
    0 references
    flow shop
    0 references
    scheduling
    0 references
    availability constraint
    0 references
    approximation scheme
    0 references

    Identifiers