Pages that link to "Item:Q1278226"

The following pages link to Maximizing the production rate in simple assembly line balancing -- A branch and bound procedure (Q1278226):

Displaying 24 items.

• Maximizing the robustness for simple assembly lines with fixed cycle time and limited number of workstations (Q284850) (← links)
• An efficient branch and bound algorithm for assembly line balancing problems with parallel multi-manned workstations (Q339701) (← links)
• Procedures for the time and space constrained assembly line balancing problem (Q421558) (← links)
• An alternative MILP model for makespan minimization on assembly lines (Q523177) (← links)
• A mathematical model and a genetic algorithm for two-sided assembly line balancing (Q955621) (← 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)
• Branch-and-bound algorithms for the multi-product assembly line balancing problem (Q1194733) (← links)
• BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem (Q1362971) (← links)
• Exact and heuristic methods for solving the robotic assembly line balancing problem (Q1754736) (← links)
• Ship maintenance scheduling by genetic algorithm and constraint-based reasoning (Q1806661) (← links)
• Balancing assembly lines effectively -- a computational comparison (Q1809823) (← links)
• Assembly line balancing: what happened in the last fifteen years? (Q2140264) (← links)
• An efficient algorithm for maximizing the expected profit from a serial production line with inspection stations and rework (Q2393122) (← links)
• State-of-the-art exact and heuristic solution procedures for simple assembly line balancing (Q2569059) (← links)
• Enhanced branch-bound-remember and iterative beam search algorithms for type II assembly line balancing problem (Q2668676) (← links)
• An MCDA-DEA approach for mixed-model assembly line balancing problem under uncertainty (Q2987966) (← links)
• Metaheuristics based on Bin Packing for the line balancing problem (Q3598684) (← links)
• Evaluation of performance measures for representing operational objectives of a mixed model assembly line balancing problem (Q3605444) (← links)
• SALOME: A Bidirectional Branch-and-Bound Procedure for Assembly Line Balancing (Q4376733) (← links)
• Integrated planning for product module selection and assembly line design/reconfiguration (Q5478848) (← links)
• Balancing Just-In-Time Production Units: The<i>N</i>U-Line Balancing Problem (Q5888074) (← links)
• R-SALSA: a branch, bound, and remember algorithm for the workload smoothing problem on simple assembly lines (Q6069213) (← links)
• A branch, bound and remember algorithm for maximizing the production rate in the simple assembly line balancing problem (Q6568392) (← links)