On heuristic solutions for the stochastic flowshop scheduling problem

DOI10.1016/J.EJOR.2015.05.006zbMath1346.90403OpenAlexW2118796689MaRDI QIDQ319784

Paz Perez-Gonzalez, Jose M. Framinan

Publication date: 6 October 2016

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2015.05.006

zbMATH Keywords

heuristicsschedulingflowshopstochasticmakespan objective

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Stochastic scheduling theory in operations research (90B36)

Related Items (5)

Exact solutions for the two-machine robust flow shop with budgeted uncertainty ⋮ Shop scheduling in manufacturing environments: a review ⋮ Robust permutation flow shop total weighted completion time problem: solution and application to the oil and gas industry ⋮ A clearing function based bid-price approach to integrated order acceptance and release decisions ⋮ An uncertain programming model for single machine scheduling problem with batch delivery

Cites Work

• New hard benchmark for flowshop scheduling problems minimising makespan
• A contribution to the stochastic flow shop scheduling problem.
• A comprehensive review and evaluation of permutation flowshop heuristics
• Benchmarks for basic scheduling problems
• Comparison of heuristics for flowtime minimisation in permutation flowshops
• A heuristic for minimizing the expected makespan in two-machine flow shops with consistent coefficients of variation
• Johnson's problem with stochastic processing times and optimal service level
• Optimal two- and three-stage production schedules with setup times included
• An Evaluation of Flow Shop Sequencing Heuristics
• A review and classification of heuristics for permutation flow-shop scheduling with makespan objective
• Flowshop-scheduling problems with makespan criterion: a review
• A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
• Scheduling jobs, with exponentially distributed processing times, on two machines of a flow shop

This page was built for publication: On heuristic solutions for the stochastic flowshop scheduling problem