A contribution to the stochastic flow shop scheduling problem.
From MaRDI portal
Recommendations
- On heuristic solutions for the stochastic flowshop scheduling problem
- scientific article; zbMATH DE number 718710
- The convergence of stochastic algorithms solving flow shop scheduling
- On Pinedo's Conjecture for Scheduling in a Stochastic Flow Shop
- Technical note The stochastic flowshop makespan: some further results
- A randomized algorithm for flow shop scheduling
- Stochastic flowshop no-wait scheduling
- A stochastic permutation-flowshop scheduling problem minimizing in distribution the schedule length
- Stochastically minimizing the makespan in flow shops
Cites work
- A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
- A review of the static, stochastic job sequencing literature
- An Evaluation of Flow Shop Sequencing Heuristics
- Equation of state calculations by fast computing machines
- scientific article; zbMATH DE number 5345853 (Why is no real title available?)
- scientific article; zbMATH DE number 4048925 (Why is no real title available?)
- scientific article; zbMATH DE number 3780553 (Why is no real title available?)
- scientific article; zbMATH DE number 26827 (Why is no real title available?)
- scientific article; zbMATH DE number 605729 (Why is no real title available?)
- Metaheuristics: A bibliography
- Minimizing the Expected Makespan in Stochastic Flow Shops
- Minimizing total expected costs in the two-machine, stochastic flow shop
- Minimizing variation in stochastic flow shop
- nx2 flowshop sequencing problem with random processing times
- On Johnson's Two-Machine Flow Shop with Random Processing Times
- On three-machine flow shops with random job processing times
- 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
- Sequencing with Random Service Times
- Stochastically minimizing the makespan in flow shops
- Stochastically minimizing the makespan in two-machine flow shops without blocking
Cited in
(23)- 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
- Scheduling in stochastic flowshops with independent setup, processing and removal times
- Hybrid flow shop scheduling with sequence dependent family setup time and uncertain due dates
- A polynomial time heuristic for the two-machine flowshop scheduling problem with setup times and random processing times
- Markovian analysis for performance evaluation and scheduling in m machine stochastic flow-shop with buffers of any capacity
- Heuristic for stochastic online flowshop problem with preemption penalties
- Multi-objective flow shop scheduling problem with stochastic parameters: fuzzy goal programming approach
- A compact reformulation of the two-stage robust resource-constrained project scheduling problem
- On heuristic solutions for the stochastic flowshop scheduling problem
- The stochastic flowshop makespan. Part I. Some general results for the buffered case
- The stochastic flowshop makespan. Part II. Some general results for the unbuffered case
- Optimal parallel machine allocation problem in IC packaging using IC-PSO: an empirical study
- scientific article; zbMATH DE number 1910926 (Why is no real title available?)
- Stochastic Minimization of the Makespan in Flow Shops with Identical Machines and Buffers of Arbitrary Size
- 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
- Min–max version of single-machine scheduling with generalized due dates under scenario-based uncertainty
- Target-oriented robust satisficing models for the single machine scheduling problems with release time
- Fifty years of research in scheduling -- theory and applications
- Group shops scheduling with makespan criterion subject to random release dates and processing times
- Two-machine stochastic flow shops with blocking and the traveling salesman problem
- Considering scheduling and preventive maintenance in the flowshop sequencing problem
This page was built for publication: A contribution to the stochastic flow shop scheduling problem.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1410626)
