Uniform parallel-machine scheduling with time dependent processing times
type: Item
instance of: scholarly article
title: Uniform parallel-machine scheduling with time dependent processing times
zbMATH Open document ID: 1334.90058
author: Juan Zou
author: Yuzhong Zhang
author: Cuixia Miao
published in: Journal of the Operations Research Society of China
publication date: 2014-09-29T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 6348910
zbMATH Keywords: scheduling
zbMATH Keywords: uniform machine
zbMATH Keywords: linear deterioration
zbMATH Keywords: fully polynomial time approximation scheme
MaRDI profile type: Publication
full work available at URL: s40305-013-0014-y
OpenAlex ID: W1986200636
cites work: Scheduling Deteriorating Jobs on a Single Processor
cites work: Scheduling jobs under simple linear deterioration
cites work: Parallel-machine scheduling with time dependent processing times
cites work: Q4233364
cites work: An FPTAS for uniform machine scheduling to minimize makespan with linear deterioration
cites work: Scheduling with time dependent processing times: Review and extensions
cites work: A concise survey of scheduling with time-dependent processing times
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: A fully polynomial approximation scheme for minimizing makespan of deteriorating jobs
cites work: Techniques for scheduling with rejection
cites work: Algorithms for Scheduling Independent Tasks
cites work: Algorithms and Data Structures
DOI: 10.1007/S40305-013-0014-Y
description: scientific article; zbMATH DE number 6348910