Scheduling onM parallel machines subject to random breakdowns to minimize expected mean flow time
- 1 August 1994
- journal article
- research article
- Published by Wiley in Naval Research Logistics (NRL)
- Vol. 41 (5) , 677-682
- https://doi.org/10.1002/1520-6750(199408)41:5<677::aid-nav3220410509>3.0.co;2-7
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Stochastic Single Machine Scheduling with Quadratic Early-Tardy PenaltiesOperations Research, 1993
- A state-of-the-art review of parallel-machine scheduling researchEuropean Journal of Operational Research, 1990
- Scheduling stochastic jobs with due dates on parallel machinesEuropean Journal of Operational Research, 1990
- Optimal Scheduling of Jobs with Exponential Service Times on Identical Parallel ProcessorsOperations Research, 1989
- Recent Developments in Deterministic Sequencing and Scheduling: A SurveyPublished by Springer Nature ,1982
- Scheduling tasks with exponential service times on non-identical processors to minimize various cost functionsJournal of Applied Probability, 1980
- Scheduling tasks with exponential service times on parallel processorsJournal of Applied Probability, 1979
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a SurveyPublished by Elsevier ,1979
- Exact and Approximate Algorithms for Scheduling Nonidentical ProcessorsJournal of the ACM, 1976
- Technical Note—Minimizing Average Flow Time with Parallel MachinesOperations Research, 1973