On the Integration of Theoretical Single-Objective Scheduling Results for Multi-objective Problems
DOI10.1007/978-3-642-32726-1_10zbMath1251.90352OpenAlexW997509030MaRDI QIDQ4649211
Christian Grimme, Joachim Lepping, Markus Kemmerling
Publication date: 20 November 2012
Published in: EVOLVE- A Bridge between Probability, Set Oriented Numerics and Evolutionary Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-32726-1_10
Multi-objective and goal programming (90C29) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Multi-criteria scheduling: an agent-based approach for expert knowledge integration
- An alternative proof of the Kawaguchi-Kyan bound for the largest-ratio-first rule
- Dominance rules for the parallel machine total weighted tardiness scheduling problem with release dates
- A survey of priority rule-based scheduling
- Minimizing the number of tardy jobs for \(m\) parallel machines
- Multiple and bicriteria scheduling: A literature survey
- Four solution techniques for a general one machine scheduling problem. A comparative study
- Nonlinear multiobjective optimization
- Scheduling equal-length jobs on identical parallel machines
- Multicriteria scheduling
- An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method
- A Multiobjective Optimization Approach to Solve a Parallel Machines Scheduling Problem
- Worst Case Bound of an LRF Schedule for the Mean Weighted Flow-Time Problem
- Algorithms for Scheduling Independent Tasks
- Distribution-Free Two-Sample Tests for Scale
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Scheduling independent tasks to reduce mean finishing time
- Evolutionary Algorithms for Solving Multi-Objective Problems
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
- Introductory Statistics with R
This page was built for publication: On the Integration of Theoretical Single-Objective Scheduling Results for Multi-objective Problems
