A fast and effective heuristic for smoothing workloads on assembly lines: algorithm design and experimental analysis - Rennes School of Business Access content directly
Journal Articles Computers and Operations Research Year : 2020

A fast and effective heuristic for smoothing workloads on assembly lines: algorithm design and experimental analysis

Abstract

Workload smoothing on assembly lines, which aims to evenly assign tasks to stations, supports workforce planning and resource optimization. In this paper, we study smoothing assembly lines and develop a problem-specific heuristic to efficiently solve large-sized instances. To build solutions, the algorithm uses a number of well-known priority rules for task assignment in conjunction with a probabilistic decision-making procedure for closing workstations. We conduct an experimental design for selecting the best performing priority rules and for tuning the probabilistic decision-making procedure. The efficiency of our algorithm is tested and demonstrated through an extensive experimental study.
Fichier principal
Vignette du fichier
S0305054819302990.pdf (503.78 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-02898200 , version 1 (21-07-2022)

Licence

Attribution - NonCommercial

Identifiers

Cite

Öncü Hazir, Maher Agi, Jeremy Guérin. A fast and effective heuristic for smoothing workloads on assembly lines: algorithm design and experimental analysis. Computers and Operations Research, 2020, 115, pp.104857. ⟨10.1016/j.cor.2019.104857⟩. ⟨hal-02898200⟩
56 View
15 Download

Altmetric

Share

Gmail Facebook X LinkedIn More