Scheduling resumable deteriorating jobs on a single machine with non-availability constraints
type: Item
instance of: scholarly article
title: Scheduling resumable deteriorating jobs on a single machine with non-availability constraints
zbMATH Open document ID: 1207.90054
author: Baoqiang Fan
author: Shisheng Li
author: Li Zhou
author: Li-Qi Zhang
published in: Theoretical Computer Science
publication date: 2011-02-02T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 5843638
zbMATH Keywords: scheduling
zbMATH Keywords: deteriorating job
zbMATH Keywords: non-availability constraint
zbMATH Keywords: fully polynomial-time approximation scheme
MaRDI profile type: Publication
full work available at URL: j.tcs.2010.09.017
OpenAlex ID: W2073617864
cites work: A concise survey of scheduling with time-dependent processing times
cites work: Scheduling deteriorating jobs subject to job or machine availability constraints
cites work: Time-dependent scheduling
cites work: Complexity and approximability of scheduling resumable proportionally deteriorating jobs
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: Scheduling linear deteriorating jobs with an availability constraint on a single machine
cites work: The NP-completeness column: An ongoing guide
cites work: Two-machine flowshop scheduling with availability constraints
cites work: Scheduling jobs under simple linear deterioration
cites work: When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?
cites work: Scheduling linear deteriorating jobs to minimize makespan with an availability constraint on a single machine
DOI: 10.1016/J.TCS.2010.09.017
description: scientific article; zbMATH DE number 5843638