Maximizing the production rate in simple assembly line balancing -- A branch and bound procedure

DOI10.1016/0377-2217(95)00047-XzbMath0924.90094OpenAlexW1972352442MaRDI QIDQ1278226

K. Appert

Publication date: 1996

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(95)00047-x

zbMATH Keywords

schedulingbranch and boundassembly line balancing

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (14)

Maximizing the robustness for simple assembly lines with fixed cycle time and limited number of workstations ⋮ Assembly line balancing: what happened in the last fifteen years? ⋮ BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem ⋮ Enhanced branch-bound-remember and iterative beam search algorithms for type II assembly line balancing problem ⋮ R-SALSA: a branch, bound, and remember algorithm for the workload smoothing problem on simple assembly lines ⋮ An MCDA-DEA approach for mixed-model assembly line balancing problem under uncertainty ⋮ A mathematical model and a genetic algorithm for two-sided assembly line balancing ⋮ Exact and heuristic methods for solving the robotic assembly line balancing problem ⋮ A branch-and-bound algorithm to minimize the line length of a two-sided assembly line ⋮ Metaheuristics based on Bin Packing for the line balancing problem ⋮ Evaluation of performance measures for representing operational objectives of a mixed model assembly line balancing problem ⋮ Ship maintenance scheduling by genetic algorithm and constraint-based reasoning ⋮ Integrated planning for product module selection and assembly line design/reconfiguration ⋮ State-of-the-art exact and heuristic solution procedures for simple assembly line balancing

Cites Work

• A two-process implicit enumeration algorithm for the simple assembly line balancing problem
• Assembly line balancing as generalized bin packing
• Computing shortest paths in networks derived from recurrence relations
• Scheduling with Deadlines and Loss Functions
• Fast, Effective Algorithms for Simple Assembly Line Balancing Problems
• An Integer Programming Algorithm with Network Cuts for Solving the Assembly Line Balancing Problem
• A Survey of Exact Algorithms for the Simple Assembly Line Balancing Problem
• Eureka: A Hybrid System for Assembly Line Balancing
• An Application of Bin-Packing to Multiprocessor Scheduling
• Dynamic Programming Solution of Sequencing Problems with Precedence Constraints
• Assembly-Line Balancing—Dynamic Programming with Precedence Constraints

This page was built for publication: Maximizing the production rate in simple assembly line balancing -- A branch and bound procedure