Balancing assembly lines effectively -- a computational comparison
From MaRDI portal
Publication:1809823
DOI10.1016/S0377-2217(98)00173-8zbMath0949.90034OpenAlexW2005121075MaRDI QIDQ1809823
Publication date: 9 April 2000
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(98)00173-8
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Production models (90B30)
Related Items
U-shaped assembly line layouts and their impact on labor productivity: an experimental study, Balancing mixed-model assembly lines: a computational evaluation of objectives to smoothen workload, A GRASP approach for the extended car sequencing problem, A three-stage load balancing model in a manufacturing company, Heuristics and lower bounds for the simple assembly line balancing problem type 1: overview, computational tests and improvements, Balancing stochastic type-II assembly lines: chance-constrained mixed integer and constraint programming models, Optimization of workcell layouts in a mixed-model assembly line environment, A hybrid genetic algorithm for sequence-dependent disassembly line balancing problem, Ant algorithms for a time and space constrained assembly line balancing problem, Balancing mixed-model assembly lines using adjacent cross-training in a demand variation environment, A weighted multiobjective optimization method for mixed-model assembly line problem, A scatter search based hyper-heuristic for sequencing a mixed-model assembly line, Algorithms for the car sequencing and the level scheduling problem, Branch, bound and remember algorithm for two-sided assembly line balancing problem, Enhanced branch-bound-remember and iterative beam search algorithms for type II assembly line balancing problem, Analysis of the simple assembly line balancing problem complexity, Sequence-dependent time- and cost-oriented assembly line balancing problems: a combinatorial Benders’ decomposition approach, The assembly line balancing and scheduling problem with sequence-dependent setup times: problem extension, model formulation and efficient heuristics, Constraint programming approach for multi-objective two-sided assembly line balancing problem with multi-operator stations, Balancing of simple assembly lines under variations of task processing times, Mixed model line balancing with parallel stations, zoning constraints, and ergonomics, Bi-criteria assembly line balancing by considering flexible operation times, Balancing and scheduling of flexible mixed model assembly lines, Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning, An alternative MILP model for makespan minimization on assembly lines, Modelling transfer line design problem via a set partitioning problem, Enhanced multi-hoffmann heuristic for efficiently solving real-world assembly line balancing problems in automotive industry, Assembly line balancing and group working: a heuristic procedure for workers' groups operating on the same product and workstation, A branch-and-bound algorithm to minimize the line length of a two-sided assembly line, Optimally solving the alternative subgraphs assembly line balancing problem, An evaluation of constructive heuristic methods for solving the alternative subgraphs assembly line balancing problem, A decomposition scheme for single stage scheduling problems, Metaheuristics based on Bin Packing for the line balancing problem, Constraint programming approaches to disassembly line balancing problem with sequencing decisions, Using distributed search methods for balancing mixed-model assembly lines in the automotive industry, The sequence-dependent assembly line balancing problem, A Branch, Bound, and Remember Algorithm for the Simple Assembly Line Balancing Problem, Integrated planning for product module selection and assembly line design/reconfiguration, Zero-cycles on Hilbert-Blumenthal surfaces, Balancing assembly lines with variable parallel workplaces: problem definition and effective solution procedure, \texttt{Absalom}: balancing assembly lines with assignment restrictions, State-of-the-art exact and heuristic solution procedures for simple assembly line balancing, An linear programming based lower bound for the simple assembly line balancing problem, Balancing assembly lines with tabu search, An enumerative heuristic and reduction methods for the assembly line balancing problem, An application of the branch, bound, and remember algorithm to a new simple assembly line balancing dataset
Cites Work
- A two-process implicit enumeration algorithm for the simple assembly line balancing problem
- Finding optimal line balances with OptPack
- An optimal procedure for the single-model deterministic assembly line balancing problem
- 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
- Dynamic Programming Solution of Sequencing Problems with Precedence Constraints
- Note: Microcomputer Performance of OptPack on Hoffmann's Data Sets: Comparison with Eureka and FABLE
- SALOME: A Bidirectional Branch-and-Bound Procedure for Assembly Line Balancing
- New Benchmark Results for the Resource-Constrained Project Scheduling Problem
