Maximizing set function formulation of two scheduling problems

DOI10.1007/BF01415757zbMath0761.90055MaRDI QIDQ4015963

Bahram Alidaee

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)

zbMATH Keywords

single machineheuristic algorithmsubmodular set functionparallel identical processorstotal weighted earliness and tardinessweighted mean flow time

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (1)

0-1 Quadratic programming approach for optimum solutions of two scheduling problems

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

This page was built for publication: Maximizing set function formulation of two scheduling problems