Exact and heuristic methods for a workload allocation problem with chain precedence constraints

Cites Work

Unnamed Item
Bin packing and cutting stock problems: mathematical models and exact algorithms
A heuristic and a branch-and-bound algorithm for the assembly line worker assignment and balancing problem
An exact algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times
Fixed-parameter tractability and completeness II: On completeness for W[1]
Partially ordered knapsack and applications to scheduling
Decremental state space relaxation strategies and initialization heuristics for solving the orienteering problem with time windows with dynamic programming
Variable neighborhood search
The robust (minmax regret) assembly line worker assignment and balancing problem
Exact and heuristic methods for solving the robotic assembly line balancing problem
Selecting and covering colored points
An iterative dynamic programming approach for the temporal knapsack problem
Assembly line balancing: what happened in the last fifteen years?
Arc flow formulations based on dynamic programming: theoretical foundations and applications
A branch-and-bound algorithm for assembly line worker assignment and balancing problems
An application of the branch, bound, and remember algorithm to a new simple assembly line balancing dataset
State-of-the-art exact and heuristic solution procedures for simple assembly line balancing
A survey on problems and methods in generalized assembly line balancing
Accelerated label setting algorithms for the elementary resource constrained shortest path problem
Enhanced branch-bound-remember and iterative beam search algorithms for type II assembly line balancing problem
A Branch, Bound, and Remember Algorithm for the Simple Assembly Line Balancing Problem
Assignment Problems
State-space relaxation procedures for the computation of bounds to routing problems
On Dynamic Programming Methods for Assembly Line Balancing
Fixed-Parameter Tractability and Completeness I: Basic Results
An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs