Complexity results for flow-shop problems with a single server
type: Item
instance of: scholarly article
title: Complexity results for flow-shop problems with a single server
zbMATH Open document ID: 1066.90024
author: Peter Brucker
author: Sigrid Knust
author: G. Wang
published in: European Journal of Operational Research
publication date: 2005-04-21T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 2160295
zbMATH Keywords: Complexity results
zbMATH Keywords: Flow-shop
zbMATH Keywords: Setup times
zbMATH Keywords: Single server
MaRDI profile type: Publication
full work available at URL: j.ejor.2004.04.010
OpenAlex ID: W2170926441
cites work: Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times
cites work: Scheduling equal-length jobs on identical parallel machines
cites work: Complexity results for parallel machine problems with a single server
cites work: One-operator-two-machine flowshop scheduling with setup and dismounting times
cites work: The Complexity of Flowshop and Jobshop Scheduling
cites work: Scheduling for parallel dedicated machines with a single server
cites work: Parallel machine scheduling with a common server
cites work: Q5519710
cites work: Parallel machine scheduling problems with a single server
cites work: An approximation algorithm for parallel machine scheduling with a common server
DOI: 10.1016/J.EJOR.2004.04.010
description: scientific article; zbMATH DE number 2160295