In this paper, modeling and solving of a single machine scheduling problem with a single flexible maintenance activity and stochastic maintenance activities time was considered. Also it assumes that the all activities are resumable. Chen solved and investigate complexity of this problem without probabilistic condition by Mixed binary integer programming (BIP) so we solving this problem with considering stochastic programming concepts. An example has investigated at the end chapter to show actual consequences by Lingo.
- Sequencing and scheduling,
- Flexible maintenance activity,
- Stochastic Process,
- stochastic programming
Available at: http://works.bepress.com/jafarian/7/