Minimizing mean flow-time with parallel processors and resource constraints
- 1 September 1987
- journal article
- Published by Springer Nature in Acta Informatica
- Vol. 24 (5) , 513-524
- https://doi.org/10.1007/bf00263292
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Scheduling tasks on two processors with deadlines and additional resourcesEuropean Journal of Operational Research, 1986
- Scheduling Multiprocessor Tasks to Minimize Schedule LengthIEEE Transactions on Computers, 1986
- The NP-completeness column: An ongoing guideJournal of Algorithms, 1983
- A linear time algorithm for restricted bin packing and scheduling problemsOperations Research Letters, 1983
- Scheduling subject to resource constraints: classification and complexityDiscrete Applied Mathematics, 1983
- Deadline scheduling of tasks with ready times and resource constraintsInformation Processing Letters, 1979
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a SurveyPublished by Elsevier ,1979
- Complexity Results for Multiprocessor Scheduling under Resource ConstraintsSIAM Journal on Computing, 1975
- Scheduling independent tasks to reduce mean finishing timeCommunications of the ACM, 1974
- Scheduling with Deadlines and Loss FunctionsManagement Science, 1959