An efficient heuristic method for the simple assembly line balancing problem
From MaRDI portal
Publication:3707758
DOI10.1080/00207548608919719zbMath0584.90042OpenAlexW2024000171MaRDI QIDQ3707758
Publication date: 1986
Published in: International Journal of Production Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207548608919719
computational resultsefficient single-pass heuristic methodsingle-model deterministic line balancing
Numerical mathematical programming methods (65K05) Deterministic scheduling theory in operations research (90B35)
Related Items (5)
A two-process implicit enumeration algorithm for the simple assembly line balancing problem ⋮ A stochastic approach to assembly line balancing ⋮ A multiple criteria decision making approach for the assembly line balancing problem ⋮ Heuristic methods and applications: A categorized survey ⋮ State-of-the-art exact and heuristic solution procedures for simple assembly line balancing
Cites Work
- Bin packing can be solved within 1+epsilon in linear time
- Assembly line balancing as generalized bin packing
- Summary of a Heuristic Line Balancing Procedure
- An Integer Programming Algorithm with Network Cuts for Solving the Assembly Line Balancing Problem
- Assembly-Line Balancing by Linear Programming
- An Integer Programming Procedure for Assembly System Design Problems
- Bounds for Assembly Line Balancing Heuristics
- An Algorithm for Large Zero-One Knapsack Problems
- Technical Note—Assembly-Line Balancing: Zero-One Programming with Fibonacci Search
- A heuristic network procedure for the assembly line balancing problem
- Assembly-Line Balancing—Dynamic Programming with Precedence Constraints
- An Experimental Investigation and Comparative Evaluation of Production Line Balancing Techniques
This page was built for publication: An efficient heuristic method for the simple assembly line balancing problem