Stochastic assembly line balancing using beam search

DOI10.1080/00207540412331320526MaRDI QIDQ5466724zbMATH OpenOpenAlexFDO

Authors Erdal Erel, H. Sekerci, Ihsan Sabuncuoglu

Publication date 25 August 2005

Published in International Journal of Production Research (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/11693/24083

zbMATH Keywords

assembly line balancingbeam searchU-type assembly line

Mathematics Subject Classification ID

Production models (90B30)

Recommendations

• Using beam search techniques for sequencing mixed-model assembly lines
• Mixed-model assembly line sequencing using beam search
• Iterative beam search for simple assembly line balancing with a fixed number of work stations
• Beam-ACO for simple assembly line balancing
• On solving the assembly line worker assignment and balancing problem via beam search

Cites work

• Analysis of reactive scheduling problems in a job shop environment
• Balancing of U-type assembly systems using simulated annealing
• Note. Optimal balancing of U-shaped assembly lines
• Stochastic assembly line balancing using simulated annealing
• Synchronous unpaced flow lines with worker differences and overtime cost
• The U-line Line Balancing Problem
• The mixed-model U-line balancing problem
• The stochastic U-line balancing problem
• ULINO: Optimally balancing U-shaped JIT assembly lines

Cited in

(22)

• Backtracking and exchange of information: Methods to enhance a beam search algorithm for assembly line scheduling
• ASALBP: the alternative subgraphs assembly line balancing problem
• Beam-ACO for simple assembly line balancing
• A Dynamic Programming Approach to Stochastic Assembly Line Balancing
• Beam search heuristic to solve stochastic integer problems under probabilistic constraints
• Robust balancing of transfer lines with blocks of uncertain parallel tasks under fixed cycle time and space restrictions
• Iterative beam search for simple assembly line balancing with a fixed number of work stations
• Mixed-model assembly line sequencing using beam search
• Second order conic approximation for disassembly line design with joint probabilistic constraints
• Robust optimization for U-shaped assembly line worker assignment and balancing problem with uncertain task times
• A classification of assembly line balancing problems
• Balancing stochastic parallel assembly lines
• A survey on metaheuristics for stochastic combinatorial optimization
• Balancing of simple assembly lines under variations of task processing times
• A heuristic and a branch-and-bound algorithm for the assembly line worker assignment and balancing problem
• Order acceptance with weighted tardiness
• An agent-based stochastic ruler approach for a stochastic knapsack problem with sequential competition
• Balancing stochastic two-sided assembly lines: a chance-constrained, piecewise-linear, mixed integer program and a simulated annealing algorithm
• On solving the assembly line worker assignment and balancing problem via beam search
• Flow shop scheduling with heterogeneous workers
• Reconfiguration of assembly lines under the influence of high product variety in the automotive industry-a decision support system
• Chance-constrained stochastic assembly line balancing with branch, bound and remember algorithm

This page was built for publication: Stochastic assembly line balancing using beam search

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5466724)