A branch and bound algorithm to minimize the total weighted flowtime for the two-stage assembly scheduling problem
type: Item
instance of: scholarly article
title: A branch and bound algorithm to minimize the total weighted flowtime for the two-stage assembly scheduling problem
zbMATH Open document ID: 1029.90031
DOI: 10.1016/S0305-0548(01)00098-3
author: Ali Tozkapan
author: Chia-Shin Chung
author: ömer Kirca
published in: Computers \& Operations Research
publication date: 2003-04-28T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 1902976
zbMATH Keywords: Scheduling
zbMATH Keywords: two-stage assembly flowshop
zbMATH Keywords: branch and bound algorithm
zbMATH Keywords: total weighted flowtime scheduling
MaRDI profile type: Publication
cites work: The Two-Stage Assembly Scheduling Problem: Complexity and Approximation
cites work: Minimizing the Makespan in the 3-Machine Assembly-Type Flowshop Scheduling Problem
cites work: A branch and bound algorithm for the two-stage assembly scheduling problem
cites work: The three-stage assembly flowshop scheduling problem
cites work: Minimizing mean flowtime in a two-machine flowshop with sequence-independent setup times
full work available at URL: s0305-0548(01)00098-3
OpenAlex ID: W2059573430
description: scientific article; zbMATH DE number 1902976