A polynomial-time algorithm for a flow-shop batching problem with equal-length operations
type: Item
instance of: scholarly article
title: A polynomial-time algorithm for a flow-shop batching problem with equal-length operations
zbMATH Open document ID: 1230.90087
author: Peter Brucker
author: N. V. Shakhlevich
published in: Journal of Scheduling
publication date: 2012-01-16T00:00:00Z
full work available at URL: FlowShopBatching-BruckerShakhlevich.pdf
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 5997878
zbMATH Keywords: batch scheduling
zbMATH Keywords: flow shop
zbMATH Keywords: polynomial-time algorithm
MaRDI profile type: Publication
OpenAlex ID: W2081195398
Wikidata QID: Q59902867
cites work: Q4826104
cites work: Q4949162
cites work: A note on flow-shop and job-shop batch scheduling with identical processing-time jobs
cites work: Single machine scheduling with batch-dependent setup times
cites work: Open-shop batch scheduling with identical jobs
cites work: Flow-shop batch scheduling with identical processing-time jobs
cites work: Minimizing flow-time on a single machine with integer batch sizes
cites work: One-pass batching algorithms for the one-machine problem
cites work: Batching and scheduling in a multi-machine flow shop
cites work: Batching in single operation manufacturing systems
cites work: A polynomial algorithm for a one machine batching problem
DBLP publication ID: journals/scheduling/BruckerS11a
DOI: 10.1007/S10951-009-0150-8
description: scientific article; zbMATH DE number 5997878