Pages that link to "Item:Q4376733"

The following pages link to SALOME: A Bidirectional Branch-and-Bound Procedure for Assembly Line Balancing (Q4376733):

Displaying 48 items.

• Systematic data generation and test design for solution algorithms on the example of SALBPGen for assembly line balancing (Q257213) (← links)
• An efficient branch and bound algorithm for assembly line balancing problems with parallel multi-manned workstations (Q339701) (← links)
• Balancing mixed-model assembly lines using adjacent cross-training in a demand variation environment (Q342134) (← links)
• Procedures for the time and space constrained assembly line balancing problem (Q421558) (← links)
• On a learning precedence graph concept for the automotive industry (Q439367) (← links)
• Bi-criteria assembly line balancing by considering flexible operation times (Q651766) (← links)
• A branch-and-bound based solution approach for the mixed-model assembly line-balancing problem for minimizing stations and task duplication costs (Q858390) (← links)
• A dynamic programming based heuristic for the assembly line balancing problem (Q958561) (← links)
• A branch-and-bound algorithm to minimize the line length of a two-sided assembly line (Q976518) (← links)
• The sequence-dependent assembly line balancing problem (Q991824) (← links)
• Balancing assembly lines with variable parallel workplaces: problem definition and effective solution procedure (Q1042153) (← links)
• \texttt{Absalom}: balancing assembly lines with assignment restrictions (Q1044086) (← links)
• Maximizing the production rate in simple assembly line balancing -- A branch and bound procedure (Q1278226) (← links)
• Optimally balancing assembly lines with different workstations (Q1348257) (← links)
• BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem (Q1362971) (← links)
• Assembly line balancing in a mixed-model sequencing environment with synchronous transfers. (Q1399586) (← links)
• The robust (minmax regret) assembly line worker assignment and balancing problem (Q1652575) (← links)
• Balancing assembly lines effectively -- a computational comparison (Q1809823) (← links)
• An enumerative heuristic and reduction methods for the assembly line balancing problem (Q1869496) (← links)
• U-shaped assembly line layouts and their impact on labor productivity: an experimental study (Q1877912) (← links)
• The assembly line balancing and scheduling problem with sequence-dependent setup times: problem extension, model formulation and efficient heuristics (Q1936599) (← links)
• A Benders' decomposition algorithm with combinatorial cuts for the multi-manned assembly line balancing problem (Q1999621) (← links)
• Approximation algorithms for simple assembly line balancing problems (Q2125223) (← 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)
• Multiple-source learning precedence graph concept for the automotive industry (Q2256196) (← 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)
• Optimally solving the alternative subgraphs assembly line balancing problem (Q2267306) (← links)
• An enumeration procedure for the assembly line balancing problem based on branching by non-decreasing idle time (Q2355812) (← links)
• An application of the branch, bound, and remember algorithm to a new simple assembly line balancing dataset (Q2356246) (← links)
• Assembly line balancing problems with multi-manned stations: a new mathematical formulation and Gantt based heuristic method (Q2399325) (← links)
• State-of-the-art exact and heuristic solution procedures for simple assembly line balancing (Q2569059) (← links)
• A survey on problems and methods in generalized assembly line balancing (Q2569060) (← links)
• An linear programming based lower bound for the simple assembly line balancing problem (Q2569061) (← links)
• Balancing assembly lines with tabu search (Q2569069) (← 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)
• Stochastic assembly line balancing: general bounds and reliability-based branch-and-bound algorithm (Q2672079) (← links)
• A branch, bound, and remember algorithm for the simple assembly line balancing problem (Q2815457) (← links)
• An improved mathematical program to solve the simple assembly line balancing problem (Q3055448) (← links)
• Reconfiguration of assembly lines under the influence of high product variety in the automotive industry–a decision support system (Q3163133) (← links)
• Balancing mixed-model assembly lines: a computational evaluation of objectives to smoothen workload (Q3163289) (← 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)
• An exact constraint programming based procedure for the multi-manned assembly line balancing problem (Q6551052) (← links)
• A branch, bound and remember algorithm for maximizing the production rate in the simple assembly line balancing problem (Q6568392) (← links)