Single machine scheduling with start time dependent processing times: Some solvable cases
type: Item
instance of: scholarly article
title: Single machine scheduling with start time dependent processing times: Some solvable cases
zbMATH Open document ID: 0816.90088
DOI: 10.1016/0377-2217(94)90048-5
author: P. S. Sundararaghavan
author: Anand S. Kunnathur
published in: European Journal of Operational Research
publication date: 1995-01-11T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C20
Mathematics Subject Classification ID: 90C09
zbMATH DE Number: 709919
zbMATH Keywords: single machine scheduling
zbMATH Keywords: processing time penalties
zbMATH Keywords: due date
zbMATH Keywords: polynomial time optimal algorithms
MaRDI profile type: Publication
full work available at URL: 0377-2217(94)90048-5
OpenAlex ID: W2012767650
cites work: Q4057549
cites work: Minimizing the makespan with late start penalties added to processing times in a single facility scheduling problem
cites work: Q4051876
cites work: Scheduling of a Two-machine Flowshop with Processing Time Linearly Dependent on Job Waiting-time
description: scientific article; zbMATH DE number 709919