Pages that link to "Item:Q2815457"

The following pages link to A Branch, Bound, and Remember Algorithm for the Simple Assembly Line Balancing Problem (Q2815457):

Displaying 31 items.

• New formulations for the setup assembly line balancing and scheduling problem (Q280181) (← links)
• Procedures for the bin packing problem with precedence constraints (Q322561) (← links)
• A heuristic and a branch-and-bound algorithm for the assembly line worker assignment and balancing problem (Q336970) (← links)
• Balancing mixed-model assembly lines using adjacent cross-training in a demand variation environment (Q342134) (← links)
• The robust (minmax regret) assembly line worker assignment and balancing problem (Q1652575) (← links)
• Solving the accessibility windows assembly line problem level 1 and variant 1 (AWALBP-L1-1) with precedence constraints (Q1653370) (← links)
• A memetic algorithm for the cost-oriented robotic assembly line balancing problem (Q1654375) (← links)
• Mixed model line balancing with parallel stations, zoning constraints, and ergonomics (Q1706600) (← links)
• A branch, bound, and remember algorithm for the simple disassembly line balancing problem (Q1722962) (← links)
• Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning (Q1751150) (← links)
• Exact and heuristic methods for solving the robotic assembly line balancing problem (Q1754736) (← links)
• Advanced constraint propagation for the combined car sequencing and level scheduling problem (Q1782169) (← links)
• A Benders' decomposition algorithm with combinatorial cuts for the multi-manned assembly line balancing problem (Q1999621) (← links)
• Comparison of the number of nodes explored by cyclic best first search with depth contour and best first search (Q2026990) (← links)
• \textit{Branch} \& \textit{Memorize} exact algorithms for sequencing problems: efficient embedding of memorization into search trees (Q2027052) (← links)
• Weighted network search games with multiple hidden objects and multiple search teams (Q2028828) (← links)
• Assembly line balancing: what happened in the last fifteen years? (Q2140264) (← links)
• Branch, bound and remember algorithm for two-sided assembly line balancing problem (Q2178119) (← links)
• SALSA: combining branch-and-bound with dynamic programming to smoothen workloads in simple assembly line balancing (Q2242373) (← links)
• Enhanced multi-hoffmann heuristic for efficiently solving real-world assembly line balancing problems in automotive industry (Q2256345) (← links)
• A branch-and-bound algorithm for assembly line worker assignment and balancing problems (Q2257352) (← links)
• An application of the branch, bound, and remember algorithm to a new simple assembly line balancing dataset (Q2356246) (← links)
• Heuristics and lower bounds for the simple assembly line balancing problem type 1: overview, computational tests and improvements (Q2629595) (← links)
• An exact dynamic programming algorithm for the precedence-constrained class sequencing problem (Q2664413) (← links)
• Enhanced branch-bound-remember and iterative beam search algorithms for type II assembly line balancing problem (Q2668676) (← links)
• An integrated approach for a new flexible multi-product disassembly line balancing problem (Q2676357) (← links)
• An Improved Branch-and-Bound Algorithm for the One-Machine Scheduling Problem with Delayed Precedence Constraints (Q5085478) (← links)
• Analysis of the simple assembly line balancing problem complexity (Q6047869) (← links)
• R-SALSA: a branch, bound, and remember algorithm for the workload smoothing problem on simple assembly lines (Q6069213) (← links)
• Results for the close-enough traveling salesman problem with a branch-and-bound algorithm (Q6097759) (← links)
• Exact and heuristic methods for a workload allocation problem with chain precedence constraints (Q6112777) (← links)