A note on proving the strong NP-hardness of a scheduling problem with position dependent job processing times
type: Item
instance of: scholarly article
title: A note on proving the strong NP-hardness of a scheduling problem with position dependent job processing times
zbMATH Open document ID: 1268.90021
author: Radosław Rudek
published in: Optimization Letters
publication date: 2013-03-12T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 6143322
zbMATH Keywords: computational analysis
zbMATH Keywords: strong NP-hardness
zbMATH Keywords: scheduling
zbMATH Keywords: learning effect
zbMATH Keywords: position-dependent processing time
MaRDI profile type: Publication
full work available at URL: s11590-012-0445-0
OpenAlex ID: W2042016438
cites work: Scheduling jobs with position-dependent processing times
cites work: New results on the least common multiple of consecutive integers
cites work: Q4198056
cites work: Q3856819
cites work: Complexity of single machine hierarchical scheduling: A survey
DOI: 10.1007/S11590-012-0445-0
description: scientific article; zbMATH DE number 6143322