A heuristic for minimizing the expected makespan in two-machine flow shops with consistent coefficients of variation (Q2572847): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Pawel Jan Kalczynski / rank
Normal rank
 
Property / author
 
Property / author: Pawel Jan Kalczynski / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: RANLUX / rank
 
Normal rank
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.1016/j.ejor.2004.08.045 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1979938554 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-machine flowshop minimum-length scheduling problem with random and bounded processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evaluating Project Completion Times When Activity Times are Erlang Distributed / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling jobs, with exponentially distributed processing times, on two machines of a flow shop / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determining the optimal sequences and the distributional properties of their completion times in stochastic flow shops / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Flowshop and Jobshop Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: RANLUX: A Fortran implementation of the high-quality pseudorandom number generator of Lüscher / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4315010 / 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: Stochastically minimizing the makespan in two-machine flow shops without blocking / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Johnson's Two-Machine Flow Shop with Random Processing Times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3525911 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Makespan-related criteria for comparing schedules in stochastic environments / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalized Johnson's rule for stochastic assembly systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4301147 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:12, 11 June 2024

scientific article
Language Label Description Also known as
English
A heuristic for minimizing the expected makespan in two-machine flow shops with consistent coefficients of variation
scientific article

    Statements

    A heuristic for minimizing the expected makespan in two-machine flow shops with consistent coefficients of variation (English)
    0 references
    0 references
    0 references
    4 November 2005
    0 references
    Stochastic scheduling
    0 references
    Flow shop
    0 references
    Expected makespan
    0 references
    Weibull distribution
    0 references
    Coefficient of variation
    0 references
    Heuristic
    0 references

    Identifiers