\texttt{Absalom}: balancing assembly lines with assignment restrictions
From MaRDI portal
Publication:1044086
DOI10.1016/j.ejor.2009.01.049zbMath1177.90351OpenAlexW2082595031MaRDI QIDQ1044086
Malte Fliedner, Nils Boysen, Armin Scholl
Publication date: 10 December 2009
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2009.01.049
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Discrete location and assignment (90B80)
Related Items
New formulations for the setup assembly line balancing and scheduling problem, Reconfiguration of assembly lines under the influence of high product variety in the automotive industry–a decision support system, Assembly line balancing: what happened in the last fifteen years?, Models for assembly line balancing by temporal, spatial and ergonomic risk attributes, Combining matheuristics and MILP to solve the accessibility windows assembly line balancing problem level 2 (AWALBP-L2), Balancing mixed-model assembly lines using adjacent cross-training in a demand variation environment, A survey of the parallel assembly lines balancing problem, The assembly line balancing and scheduling problem with sequence-dependent setup times: problem extension, model formulation and efficient heuristics, Balancing a robotic spot welding manufacturing line: an industrial case study, Procedures for the time and space constrained assembly line balancing problem, On a learning precedence graph concept for the automotive industry, Scenario based robust line balancing: Computational complexity, Bi-criteria assembly line balancing by considering flexible operation times, Traveling worker assembly line (re)balancing problem: model, reduction techniques, and real case studies, Enhanced multi-hoffmann heuristic for efficiently solving real-world assembly line balancing problems in automotive industry, Balancing assembly lines with variable parallel workplaces: problem definition and effective solution procedure, Packing-based branch-and-bound for discrete malleable task scheduling, Systematic data generation and test design for solution algorithms on the example of SALBPGen for assembly line balancing
Uses Software
Cites Work
- Ant algorithms for a time and space constrained assembly line balancing problem
- The sequence-dependent assembly line balancing problem
- A two-process implicit enumeration algorithm for the simple assembly line balancing problem
- The one-machine sequencing problem
- Assembly line balancing as generalized bin packing
- Finding optimal line balances with OptPack
- Branch-and-bound algorithms for the multi-product assembly line balancing problem
- Balancing \(U\)-lines in a multiple \(U\)-line facility
- Computing lower bounds by destructive improvement: An application to resource-constrained project scheduling
- Balancing assembly lines effectively -- a computational comparison
- Monolithic vs. hierarchical balancing and scheduling of a flexible assembly line
- An enumerative heuristic and reduction methods for the assembly line balancing problem
- A classification of assembly line balancing problems
- A versatile algorithm for assembly line balancing
- State-of-the-art exact and heuristic solution procedures for simple assembly line balancing
- A survey on problems and methods in generalized assembly line balancing
- Balancing assembly lines with tabu search
- A Branch-and-Cut Approach for a Generic Multiple-Product, Assembly-System Design Problem
- A Branch and Bound Algorithm for Assembly Line Balancing Problems with Formulation Irregularities
- Assembly-Line Balancing by Linear Programming
- A Survey of Exact Algorithms for the Simple Assembly Line Balancing Problem
- Technical Note—Assembly-Line Balancing: Zero-One Programming with Fibonacci Search
- A knowledge-based system for solving multi-objective assembly line balancing problems
- A family of hierarchical models for the design of deterministic assembly systems
- ULINO: Optimally balancing U-shaped JIT assembly lines
- SALOME: A Bidirectional Branch-and-Bound Procedure for Assembly Line Balancing
- Balancing flexible lines for car components assembly
- A strong cutting plane algorithm for the robotic assembly line balancing problem
- A competitive branch-and-bound algorithm for the simple assembly line balancing problem
- A cutting plane approach for the single-product assembly system design problem
- Tabu search algorithms for an industrial multi-product and multi-objective assembly line balancing problem, with reduction of the task dispersion
- Balancing assembly lines: an industrial case study
- A two-stage heuristic method for balancing mixed-model assembly lines with parallel workstations
- Hybrid assembly line design and user's preferences
- ANTBAL: an ant colony optimization algorithm for balancing mixed-model assembly lines with parallel workstations
- OPtimally Balancing Large Assembly Lines: Updating Johnson S 1988 Fable Algorithm*
