Approximability of flow shop scheduling
type: Item
instance of: scholarly article
title: Approximability of flow shop scheduling
zbMATH Open document ID: 0920.90073
DOI: 10.1007/BF01585870
author: Leslie A. Hall
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: 1294689
zbMATH Keywords: polynomial approximation scheme
zbMATH Keywords: flow shop scheduling
MaRDI profile type: Publication
cites work: Fixed-Parameter Tractability and Completeness I: Basic Results
cites work: Q4501141
cites work: Q4198056
cites work: The Complexity of Flowshop and Jobshop Scheduling
cites work: Open Shop Scheduling to Minimize Finish Time
cites work: Jackson's Rule for Single-Machine Scheduling: Making a Good Heuristic Better
cites work: Optimal two- and three-stage production schedules with set-up time included
cites work: PERFORMANCE ANALYSIS OF SIX APPROXIMATION ALGORITHMS FOR THE ONE-MACHINE MAXIMUM LATENESS SCHEDULING PROBLEM WITH READY TIMES
cites work: Packet routing and job-shop scheduling in \(O\) (congestion + dilation) steps
cites work: Q4124328
cites work: Approximation algorithms for scheduling unrelated parallel machines
cites work: Fast Approximation Algorithms for Fractional Packing and Covering Problems
cites work: Analysis of a linear programming heuristic for scheduling unrelated parallel machines
cites work: Chernoff–Hoeffding Bounds for Applications with Limited Independence
cites work: Bounding algorithm for the routing problem with arbitrary paths and alternative servers
cites work: Improved Approximation Algorithms for Shop Scheduling Problems
cites work: Short Shop Schedules
full work available at URL: https://doi.org/10.1007/bf01585870
OpenAlex ID: W2075846649
Recommended article: Approximation algorithms for the parallel flow shop problem
Recommended article: Hardness of Approximating Flow and Job Shop Scheduling Problems
Recommended article: Approximation results for flow shop scheduling problems with machine availability constraints
Recommended article: Improved Bounds for Flow Shop Scheduling
Recommended article: Approximation algorithms for two-stage flexible flow shop scheduling
Recommended article: Worst-case analysis of an approximation algorithm for flow-shop scheduling
Recommended article: Q4806815
Recommended article: Improved Approximation Algorithms for Shop Scheduling Problems
Recommended article: Approximation algorithms for scheduling multiple two-stage flowshops
Recommended article: Tight Bounds for Permutation Flow Shop Scheduling
description: scientific article; zbMATH DE number 1294689