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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 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-011-0281-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2002962759 / 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
links / mardi / namelinks / mardi / name
 

Latest revision as of 22:15, 5 July 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