Pages that link to "Item:Q958561"

The following pages link to A dynamic programming based heuristic for the assembly line balancing problem (Q958561):

Displaying 20 items.

• Procedures for the bin packing problem with precedence constraints (Q322561) (← links)
• Procedures for the time and space constrained assembly line balancing problem (Q421558) (← links)
• Solving mixed model sequencing problem in assembly lines with serial workstations with work overload minimisation and interruption rules (Q541694) (← links)
• Modelling and a segmented dynamic programming-based heuristic approach for the slab stack shuffling problem (Q732906) (← links)
• A memetic algorithm for the cost-oriented robotic assembly line balancing problem (Q1654375) (← links)
• Reduction approaches for a generalized line balancing problem (Q1761168) (← links)
• A hybrid variable neighbourhood search and dynamic programming approach for the nurse rostering problem (Q1983752) (← links)
• A Benders' decomposition algorithm with combinatorial cuts for the multi-manned assembly line balancing problem (Q1999621) (← links)
• On the complexity of assembly line balancing problems (Q2003432) (← links)
• Assembly line balancing: what happened in the last fifteen years? (Q2140264) (← links)
• Enhanced multi-hoffmann heuristic for efficiently solving real-world assembly line balancing problems in automotive industry (Q2256345) (← 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)
• Empirical working time distribution-based line balancing with integrated simulated annealing and dynamic programming (Q2418162) (← 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)
• A Branch, Bound, and Remember Algorithm for the Simple Assembly Line Balancing Problem (Q2815457) (← links)
• Analysis of the simple assembly line balancing problem complexity (Q6047869) (← links)
• Matheuristics: survey and synthesis (Q6056873) (← links)
• A branch, bound and remember algorithm for maximizing the production rate in the simple assembly line balancing problem (Q6568392) (← links)