MIP-Based Heuristics for a Robust Transfer Lines Balancing Problem

DOI10.1007/978-3-030-91059-4_9zbMATH Open1523.90143MaRDI QIDQ6488349FDOQ6488349

Authors: Pavel Borisovsky, Olga Battaïa 

Publication date: 13 April 2023

Recommendations

• Robust balancing of transfer lines with blocks of uncertain parallel tasks under fixed cycle time and space restrictions
• Scenario based robust line balancing: Computational complexity
• Stability factor for robust balancing of simple assembly lines under uncertainty
• Exact and heuristic algorithms for balancing transfer lines when a set of available spindle heads is given
• A transfer line balancing problem by heuristic methods: industrial case studies

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35) Mixed integer programming (90C11)

Cites Work

• Production Planning by Mixed Integer Programming
• Stability measure for a generalized assembly line balancing problem
• Maximizing the robustness for simple assembly lines with fixed cycle time and limited number of workstations
• Robust facility location
• A heuristic multi-start decomposition approach for optimal design of serial machining lines
• Balancing large-scale machining lines with multi-spindle heads using decomposition
• Robust balancing of transfer lines with blocks of uncertain parallel tasks under fixed cycle time and space restrictions

Cited In (4)

• Title not available (Why is that?)
• Scenario based robust line balancing: Computational complexity
• On solving the robust transfer line balancing problem with parallel tasks and interval processing times
• Robust balancing of transfer lines with blocks of uncertain parallel tasks under fixed cycle time and space restrictions

This page was built for publication: MIP-Based Heuristics for a Robust Transfer Lines Balancing Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6488349)