Heuristics for a project management problem with incompatibility and assignment costs
DOI10.1007/S10589-010-9380-0zbMATH Open1245.90154OpenAlexW1969794772MaRDI QIDQ429511FDOQ429511
Authors: Nicolas Zufferey, Olivier Labarthe, David Schindl 
Publication date: 19 June 2012
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://archive-ouverte.unige.ch/unige:26155
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
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Title not available (Why is that?)
- Optimization by Simulated Annealing
- Title not available (Why is that?)
- A survey of local search methods for graph coloring
- Ant colony optimization theory: a survey
- Variable neighborhood search
- Project scheduling. A research handbook.
- Project scheduling under uncertainty: survey and research potentials
- Title not available (Why is that?)
- A graph coloring algorithm for large scheduling problems
- Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
- Greedy randomized adaptive search procedures
- Hybrid evolutionary algorithms for graph coloring
- A graph coloring heuristic using partial solutions and a reactive tabu scheme
- A Column Generation Approach for Graph Coloring
- Using tabu search techniques for graph coloring
- Probabilistic diversification and intensification in local search for vehicle routing
- Variable space search for graph coloring
- An adaptive memory algorithm for the \(k\)-coloring problem
- A metaheuristic approach for the vertex coloring problem
- Graph colouring approaches for a satellite range scheduling problem
- Genetic and hybrid algorithms for graph coloring
- The noising method: A new method for combinatorial optimization
- Guided local search and its application to the traveling salesman problem
- Evolutionary algorithms applied to project scheduling problems—a survey of the state-of-the-art
- Ant local search and its efficient adaptation to graph colouring
- Bag rationalisation for a food manufacturer
- Relational concept learning by cooperative evolution
- Some experiments with simulated annealing for coloring graphs
Cited In (2)
Uses Software
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)
