Heuristics for a project management problem with incompatibility and assignment costs
From MaRDI portal
(Redirected from Publication:429511)
Recommendations
- Solution methods for a scheduling problem with incompatibility and precedence constraints
- Multi-coloring and job-scheduling with assignment and incompatibility costs
- Project scheduling under time dependent costs -- a branch and bound algorithm
- scientific article; zbMATH DE number 4051338
- The discrete time/cost trade-off problem: Extensions and heuristic procedures
Cites work
- scientific article; zbMATH DE number 5345854 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1062113 (Why is no real title available?)
- A Column Generation Approach for Graph Coloring
- A graph coloring algorithm for large scheduling problems
- A graph coloring heuristic using partial solutions and a reactive tabu scheme
- A metaheuristic approach for the vertex coloring problem
- A survey of local search methods for graph coloring
- An adaptive memory algorithm for the \(k\)-coloring problem
- Ant colony optimization theory: a survey
- Ant local search and its efficient adaptation to graph colouring
- Bag rationalisation for a food manufacturer
- Evolutionary algorithms applied to project scheduling problems—a survey of the state-of-the-art
- Genetic and hybrid algorithms for graph coloring
- Graph colouring approaches for a satellite range scheduling problem
- Greedy randomized adaptive search procedures
- Guided local search and its application to the traveling salesman problem
- Hybrid evolutionary algorithms for graph coloring
- Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
- Optimization by simulated annealing
- Probabilistic diversification and intensification in local search for vehicle routing
- Project scheduling under uncertainty: survey and research potentials
- Project scheduling. A research handbook.
- Relational concept learning by cooperative evolution
- Some experiments with simulated annealing for coloring graphs
- The noising method: A new method for combinatorial optimization
- Using tabu search techniques for graph coloring
- Variable neighborhood search
- Variable space search for graph coloring
Cited in
(2)
This page was built for publication: Heuristics for a project management problem with incompatibility and assignment costs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q429511)
