Maximizing set function formulation of two scheduling problems
- 1 September 1992
- journal article
- Published by Springer Nature in Mathematical Methods of Operations Research
- Vol. 36 (5) , 409-416
- https://doi.org/10.1007/bf01415757
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due DateOperations Research, 1991
- Sequencing with Earliness and Tardiness Penalties: A ReviewOperations Research, 1990
- Survey of scheduling research involving due date determination decisionsEuropean Journal of Operational Research, 1989
- Canonical decompositions of symmetric submodular systemsDiscrete Applied Mathematics, 1983
- An analysis of approximations for maximizing submodular set functions—IMathematical Programming, 1978
- Best Algorithms for Approximating the Maximum of a Submodular Set FunctionMathematics of Operations Research, 1978
- Algorithms for Scheduling Independent TasksJournal of the ACM, 1976
- Scheduling independent tasks to reduce mean finishing timeCommunications of the ACM, 1974
- Scheduling Independent Tasks on Parallel ProcessorsManagement Science, 1966
- Bounds for the Optimal Scheduling of n Jobs on m ProcessorsManagement Science, 1964