Strong NP-hardness of the single machine multi-operation jobs total completion time scheduling problem.
type: Item
instance of: scholarly article
title: Strong NP-hardness of the single machine multi-operation jobs total completion time scheduling problem.
zbMATH Open document ID: 1043.90031
DOI: 10.1016/S0020-0190(01)00274-5
author: Yanyan Li
published in: Information Processing Letters
publication date: 2003-01-21T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 68M20
zbMATH DE Number: 1856356
zbMATH Keywords: Scheduling
zbMATH Keywords: Single machine multi-operation jobs
MaRDI profile type: Publication
cites work: Some simplified NP-complete graph problems
cites work: Q4198056
cites work: Scheduling multi-operation jobs on a single machine
full work available at URL: s0020-0190(01)00274-5
OpenAlex ID: W2061019866
description: scientific article; zbMATH DE number 1856356