A Branch and Cut Approach for Workload Smoothing on Assembly Lines

DOI10.1287/ijoc.9.4.335zbMath0901.90133OpenAlexW2014391752MaRDI QIDQ4376734

Wilbert E. Wilhelm, Anulark Pinnoi

Publication date: 11 February 1998

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.9.4.335

zbMATH Keywords

cutting planebranch-and-cutprecedence graphpreprocessingassembly line workload smoothing problem

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (7)

Balancing mixed-model assembly lines: a computational evaluation of objectives to smoothen workload ⋮ A classification of assembly line balancing problems ⋮ R-SALSA: a branch, bound, and remember algorithm for the workload smoothing problem on simple assembly lines ⋮ SALSA: combining branch-and-bound with dynamic programming to smoothen workloads in simple assembly line balancing ⋮ A fast and effective heuristic for smoothing workloads on assembly lines: algorithm design and experimental analysis ⋮ State-of-the-art exact and heuristic solution procedures for simple assembly line balancing ⋮ Valid inequalities for a class of assembly system problems

This page was built for publication: A Branch and Cut Approach for Workload Smoothing on Assembly Lines