Markovian analysis for performance evaluation and scheduling in \(m\) machine stochastic flow-shop with buffers of any capacity

DOI10.1016/j.ejor.2003.08.032zbMath1067.90042OpenAlexW2054079709MaRDI QIDQ1887781

Sylvie Norre, Michel Gourgand, Nathalie Grangeon

Publication date: 22 November 2004

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

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

zbMATH Keywords

SchedulingMarkovian analysisFlow-shopLimited buffersNo buffer

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Markov and semi-Markov decision processes (90C40)

Related Items (8)

RETRACTED ARTICLE: Approach towards problem solving on single machine scheduling with unequal release dates and learning effect ⋮ Minimization of the total weighted tardiness on a single machine scheduling problem with a position based learning effect and unequal release dates ⋮ Markovian analysis for performance evaluation and scheduling in \(m\) machine stochastic flow-shop with buffers of any capacity ⋮ Mixed binary integer programming formulations for the flow shop scheduling problems. A case study: ISD projects scheduling ⋮ An effective hybrid DE-based algorithm for multi-objective flow shop scheduling with limited buffers ⋮ An effective hybrid PSO-based algorithm for flow shop scheduling with limited buffers ⋮ Differential evolution metaheuristics for distributed limited-buffer flowshop scheduling with makespan criterion ⋮ Histogram based bounds and approximations for production lines

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A review of the static, stochastic job sequencing literature
• A contribution to the stochastic flow shop scheduling problem.
• On three-machine flow shops with random job processing times
• Stochastically minimizing the makespan in two-machine flow shops without blocking
• Minimizing total expected costs in the two-machine, stochastic flow shop
• Markovian analysis for performance evaluation and scheduling in \(m\) machine stochastic flow-shop with buffers of any capacity
• Metaheuristics: A bibliography
• Optimal two- and three-stage production schedules with setup times included
• The interchangeability of ·/M/1 queues in series
• On Johnson's Two-Machine Flow Shop with Random Processing Times
• Minimizing the Expected Makespan in Stochastic Flow Shops
• Les problèmes d'ordonnancement
• Markov and Markov-Regenerative <scp>pert</scp> Networks
• Equation of State Calculations by Fast Computing Machines
• Scheduling jobs, with exponentially distributed processing times, on two machines of a flow shop

This page was built for publication: Markovian analysis for performance evaluation and scheduling in \(m\) machine stochastic flow-shop with buffers of any capacity