Solving the Type-2 Assembly Line Balancing with Setups Using Logic-Based Benders Decomposition
From MaRDI portal
Publication:5084654
DOI10.1287/ijoc.2020.1015OpenAlexW3138932436MaRDI QIDQ5084654
Vahid Roshanaei, Bahman Naderi, Hassan Zohali
Publication date: 28 June 2022
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.2020.1015
combinatorial optimizationrelaxationmixed integer programmingvalid inequalitiessequence-dependent setup timeslogic-based Benders decompositionpreprocessinglower and upper boundtype-2 assembly line balancing
Related Items (3)
Unrelated parallel machine scheduling problem with special controllable processing times and setups ⋮ The stochastic pseudo-star degree centrality problem ⋮ Mathematical model and a variable neighborhood search algorithm for mixed-model robotic two-sided assembly line balancing problems with sequence-dependent setup times
Uses Software
Cites Work
- Balancing mixed-model assembly lines with sequence-dependent tasks via hybrid genetic algorithm
- New formulations for the setup assembly line balancing and scheduling problem
- Hybrid robust and stochastic optimization for closed-loop supply chain network design using accelerated Benders decomposition
- The type E simple assembly line balancing problem: a mixed integer linear programming formulation
- The distributed permutation flowshop scheduling problem
- Partitioning procedures for solving mixed-variables programming problems
- Assembly line balancing as generalized bin packing
- Logic-based Benders decomposition
- Logic based Benders' decomposition for orthogonal stock cutting problems
- The design of a reliable and robust hierarchical health service network using an accelerated Benders decomposition algorithm
- Recursive logic-based Benders' decomposition for multi-mode outpatient scheduling
- Combinatorial Benders cuts for assembly line balancing problems with setups
- The Benders decomposition algorithm: a literature review
- Propagating logic-based Benders' decomposition approaches for distributed operating room scheduling
- Benders decomposition for the Hazmat transport network design problem
- The assembly line balancing and scheduling problem with sequence-dependent setup times: problem extension, model formulation and efficient heuristics
- A Benders' decomposition algorithm with combinatorial cuts for the multi-manned assembly line balancing problem
- Branch-relax-and-check: a tractable decomposition method for order acceptance and identical parallel machine scheduling
- Balancing and scheduling tasks in assembly lines with sequence-dependent setup times
- A survey on problems and methods in generalized assembly line balancing
- Scheduling Home Hospice Care with Logic-Based Benders Decomposition
- Using Logic-Based Benders Decomposition to Solve the Capacity- and Distance-Constrained Plant Location Problem
- A Constraint Programming Approach for Solving a Queueing Design and Control Problem
- Fast, Effective Algorithms for Simple Assembly Line Balancing Problems
- An improved mathematical program to solve the simple assembly line balancing problem
- Assembly-Line Balancing by Linear Programming
- Planning and Scheduling by Logic-Based Benders Decomposition
- Benders Decomposition for Production Routing Under Demand Uncertainty
- A Survey of Exact Algorithms for the Simple Assembly Line Balancing Problem
- Technical Note—Assembly-Line Balancing: Zero-One Programming with Fibonacci Search
- Collaborative Operating Room Planning and Scheduling
This page was built for publication: Solving the Type-2 Assembly Line Balancing with Setups Using Logic-Based Benders Decomposition
