Scheduling on a two-machine flowshop subject to random breakdowns with a makespan objective function
- 2 March 1995
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 81 (2) , 376-387
- https://doi.org/10.1016/0377-2217(93)e0318-r
Abstract
No abstract availableThis publication has 12 references indexed in Scilit:
- Scheduling onM parallel machines subject to random breakdowns to minimize expected mean flow timeNaval Research Logistics (NRL), 1994
- Stochastic Single Machine Scheduling with Quadratic Early-Tardy PenaltiesOperations Research, 1993
- Single-machine scheduling subject to stochastic breakdownsNaval Research Logistics (NRL), 1990
- On Johnson's Two-Machine Flow Shop with Random Processing TimesOperations Research, 1986
- Schedulingn nonoverlapping jobs and two stochastic jobs in a flow shopNaval Research Logistics Quarterly, 1986
- Stochastically minimizing the makespan in flow shopsNaval Research Logistics Quarterly, 1984
- Minimizing total expected costs in the two-machine, stochastic flow shopOperations Research Letters, 1983
- Minimizing the Expected Makespan in Stochastic Flow ShopsOperations Research, 1982
- Scheduling jobs, with exponentially distributed processing times, on two machines of a flow shopNaval Research Logistics Quarterly, 1973
- Optimal two‐ and three‐stage production schedules with setup times includedNaval Research Logistics Quarterly, 1954