On heuristic solutions for the stochastic flowshop scheduling problem

DOI10.1016/J.EJOR.2015.05.006MaRDI QIDQ319784zbMATH OpenOpenAlexFDO

Authors Jose M. Framinan, Paz Perez-Gonzalez

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

flowshopheuristicsmakespan objectiveschedulingstochastic

Mathematics Subject Classification ID

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

Recommendations

• A contribution to the stochastic flow shop scheduling problem.
• Determining the optimal sequences and the distributional properties of their completion times in stochastic flow shops
• Scheduling in stochastic flowshops with independent setup, processing and removal times
• On Minimizing the Expected Makespan and Flow Time in Stochastic Flow Shops with Blocking
• Heuristic for stochastic online flowshop problem with preemption penalties

Cites work

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

Cited in

(14)

• A contribution to the stochastic flow shop scheduling problem.
• Case study on statistically estimating minimum makespan for flow line scheduling problems.
• A clearing function based bid-price approach to integrated order acceptance and release decisions
• Heuristic for stochastic online flowshop problem with preemption penalties
• An uncertain programming model for single machine scheduling problem with batch delivery
• Determining the optimal sequences and the distributional properties of their completion times in stochastic flow shops
• Exact solutions for the two-machine robust flow shop with budgeted uncertainty
• A survey and evaluation of static flowshop scheduling heuristics
• 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 distributionally robust approach for the two-machine permutation flow shop scheduling
• Efficient solutions to the \(m\)-machine robust flow shop under budgeted uncertainty
• Fifty years of research in scheduling -- theory and applications
• Group shops scheduling with makespan criterion subject to random release dates and processing times

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q319784)