A (\(\frac {4}{3}\))-approximation algorithm for a special case of the two machine flow shop problem with several availability constraints (Q732786): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s11590-009-0137-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2058254191 / 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: Non-preemptive two-machine open shop scheduling with non-availability constraints / 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: Two-machine flowshop scheduling with consecutive availability constraints / 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: Two-machine flow shops with limited machine availability / 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: 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: An FPTAS for scheduling a two-machine flowshop with one unavailability interval / rank
 
Normal rank

Latest revision as of 02:00, 2 July 2024

scientific article
Language Label Description Also known as
English
A (\(\frac {4}{3}\))-approximation algorithm for a special case of the two machine flow shop problem with several availability constraints
scientific article

    Statements

    A (\(\frac {4}{3}\))-approximation algorithm for a special case of the two machine flow shop problem with several availability constraints (English)
    0 references
    0 references
    15 October 2009
    0 references
    flow shop scheduling
    0 references
    availability constraint
    0 references
    approximation algorithms
    0 references
    error bound
    0 references

    Identifiers