Balancing assembly lines effectively -- a computational comparison
type: Item
instance of: scholarly article
title: Balancing assembly lines effectively -- a computational comparison
zbMATH Open document ID: 0949.90034
DOI: 10.1016/S0377-2217(98)00173-8
author: Yanyan Li
published in: European Journal of Operational Research
publication date: 2000-04-09T00:00:00Z
Mathematics Subject Classification ID: 90B30
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 1370709
zbMATH Keywords: production scheduling
zbMATH Keywords: line balancing
zbMATH Keywords: computational experiment
zbMATH Keywords: branch and bound
MaRDI profile type: Publication
cites work: A Survey of Exact Algorithms for the Simple Assembly Line Balancing Problem
cites work: New Benchmark Results for the Resource-Constrained Project Scheduling Problem
cites work: Fast, Effective Algorithms for Simple Assembly Line Balancing Problems
cites work: Eureka: A Hybrid System for Assembly Line Balancing
cites work: Finding optimal line balances with OptPack
cites work: Note: Microcomputer Performance of OptPack on Hoffmann's Data Sets: Comparison with Eureka and FABLE
cites work: A two-process implicit enumeration algorithm for the simple assembly line balancing problem
cites work: SALOME: A Bidirectional Branch-and-Bound Procedure for Assembly Line Balancing
cites work: Dynamic Programming Solution of Sequencing Problems with Precedence Constraints
cites work: An Integer Programming Algorithm with Network Cuts for Solving the Assembly Line Balancing Problem
cites work: An optimal procedure for the single-model deterministic assembly line balancing problem
full work available at URL: s0377-2217(98)00173-8
OpenAlex ID: W2005121075
Wikidata QID: Q127246839
description: scientific article; zbMATH DE number 1370709