Minimizing makespan in a two-machine flow shop with effects of deterioration and learning (Q694178): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an 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-011-0334-y / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2116082811 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with time dependent processing times: Review and extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-machine scheduling with learning considerations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A state-of-the-art review on scheduling with learning effects / rank
 
Normal rank
Property / cites work
 
Property / cites work: A concise survey of scheduling with time-dependent processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some scheduling problems with sum-of-processing-times-based and job-position-based learning effects / rank
 
Normal rank
Property / cites work
 
Property / cites work: Encyclopedia of Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time-dependent scheduling / 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: Parallel-machine scheduling under potential disruption / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity analysis of job-shop scheduling with deteriorating jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-bound algorithm for solving a two-machine flow shop problem with deteriorating jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2753185 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4864690 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic for a new multiobjective scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-machine scheduling with nonlinear deterioration / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on single-machine scheduling with nonlinear deterioration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-machine scheduling problems with a learning effect / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on two-machine no-wait flow shop scheduling with deteriorating jobs and machine availability constraints / rank
 
Normal rank

Latest revision as of 23:11, 5 July 2024

scientific article
Language Label Description Also known as
English
Minimizing makespan in a two-machine flow shop with effects of deterioration and learning
scientific article

    Statements

    Minimizing makespan in a two-machine flow shop with effects of deterioration and learning (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    11 December 2012
    0 references
    flow shop
    0 references
    deteriorating jobs
    0 references
    learning effect
    0 references
    makespan
    0 references
    branch-and-bound algorithm
    0 references

    Identifiers