A contribution to the stochastic flow shop scheduling problem.
From MaRDI portal
Publication:1410626
DOI10.1016/S0377-2217(02)00835-4zbMath1053.90036OpenAlexW2038134868MaRDI QIDQ1410626
Nathalie Grangeon, Sylvie Norre, Michel Gourgand
Publication date: 14 October 2003
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(02)00835-4
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Markov and semi-Markov decision processes (90C40)
Related Items (13)
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 ⋮ Hybrid flow shop scheduling with sequence dependent family setup time and uncertain due dates ⋮ Markovian analysis for performance evaluation and scheduling in \(m\) machine stochastic flow-shop with buffers of any capacity ⋮ On heuristic solutions for the stochastic flowshop scheduling problem ⋮ Two-machine stochastic flow shops with blocking and the traveling salesman problem ⋮ A compact reformulation of the two-stage robust resource-constrained project scheduling problem ⋮ Considering scheduling and preventive maintenance in the flowshop sequencing problem ⋮ Min–max version of single-machine scheduling with generalized due dates under scenario-based uncertainty ⋮ Optimal Parallel Machine Allocation Problem in IC Packaging Using IC-PSO: An Empirical Study ⋮ A polynomial time heuristic for the two-machine flowshop scheduling problem with setup times and random processing times ⋮ A novel parallel quantum genetic algorithm for stochastic job shop scheduling ⋮ A novel competitive co-evolutionary quantum genetic algorithm for stochastic job shop scheduling problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A review of the static, stochastic job sequencing literature
- nx2 flowshop sequencing problem with random processing times
- Minimizing variation in stochastic flow shop
- 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
- Metaheuristics: A bibliography
- Optimal two- and three-stage production schedules with setup times included
- Stochastically minimizing the makespan in flow shops
- On Johnson's Two-Machine Flow Shop with Random Processing Times
- Minimizing the Expected Makespan in Stochastic Flow Shops
- An Evaluation of Flow Shop Sequencing Heuristics
- Equation of State Calculations by Fast Computing Machines
- A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
- Sequencing with Random Service Times
- Scheduling jobs, with exponentially distributed processing times, on two machines of a flow shop
This page was built for publication: A contribution to the stochastic flow shop scheduling problem.