Leuven, B-3000
Belgium
Catholic University of Leuven (KUL)
SSRN RANKINGS
in Total Papers Downloads
Project Management, Project scheduling, Risk industries, Pharmaceutical, R&D projects analysis of algorithms, Computational complexity, Exact algorithms programming, Integer, Branch-and-bound, Applications
project portfolio management, downsizing, sequencing
GRASP, Project scheduling, Uncertainty
order acceptance, scheduling, single machine, branch-and-bound, heuristics, firm planned orders
Capacity planning, multi-project, Order acceptance, Stochastic dynamic programming
combinatorial problems, computational complexity, interval graphs, independent set
project scheduling, net present value, exponentially distributed activity durations, Markov decision process, monotone optimal policy
promotion campaign, minimum quantity commitment, integer program
project scheduling, uncertainty, stochastic activity durations, scheduling policies
Approximate dynamic programming, Capacity planning, multi-project, Order acceptance, Simulation
project scheduling, RCPSP, uncertainty, robust optimization
promotion campaigns; product bundling, multi-channel strategies, direct marketing, integer programming
Scheduling, Combinatorial optimization, Parallel machines, Coloring, Branch and price
parallel machine scheduling, weighted completion times, branch and price, ZDD, stabilization
dock assignment, multicriteria scheduling, branch and bound, beam search, Lagrangian relaxation, tabu search
project scheduling, uncertainty, stochastic activity durations, scheduling
routing, vehicle routing problem, vehicle scheduling, disruptions in travel times, tabu search, linear programming
single-machine scheduling, branch and bound, mixed-integer programming
parallel machine scheduling, machine availability, robust optimization, branch and price, ZDD
Dock Assignment, Parallel Machines, Flexible Flow Shop, Integer Programming, Symmetry
Complexity, Project scheduling, Resource allocation
scheduling, uncertainty, research and development, activity failures, modular precedence network
single-machine scheduling; precedence constraints; weighted tardiness; precedence theorems; dynamic programming
directed graph, undirected graph; bipartite graph, acyclic graph, phase transition, NP-complete
Scheduling, Transportation, Batching, NP-hardness, Strong NP-hardness
Resource loading; Dynamic programming; NP-complete; Preemption; Approximation algorithms
knapsack problem, robustness, scenario-relaxation algorithm, NP-hard, approximation
approximation algorithm, combination of optimization problems, flow shop scheduling, shortest path
scheduling, greedy heuristics, modular projects
sequential testing, k-out-of-n systems, imperfect tests, sequencing and scheduling
system diagnosis, k-out-of-n systems, imperfect tests, sequencing and scheduling
discrete sequential search, group activities, NP-hard, single-machine scheduling, bipartite precedence constraints
sequential testing, precedence constraints, branch and bound, dynamic programming
