Solving Project Scheduling Problems by Minimum Cut Computations - Mohring, Rolf H; Schulz, Andreas S; Stork, Frederik; Uetz, Marc (Management science, 2003)
Keywords: Algorithms; Approximation; Business studies; Costs; Employment; Heuristics; Industrial projects; Integer programming; Integers; Job shops; Lagrangian function; Lagrangian Relaxation; Linear programming; Linear Programming Relaxation; Management; Mathematical programming; Mathematics; Minimization of cost; Minimum Cut; Net present value; Operations research; Optimal solutions; Optimization techniques; Planning methods; Production; Production planning; Project management; Project Scheduling; Renewable resources; Resource Constraints; Scheduling; Studies; Tabu search