An improved approximation scheme for scheduling a maintenance and proportional deteriorating jobs
type: Item
instance of: scholarly article
title: An improved approximation scheme for scheduling a maintenance and proportional deteriorating jobs
zbMATH Open document ID: 1331.90027
author: Imed Kacem
author: Eugene Levner
published in: Journal of Industrial and Management Optimization
publication date: 2015-12-18T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C39
zbMATH DE Number: 6522358
zbMATH Keywords: scheduling
zbMATH Keywords: deteriorating jobs
zbMATH Keywords: total completion time
zbMATH Keywords: maintenance activities
zbMATH Keywords: approximation scheme
MaRDI profile type: Publication
full work available at URL: jimo.2016.12.811
OpenAlex ID: W2524755176
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: Fast approximation algorithm for job sequencing with deadlines
cites work: Scheduling linear deteriorating jobs with an availability constraint on a single machine
cites work: Approximation schemes for scheduling on a single machine subject to cumulative deterioration and maintenance
cites work: Machine scheduling with an availability constraint
cites work: Approximation schemes for scheduling a maintenance and linear deteriorating jobs
cites work: A FPTAS for minimizing total completion time in a single machine time-dependent scheduling problem
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.3934/JIMO.2016.12.811
description: scientific article; zbMATH DE number 6522358