Pages that link to "Item:Q2356246"

The following pages link to An application of the branch, bound, and remember algorithm to a new simple assembly line balancing dataset (Q2356246):

Displaying 22 items.

• Hybrid metaheuristics for the accessibility windows assembly line balancing problem level 2 (AWALBP-L2) (Q322556) (← links)
• Procedures for the bin packing problem with precedence constraints (Q322561) (← links)
• The stability radius of an optimal line balance with maximum efficiency for a simple assembly line (Q1634287) (← 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)
• Exact and heuristic methods for solving the robotic assembly line balancing problem (Q1754736) (← 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)
• 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)
• Heuristics and lower bounds for the simple assembly line balancing problem type 1: overview, computational tests and improvements (Q2629595) (← links)
• Enhanced branch-bound-remember and iterative beam search algorithms for type II assembly line balancing problem (Q2668676) (← links)
• Solving the Pricing Problem in a Branch-and-Price Algorithm for Graph Coloring Using Zero-Suppressed Binary Decision Diagrams (Q2806865) (← links)
• An Improved Branch-and-Bound Algorithm for the One-Machine Scheduling Problem with Delayed Precedence Constraints (Q5085478) (← links)
• Bin Packing Problem with Time Lags (Q5106420) (← links)
• Analysis of the simple assembly line balancing problem complexity (Q6047869) (← 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)
• Deep learning-driven scheduling algorithm for a single machine problem minimizing the total tardiness (Q6167662) (← links)
• Chance-constrained stochastic assembly line balancing with branch, bound and remember algorithm (Q6547003) (← links)
• A new upper bound based on Dantzig-Wolfe decomposition to maximize the stability radius of a simple assembly line under uncertainty (Q6555181) (← links)
• A branch, bound and remember algorithm for maximizing the production rate in the simple assembly line balancing problem (Q6568392) (← links)