The type E simple assembly line balancing problem: a mixed integer linear programming formulation
From MaRDI portal
Publication:342081
DOI10.1016/j.cor.2015.05.017zbMath1349.90282OpenAlexW2470979029MaRDI QIDQ342081
Parisa Charkhgard, Rasul Esmaeilbeigi, Bahman Naderi
Publication date: 17 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2015.05.017
Related Items
New formulations for the setup assembly line balancing and scheduling problem, Assembly line balancing: what happened in the last fifteen years?, Solving the Type-2 Assembly Line Balancing with Setups Using Logic-Based Benders Decomposition, SALSA: combining branch-and-bound with dynamic programming to smoothen workloads in simple assembly line balancing, The multiphase course timetabling problem
Cites Work
- Order acceptance and scheduling problems in two-machine flow shops: new mixed integer programming formulations
- A meta-heuristic algorithm for the fuzzy assembly line balancing type-E problem
- Integer-programming software systems
- The assembly line balancing and scheduling problem with sequence-dependent setup times: problem extension, model formulation and efficient heuristics
- Using the Taguchi method to optimize the differential evolution algorithm parameters for minimizing the workload smoothness index in simple assembly line balancing
- State-of-the-art exact and heuristic solution procedures for simple assembly line balancing
- Cost-oriented assembly line balancing: model formulations, solution difficulty, upper and lower bounds
- Fast, Effective Algorithms for Simple Assembly Line Balancing Problems
- An improved mathematical program to solve the simple assembly line balancing problem
- Balancing mixed-model assembly lines: a computational evaluation of objectives to smoothen workload
- 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