A polynomial-time open-shop problem with an arbitrary number of machines
type: Item
instance of: scholarly article
title: A polynomial-time open-shop problem with an arbitrary number of machines
zbMATH Open document ID: 0875.90320
DOI: 10.1007/BF01291296
published in: Cybernetics and Systems Analysis
publication date: 1997-01-20T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 949107
zbMATH Keywords: open-shop problem
zbMATH Keywords: scheduling theory
author: Sergey Sevastyanov
MaRDI profile type: Publication
cites work: Open Shop Scheduling to Minimize Finish Time
cites work: An Algorithm for the Open-Shop Problem
cites work: Q4744042
Recommended article: Q4367460
Recommended article: An NP-Hard Open Shop Scheduling Problem with Polynomial Average Time Complexity
Recommended article: Polynomial-time approximation scheme for concurrent open shop scheduling with a fixed number of machines to minimize the total weighted completion time
Recommended article: Polynomial time approximation algorithms for proportionate open‐shop scheduling
Recommended article: A polynomially solvable case of the two-stage open shop problem for three machines
Recommended article: A polynomial algorithm for an open shop problem with unit processing times and tree constraints
Recommended article: Polynomial time algorithms for two special classes of the proportionate multiprocessor open shop
Recommended article: Polynomial time algorithms for special open shop problems with precedence constraints and unit processing times
Recommended article: A polynomial algorithm for the \([n/m/0,\;t_{ij}=1,\text{ tree}/C_{\max}]\) open shop problem
Recommended article: Open shop scheduling with maximal machines
description: scientific article; zbMATH DE number 949107