Inapproximability results for no-wait job shop scheduling.
type: Item
instance of: scholarly article
title: Inapproximability results for no-wait job shop scheduling.
zbMATH Open document ID: 1054.90042
author: Gerhard J. Woeginger
published in: Operations Research Letters
publication date: 2005-01-11T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 68W25
zbMATH DE Number: 2125888
zbMATH Keywords: Approximation algorithms
zbMATH Keywords: APX hardness
zbMATH Keywords: Shop scheduling
MaRDI profile type: Publication
full work available at URL: j.orl.2003.10.003
OpenAlex ID: W2024793042
cites work: Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: Approximability of flow shop scheduling
cites work: A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
cites work: Makespan minimization in job shops: a polynomial time approximation scheme
cites work: Maximum bounded 3-dimensional matching is MAX SNP-complete
cites work: Q3995531
cites work: The hardness of approximation: Gap location
cites work: The Three-Machine No-Wait Flow Shop is NP-Complete
cites work: Q3670909
cites work: Complexity of Scheduling Shops with No Wait in Process
cites work: Makespan minimization in open shops: A polynomial time approximation scheme
cites work: Q4239706
cites work: Makespan Minimization in No-Wait Flow Shops: A Polynomial Time Approximation Scheme
cites work: Short Shop Schedules
DOI: 10.1016/J.ORL.2003.10.003
description: scientific article; zbMATH DE number 2125888