Approximation algorithms for the multiprocessor open shop scheduling problem
type: Item
instance of: scholarly article
title: Approximation algorithms for the multiprocessor open shop scheduling problem
zbMATH Open document ID: 0967.90049
DOI: 10.1016/S0167-6377(99)00005-X
author: P. Schuurman
author: Gerhard J. Woeginger
published in: Operations Research Letters
publication date: 2001-09-03T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 1347055
zbMATH Keywords: open shop
zbMATH Keywords: scheduling
zbMATH Keywords: worst case analysis
zbMATH Keywords: approximation algorithm
MaRDI profile type: Publication
cites work: Worst-case analysis of heuristics for open shops with parallel machines
cites work: Q4198056
cites work: Open Shop Scheduling to Minimize Finish Time
cites work: Bounds on Multiprocessing Timing Anomalies
cites work: Scheduling open shops with parallel machines
cites work: Makespan minimization in open shops: A polynomial time approximation scheme
cites work: Short Shop Schedules
description: scientific article; zbMATH DE number 1347055