Open shop scheduling with maximal machines
type: Item
instance of: scholarly article
title: Open shop scheduling with maximal machines
zbMATH Open document ID: 0893.90091
DOI: 10.1016/S0166-218X(97)00018-8
published in: Discrete Applied Mathematics
publication date: 1998-01-26T00:00:00Z
full work available at URL: dam
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 1109942
zbMATH Keywords: polynomial algorithms
zbMATH Keywords: open shop makespan problem
author: George J. Kyparisis
author: C. Koulamas
MaRDI profile type: Publication
cites work: Open-shop scheduling problems with dominated machines
cites work: An Algorithm for the Open-Shop Problem
cites work: Open Shop Scheduling to Minimize Finish Time
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: A Note On The Complexity Of Openshop Scheduling Problems
cites work: Scheduling ordered open shops
cites work: A concise survey of efficiently solvable special cases of the permutation flow-shop problem
cites work: Vector Summation in Banach Space and Polynomial Algorithms for Flow Shops and Open Shops
description: scientific article; zbMATH DE number 1109942