Evaluating solution sets of a posteriori solution techniques for bi-criteria combinatorial optimization problems
type: Item
instance of: scholarly article
title: Evaluating solution sets of a posteriori solution techniques for bi-criteria combinatorial optimization problems
zbMATH Open document ID: 1123.90025
author: John Fowler
author: Bosun Kim
author: W. Matthew Carlyle
author: Esma S. Gel
author: Shwu-Min Horng
published in: Journal of Scheduling
publication date: 2007-05-15T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C29
zbMATH DE Number: 5153331
MaRDI profile type: Publication
full work available at URL: s10951-005-5316-4
OpenAlex ID: W1994389641
cites work: A multi-population genetic algorithm to solve multi-objective scheduling problems for parallel machines.
cites work: Pareto simulated annealing—a metaheuristic technique for multiple‐objective combinatorial optimization
cites work: Analytical Evaluation of Multi-Criteria Heuristics
cites work: A genetic algorithm for multiple objective sequencing problems in mixed model assembly lines.
cites work: A comparison of neighborhood search techniques for multi-objective combinatorial problems
cites work: Scheduling with Multiple Performance Measures: The One-Machine Case
cites work: Q3525910
cites work: Parallel machine scheduling with earliness and tardiness penalties
cites work: Bicriterion scheduling of identical processing time jobs by uniform processors
cites work: Using metaheuristics in multiobjective resource constrained project scheduling
DOI: 10.1007/S10951-005-5316-4
description: scientific article; zbMATH DE number 5153331