Scheduling in stochastic flowshops with independent setup, processing and removal times
From MaRDI portal
Publication:1366705
DOI10.1016/S0305-0548(97)00006-3zbMATH Open0893.90084OpenAlexW2068337065MaRDI QIDQ1366705FDOQ1366705
Authors: Ali Allahverdi 
Publication date: 17 September 1997
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0305-0548(97)00006-3
Recommendations
- scientific article; zbMATH DE number 718710
- Scheduling a two-stage hybrid flowshop with separable setup and removal times
- Stochastic flowshop no-wait scheduling
- A contribution to the stochastic flow shop scheduling problem.
- Stochastic Flow-Shop Scheduling with Lateness-Related Performance Measures
- Job lateness in flowshops with setup and removal times separated
- A holonic approach to flexible flow shop scheduling under stochastic processing times
- On Pinedo's Conjecture for Scheduling in a Stochastic Flow Shop
Cites Work
- Two-machine proportionate flowshop scheduling with breakdowns to minimize maximum lateness
- On Johnson's Two-Machine Flow Shop with Random Processing Times
- Two-machine ordered flowshop scheduling under random breakdowns
- Two-Stage Production Scheduling with Separated Set-up Times and Stochastic Breakdowns
- Single-machine scheduling subject to stochastic breakdowns
- Minimizing the Expected Makespan in Stochastic Flow Shops
- Sequency on two and three machines with setup, processing and removal times separated
- Sequencing n jobs on two machines with setup, processing and removal times separated
- Stochastically minimizing the makespan in flow shops
- Scheduling on a two-machine flowshop subject to random breakdowns with a makespan objective function
- Schedulingn nonoverlapping jobs and two stochastic jobs in a flow shop
- Stochastic Minimization of the Makespan in Flow Shops with Identical Machines and Buffers of Arbitrary Size
Cited In (17)
- An immune algorithm for scheduling a hybrid flow shop with sequence-dependent setup times and machines with random breakdowns
- A new heuristic and dominance relations for no-wait flowshops with setups
- Two-machine flowshop group scheduling problem
- Two-machine ordered flowshop scheduling under random breakdowns
- Two-machine flowshop minimum-length scheduling problem with random and bounded processing times
- Flowshop-scheduling problems with makespan criterion: a review
- A heuristic approach to minimize expected makespan in open shops subject to stochastic processing times and failures
- Title not available (Why is that?)
- Two-stage no-wait scheduling models with setup and removal times separated
- Total flowtime in no-wait flowshops with separated setup times.
- A bicriteria flowshop scheduling problem with setup times
- Scheduling under machine breakdown in a continuous process industry
- Stochastically minimizing total flowtime in flowshops with no waiting space
- Two-machine flowshop scheduling problem to minimize makespan or total completion time with random and bounded setup times
- Minimizing the makespan for the two-machine flow shop scheduling problem with random breakdown
- Master disassembly scheduling in a remanufacturing system with stochastic routings
- A two-machine flowshop scheduling problem with a separated maintenance constraint
This page was built for publication: Scheduling in stochastic flowshops with independent setup, processing and removal times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1366705)
