Type-II Stochastic Transfer Line Balancing Problem

Date

2026-2

Author

Telemeci, Yasin Ersin

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

61
views

81
downloads

Cite This

This thesis studies the Type-II Transfer Line Balancing Problem under stochastic workstation maintenance times. In contrast to deterministic formulations that incorporate maintenance effects through average availability parameters, maintenance durations are explicitly modeled as random variables, and their impact is directly embedded in cycle time performance. To capture maintenance-induced variability, a scenario-based stochastic programming formulation, a constraint programming model, and a Branch and Bound algorithm are developed with the objective of minimizing expected cycle time subject to technological, precedence, and workstation exclusion and inclusion constraints. Due to the combinatorial structure of block formation and operation assignment decisions, exact solution approaches become computationally challenging for large-sized instances. To address large-sized instances, matheuristic solution approaches are introduced that integrate mathematical programming components with structured improvement procedures. These approaches employ decomposition-based block formation, workstation assignment mechanisms, and local improvement procedures to enhance solution quality while maintaining computational efficiency. The results of extensive computational experiments reveal that exact methods are effective for small-to-medium-sized instances, while the proposed matheuristic procedures can solve large-sized instances within reasonable computational times and produce high-quality solutions.

Subject Keywords

Type-II Transfer Line Balancing, Stochastic Programming, Branch and Bound Algorithm, Matheuristic

URI

https://hdl.handle.net/11511/118774

Collections

Graduate School of Natural and Applied Sciences, Thesis