Makespan minimization in open shops: A polynomial time approximation scheme
type: Item
instance of: scholarly article
title: Makespan minimization in open shops: A polynomial time approximation scheme
zbMATH Open document ID: 0920.90075
DOI: 10.1007/BF01585871
author: Gerhard J. Woeginger
author: Sergey Sevastyanov
published in: Mathematical Programming. Series A. Series B
publication date: 1999-06-03T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 1294690
zbMATH Keywords: worst-case analysis
zbMATH Keywords: polynomial time approximation scheme
zbMATH Keywords: makespan minimization
zbMATH Keywords: open shop scheduling
MaRDI profile type: Publication
cites work: Open Shop Scheduling to Minimize Finish Time
cites work: Approximation Algorithms for Three-Machine Open Shop Scheduling
cites work: Short Shop Schedules
cites work: Improved Approximation Algorithms for Shop Scheduling Problems
cites work: Chernoff–Hoeffding Bounds for Applications with Limited Independence
cites work: An Algorithm for the Open-Shop Problem
Recommended article: Makespan minimization in job shops: a polynomial time approximation scheme
Recommended article: Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches
Recommended article: New efficient heuristics for scheduling open shops with makespan minimization
Recommended article: Minimizing the makespan in open‐shop scheduling problems with a convex resource consumption function
Recommended article: Makespan Minimization in No-Wait Flow Shops: A Polynomial Time Approximation Scheme
Recommended article: Makespan Minimization in Job Shops: A Linear Time Approximation Scheme
Recommended article: A linear time approximation scheme for makespan minimization in an open shop with release dates
Recommended article: Q4367460
Recommended article: Four decades of research on the open-shop scheduling problem to minimize the makespan
Recommended article: Polynomial time approximation algorithms for proportionate open‐shop scheduling
description: scientific article; zbMATH DE number 1294690