On heuristic solutions for the stochastic flowshop scheduling problem (Q319784): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90B36 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C59 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6633673 / rank
 
Normal rank
Property / zbMATH Keywords
 
scheduling
Property / zbMATH Keywords: scheduling / rank
 
Normal rank
Property / zbMATH Keywords
 
flowshop
Property / zbMATH Keywords: flowshop / rank
 
Normal rank
Property / zbMATH Keywords
 
stochastic
Property / zbMATH Keywords: stochastic / rank
 
Normal rank
Property / zbMATH Keywords
 
makespan objective
Property / zbMATH Keywords: makespan objective / rank
 
Normal rank
Property / zbMATH Keywords
 
heuristics
Property / zbMATH Keywords: heuristics / 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.2015.05.006 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2118796689 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Heuristic Algorithm for the <i>n</i> Job, <i>m</i> Machine Sequencing Problem / 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: An Evaluation of Flow Shop Sequencing Heuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: A review and classification of heuristics for permutation flow-shop scheduling with makespan objective / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparison of heuristics for flowtime minimisation in permutation flowshops / rank
 
Normal rank
Property / cites work
 
Property / cites work: A contribution to the stochastic flow shop scheduling problem. / 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: A heuristic for minimizing the expected makespan in two-machine flow shops with consistent coefficients of variation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Johnson's problem with stochastic processing times and optimal service level / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flowshop-scheduling problems with makespan criterion: a review / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comprehensive review and evaluation of permutation flowshop heuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarks for basic scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: New hard benchmark for flowshop scheduling problems minimising makespan / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 15:44, 12 July 2024

scientific article
Language Label Description Also known as
English
On heuristic solutions for the stochastic flowshop scheduling problem
scientific article

    Statements

    On heuristic solutions for the stochastic flowshop scheduling problem (English)
    0 references
    0 references
    0 references
    6 October 2016
    0 references
    scheduling
    0 references
    flowshop
    0 references
    stochastic
    0 references
    makespan objective
    0 references
    heuristics
    0 references

    Identifiers