A polynomial algorithm for an open shop problem with unit processing times and tree constraints
type: Item
instance of: scholarly article
title: A polynomial algorithm for an open shop problem with unit processing times and tree constraints
zbMATH Open document ID: 0833.90066
DOI: 10.1016/0166-218X(93)E0156-S
author: Heidemarie Bräsel
author: Dagmar Kluge
author: Frank Werner
published in: Discrete Applied Mathematics
publication date: 1995-05-17T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C60
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 756141
zbMATH Keywords: open shop problem
zbMATH Keywords: unit processing times
zbMATH Keywords: tree constraints
zbMATH Keywords: polynomial algorithm
Wikidata QID: Q57634009
MaRDI profile type: Publication
cites work: Openshop and flowshop scheduling to minimize sum of completion times
cites work: A polynomial algorithm for the \([n/m/0,\;t_{ij}=1,\text{ tree}/C_{\max}]\) open shop problem
cites work: Open shop problems with unit time operations
cites work: Unit Execution Time Shop Problems
cites work: Q3899811
cites work: Scheduling Open Shops with Unit Execution Times to Minimize Functions of Due Dates
cites work: Scheduling with deadlines and loss functions
cites work: Q3994687
full work available at URL: 0166-218x(93)e0156-s
OpenAlex ID: W2003459360
description: scientific article; zbMATH DE number 756141