Assembly line balancing as generalized bin packing
type: Item
instance of: scholarly article
title: Assembly line balancing as generalized bin packing
zbMATH Open document ID: 0491.90049
DOI: 10.1016/0167-6377(82)90046-3
author: T. S. Wee
author: Michael Magazine
published in: Operations Research Letters
publication date: 1982-01-01T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 68R99
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 3773348
zbMATH Keywords: resource constrained scheduling
zbMATH Keywords: bin packing
zbMATH Keywords: heuristics
zbMATH Keywords: assembly line balancing problem
zbMATH Keywords: tasks
zbMATH Keywords: precedence relations
zbMATH Keywords: work stations
zbMATH Keywords: cycle time
zbMATH Keywords: worst case performance bounds
MaRDI profile type: Publication
full work available at URL: 0167-6377(82)90046-3
OpenAlex ID: W2160785839
cites work: Resource constrained scheduling as generalized bin packing
cites work: An Algorithm for the Line Balancing Problem
cites work: Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
cites work: Dynamic Programming Solution of Sequencing Problems with Precedence Constraints
description: scientific article; zbMATH DE number 3773348