Maximizing set function formulation of two scheduling problems

DOI10.1007/BF01415757MaRDI QIDQ4015963zbMATH OpenFDO

Authors Bahram Alidaee

Publication date 12 November 1992

Published in 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)

Recommendations

• Application of an optimization problem in max-plus algebra to scheduling problems
• Two scheduling problems of minimizing the maximum weighted completion time
• scientific article; zbMATH DE number 3984950
• Two parallel-machine scheduling problems with function constraint
• Two properties of objective function for a class of scheduling systems
• 0-1 Quadratic programming approach for optimum solutions of two scheduling problems
• scientific article; zbMATH DE number 3821427
• Exact penalty functionals in scheduling problems
• Scheduling with release dates and preemption to minimize multiple max-form objective functions
• scientific article; zbMATH DE number 2119733

Cites work

• 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
• Canonical decompositions of symmetric submodular systems
• Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date
• Maximising Real-Valued Submodular Functions: Primal and Dual Heuristics for Location Problems
• Scheduling independent tasks to reduce mean finishing time
• Sequencing with Earliness and Tardiness Penalties: A Review
• Survey of scheduling research involving due date determination decisions

Cited in

(1)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4015963)