An FPTAS for uniform machine scheduling to minimize makespan with linear deterioration
type: Item
instance of: scholarly article
title: An FPTAS for uniform machine scheduling to minimize makespan with linear deterioration
zbMATH Open document ID: 1244.90097
author: Feifeng Zheng
author: Chengbin Chu
author: Jian Tong Zhang
author: Ming Liu
published in: Journal of Combinatorial Optimization
publication date: 2012-07-17T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 6057747
zbMATH Keywords: scheduling
zbMATH Keywords: uniform machine
zbMATH Keywords: linear deterioration
zbMATH Keywords: makespan
zbMATH Keywords: FPTAS
MaRDI profile type: Publication
full work available at URL: s10878-010-9364-0
OpenAlex ID: W1986415048
Wikidata QID: Q57185654
cites work: Scheduling with time dependent processing times: Review and extensions
cites work: Scheduling Deteriorating Jobs on a Single Processor
cites work: Parallel machine scheduling with time dependent processing times
cites work: Single machine scheduling with step-deteriorating processing times
cites work: Scheduling linear deteriorating jobs with rejection on a single machine
cites work: A concise survey of scheduling with time-dependent processing times
cites work: Due-date assignment and single machine scheduling with deteriorating jobs
cites work: Parallel-machine scheduling with simple linear deterioration to minimize total completion time
cites work: A fully polynomial approximation scheme for minimizing makespan of deteriorating jobs
cites work: A Fully Polynomial Approximation Scheme for the Weighted Earliness–Tardiness Problem
cites work: A note on the optimal sequence position for a rate-modifying activity under simple linear deterioration
cites work: V-Shaped Policies for Scheduling Deteriorating Jobs
cites work: Scheduling jobs under simple linear deterioration
DBLP publication ID: journals/jco/LiuZCZ12
DOI: 10.1007/S10878-010-9364-0
description: scientific article; zbMATH DE number 6057747