On the complexity of non-preemptive shop scheduling with two jobs
type: Item
instance of: scholarly article
title: On the complexity of non-preemptive shop scheduling with two jobs
zbMATH Open document ID: 1008.90019
author: Tamás Kis
published in: Computing
publication date: 2002-12-01T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 1837286
zbMATH Keywords: mixed shop scheduling
zbMATH Keywords: computational complexity
zbMATH Keywords: pseudo-polynomial time algorithm
MaRDI profile type: Publication
full work available at URL: s00607-002-1455-z
OpenAlex ID: W1563263887
DOI: 10.1007/S00607-002-1455-Z
description: scientific article; zbMATH DE number 1837286