Lower bounds for minimizing total completion time in a two-machine flow shop
type: Item
instance of: scholarly article
title: Lower bounds for minimizing total completion time in a two-machine flow shop
zbMATH Open document ID: 1154.90459
author: Linda van Norden
author: Han Hoogeveen
author: Steef van de Velde
published in: Journal of Scheduling
publication date: 2007-05-15T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 5153381
MaRDI profile type: Publication
full work available at URL: s10951-006-8789-x
OpenAlex ID: W2086748991
cites work: The two-machine flowshop total completion time problem: improved lower bounds and a branch-and-bound algorithm
cites work: Two-machine flowshop scheduling to minimize mean flow time
cites work: Q4658190
cites work: An improved branch-and-bound algorithm for the two machine total completion time flow shop problem
cites work: The two-machine total completion time flow shop problem
cites work: One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties
cites work: Stronger Lagrangian bounds by use of slack variables: Applications to machine scheduling problems
cites work: Scheduling by positional completion times: Analysis of a two-stage flow shop problem with a batching machine
cites work: Exact, Approximate, and Guaranteed Accuracy Algorithms for the Flow-Shop Problem n / 2 / F / F¯
cites work: A bicriteria approach to the two-machine flow shop scheduling problem
cites work: Minimizing the sum of the job completion times in the two-machine flow shop by Lagrangian relaxation
DOI: 10.1007/S10951-006-8789-X
description: scientific article; zbMATH DE number 5153381