A FPTAS for minimizing total completion time in a single machine time-dependent scheduling problem
type: Item
instance of: scholarly article
title: A FPTAS for minimizing total completion time in a single machine time-dependent scheduling problem
zbMATH Open document ID: 1177.90176
author: Krzysztof Ocetkiewicz
published in: European Journal of Operational Research
publication date: 2009-12-21T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 5650825
zbMATH Keywords: scheduling
zbMATH Keywords: single machine
zbMATH Keywords: deteriorating jobs
zbMATH Keywords: total completion time
zbMATH Keywords: FPTAS
MaRDI profile type: Publication
full work available at URL: j.ejor.2009.07.025
OpenAlex ID: W2054179508
cites work: Designing PTASs for MIN-SUM scheduling problems
cites work: Scheduling with time dependent processing times: Review and extensions
cites work: A state-of-the-art review on scheduling with learning effects
cites work: Scheduling Deteriorating Jobs on a Single Processor
cites work: Parallel machine scheduling with time dependent processing times
cites work: A concise survey of scheduling with time-dependent processing times
cites work: Q4737345
cites work: Parallel-machine scheduling with simple linear deterioration to minimize total completion time
cites work: V-Shaped Policies for Scheduling Deteriorating Jobs
cites work: Complexity analysis of job-shop scheduling with deteriorating jobs
cites work: When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?
DOI: 10.1016/J.EJOR.2009.07.025
description: scientific article; zbMATH DE number 5650825