A multi-phase covering Pareto-optimal front method to multi-objective parallel machine scheduling
From MaRDI portal
Recommendations
- A multiobjective optimization approach to solve a parallel machines scheduling problem
- A multi-objective optimization model and its algorithm for hybrid parallel machine scheduling problems
- A multi-objective optimization for preemptive identical parallel machines scheduling problem
- A combination of parallel machine scheduling and the covering problem
- Solving multi-objective parallel machine scheduling problem by a modified NSGA-II
- scientific article; zbMATH DE number 1305540
- Multiobjective order acceptance and scheduling on unrelated parallel machines with machine eligibility constraints
- scientific article; zbMATH DE number 1870573
Cites work
- A genetic algorithm methodology for complex scheduling problems
- A survey of very large-scale neighborhood search techniques
- Minimizing the sum of job earliness and tardiness in a multimachine system
- On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems.
- Pareto simulated annealing—a metaheuristic technique for multiple‐objective combinatorial optimization
- Solving parallel machines scheduling problems with sequence-dependent setup times using variable neighbourhood search
- Variable neighborhood search for the maximum clique
Cited in
(5)- A bi-objective aggregate production planning problem with learning effect and machine deterioration: modeling and solution
- Solving multi-objective parallel machine scheduling problem by a modified NSGA-II
- The third comprehensive survey on scheduling problems with setup times/costs
- scientific article; zbMATH DE number 5151378 (Why is no real title available?)
- A united search particle swarm optimization algorithm for multiobjective scheduling problem
This page was built for publication: A multi-phase covering Pareto-optimal front method to multi-objective parallel machine scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3163193)