A stochastic permutation-flowshop scheduling problem minimizing in distribution the schedule length

DOI10.1016/0167-6377(84)90050-6zbMATH Open0543.90060OpenAlexW2037521022MaRDI QIDQ796444FDOQ796444

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

zbMATH Keywords

stochastic schedulingminimization of schedule lengthstochastic permutation-flowshop

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Optimal issuing policies under stochastic field lives

Cited In (3)

• Makespan distribution of permutation flowshop schedules
• A contribution to the stochastic flow shop scheduling problem.
• Min–max regret criterion-based robust model for the permutation flow-shop scheduling problem

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)