Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
A class of greedy algorithms for the generalized assignment problem
Discrete Applied Mathematics
Simulation Modeling and Analysis
Simulation Modeling and Analysis
Evolutionary Algorithms for Solving Multi-Objective Problems
Evolutionary Algorithms for Solving Multi-Objective Problems
Parameter Selection in Particle Swarm Optimization
EP '98 Proceedings of the 7th International Conference on Evolutionary Programming VII
Comparison of Multiobjective Evolutionary Algorithms: Empirical Results
Evolutionary Computation
Multicriteria Optimization
Introduction to Mathematical Programming: Applications and Algorithms
Introduction to Mathematical Programming: Applications and Algorithms
Utility-based decision support system for schedule optimization
Decision Support Systems
Multiobjective evolutionary algorithms: a comparative case studyand the strength Pareto approach
IEEE Transactions on Evolutionary Computation
Multi-objective team formation optimization for new product development
Computers and Industrial Engineering
Hi-index | 0.00 |
In this article, a new multiobjective optimization model, MUST, is proposed to facilitate the staff-to-job assignment in consulting engineering firms. In addition to the typical objective of maximizing profits, other human resource related objectives are also incorporated to balance workloads, avoid excessive overtime, and eliminate demoralizing idleness while giving preference to projects with specified priorities. The present optimization problem is of significant complexity (nonlinear, non-smooth, and combinatorial) and has been proved NP- and #P-complete. To handle all the difficulties, MUST incorporates a particle swarm optimization algorithm to approximate the tradeoff surface consisting of non-dominated solutions. The application of MUST is demonstrated through a numerical case of assigning six engineering teams to fifteen incoming projects. It has been shown that non-dominated solutions generated by MUST help decision makers choose the compromised assignment plan which is otherwise hard and time-consuming to obtain. The comparisons with SPEA2 and LINGO verify the effectiveness and efficiency of MUST.