Evaluating solution sets of a posteriori solution techniques for bi-criteria combinatorial optimization problems
From MaRDI portal
Publication:880496
DOI10.1007/s10951-005-5316-4zbMath1123.90025OpenAlexW1994389641MaRDI QIDQ880496
John W. Fowler, Shwu-Min Horng, Bosun Kim, Esma S. Gel, W. Matthew Carlyle
Publication date: 15 May 2007
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-005-5316-4
Multi-objective and goal programming (90C29) Deterministic scheduling theory in operations research (90B35)
Related Items
Evaluation of nondominated solution sets for \(k\)-objective optimization problems: an exact method and approximations ⋮ Evaluating solutions and solution sets under multiple objectives
Cites Work
- Unnamed Item
- Bicriterion scheduling of identical processing time jobs by uniform processors
- Parallel machine scheduling with earliness and tardiness penalties
- A genetic algorithm for multiple objective sequencing problems in mixed model assembly lines.
- A multi-population genetic algorithm to solve multi-objective scheduling problems for parallel machines.
- A comparison of neighborhood search techniques for multi-objective combinatorial problems
- Using metaheuristics in multiobjective resource constrained project scheduling
- Scheduling with Multiple Performance Measures: The One-Machine Case
- Analytical Evaluation of Multi-Criteria Heuristics
- Pareto simulated annealing—a metaheuristic technique for multiple‐objective combinatorial optimization
