An improved algorithm for the two machine flow shop problem with several availability constraints (Q607877): 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/s10288-010-0119-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2069307052 / 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: 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: 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: 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 13:47, 3 July 2024

scientific article
Language Label Description Also known as
English
An improved algorithm for the two machine flow shop problem with several availability constraints
scientific article

    Statements

    An improved algorithm for the two machine flow shop problem with several availability constraints (English)
    0 references
    0 references
    0 references
    6 December 2010
    0 references
    flow shop scheduling
    0 references
    availability constraint
    0 references
    heuristics
    0 references
    worst case analysis
    0 references
    polynomially solvable case
    0 references

    Identifiers