Exponential inapproximability and FPTAS for scheduling with availability constraints
type: Item
instance of: scholarly article
title: Exponential inapproximability and FPTAS for scheduling with availability constraints
zbMATH Open document ID: 1188.68083
author: Bin Fu
author: Yumei Huo
author: Hairong Zhao
published in: Theoretical Computer Science
publication date: 2009-07-10T00:00:00Z
Mathematics Subject Classification ID: 68M20
zbMATH DE Number: 5577377
zbMATH Keywords: inapproximability
zbMATH Keywords: FPTAS
zbMATH Keywords: machine availability
zbMATH Keywords: total weighted completion time
zbMATH Keywords: scheduling
MaRDI profile type: Publication
full work available at URL: j.tcs.2009.03.012
OpenAlex ID: W2005313518
cites work: Single machine flow-time scheduling with a single breakdown
cites work: Scheduling preemptable tasks on parallel processors with limited availability
cites work: Non-preemptive two-machine open shop scheduling with non-availability constraints
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: Two-machine flow shops with limited machine availability
cites work: Approximation results for flow shop scheduling problems with machine availability constraints
cites work: Current trends in deterministic scheduling
cites work: Machine scheduling with an availability constraint
cites work: Scheduling jobs and maintenance activities on parallel machines
cites work: Single machine flow-time scheduling with scheduled maintenance
cites work: Parallel machine scheduling with machine availability and eligibility constraints
cites work: Q3525910
cites work: Machine scheduling with availability constraints
cites work: Scheduling with limited machine availability
cites work: Scheduling machine-dependent jobs to minimize lateness on machines with identical speed under availability constraints
cites work: Complexity and algorithms for two-stage flexible flowshop scheduling with availability constraints
cites work: Preemptive scheduling with availability constraints to minimize total weighted completion times
DOI: 10.1016/J.TCS.2009.03.012
description: scientific article; zbMATH DE number 5577377