Maximizing set function formulation of two scheduling problems
From MaRDI portal
Publication:4015963
DOI10.1007/BF01415757zbMath0761.90055MaRDI QIDQ4015963
Publication date: 12 November 1992
Published in: [https://portal.mardi4nfdi.de/entity/Q3031760 ZOR Zeitschrift f�r Operations Research Methods and Models of Operations Research] (Search for Journal in Brave)
single machineheuristic algorithmsubmodular set functionparallel identical processorstotal weighted earliness and tardinessweighted mean flow time
Related Items
Cites Work
- Canonical decompositions of symmetric submodular systems
- Survey of scheduling research involving due date determination decisions
- Sequencing with Earliness and Tardiness Penalties: A Review
- Maximising Real-Valued Submodular Functions: Primal and Dual Heuristics for Location Problems
- Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date
- Algorithms for Scheduling Independent Tasks
- An analysis of approximations for maximizing submodular set functions—I
- Best Algorithms for Approximating the Maximum of a Submodular Set Function
- Scheduling independent tasks to reduce mean finishing time
