Three-machine flowshop stochastic scheduling to minimize distribution of schedule length

DOI10.1002/NAV.3800320120MaRDI QIDQ3712110zbMATH OpenOpenAlexFDO

Authors Esther Frostig, Igal Adiri

Publication date 1985

Published in Naval Research Logistics Quarterly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/nav.3800320120

zbMATH Keywords

distribution of schedule lengthstochastic three-machine flowshop scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• A stochastic permutation-flowshop scheduling problem minimizing in distribution the schedule length
• On three-machine flow shops with random job processing times
• Stochastically minimizing the makespan in flow shops
• Stochastic flowshop no-wait scheduling
• On Optimal Permutation Scheduling in Stochastic Proportionate Flowshops

Cited in

(7)

• On three-machine flow shops with random job processing times
• A three-stage optimization algorithm for the stochastic parallel machine scheduling problem with adjustable production rates
• Heuristic for stochastic online flowshop problem with preemption penalties
• On Optimal Permutation Scheduling in Stochastic Proportionate Flowshops
• A three-agent scheduling problem for minimizing the flow time on two machines
• Algorithms for three-machine flowshop scheduling problem to minimize makespan with uncertain processing times
• A stochastic permutation-flowshop scheduling problem minimizing in distribution the schedule length

This page was built for publication: Three-machine flowshop stochastic scheduling to minimize distribution of schedule length

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3712110)