A stochastic permutation-flowshop scheduling problem minimizing in distribution the schedule length
From MaRDI portal
Publication:796444
DOI10.1016/0167-6377(84)90050-6zbMATH Open0543.90060OpenAlexW2037521022MaRDI QIDQ796444FDOQ796444
Authors: Igal Adiri, Esther Frostig 
Publication date: 1984
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-6377(84)90050-6
Recommendations
- On Optimal Permutation Scheduling in Stochastic Proportionate Flowshops
- Three-machine flowshop stochastic scheduling to minimize distribution of schedule length
- Stochastically minimizing the makespan in flow shops
- Publication:3481475
- On Minimizing the Expected Makespan and Flow Time in Stochastic Flow Shops with Blocking
Cites Work
Cited In (13)
- On Minimizing the Expected Makespan and Flow Time in Stochastic Flow Shops with Blocking
- On Optimal Permutation Scheduling in Stochastic Proportionate Flowshops
- Makespan distribution of permutation flowshop schedules
- Probabilistic Analysis of a Machine Scheduling Problem
- Stochastic flowshop no-wait scheduling
- On Pinedo's Conjecture for Scheduling in a Stochastic Flow Shop
- Three-machine flowshop stochastic scheduling to minimize distribution of schedule length
- Markovian analysis for performance evaluation and scheduling in \(m\) machine stochastic flow-shop with buffers of any capacity
- A contribution to the stochastic flow shop scheduling problem.
- Stochastically minimizing the makespan in flow shops
- Min–max regret criterion-based robust model for the permutation flow-shop scheduling problem
- Title not available (Why is that?)
- Schedulingn nonoverlapping jobs and two stochastic jobs in a flow shop
This page was built for publication: A stochastic permutation-flowshop scheduling problem minimizing in distribution the schedule length
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q796444)
