Scheduling resumable deteriorating jobs on a single machine with non-availability constraints
From MaRDI portal
Publication:620936
DOI10.1016/j.tcs.2010.09.017zbMath1207.90054MaRDI QIDQ620936
Shi-Sheng Li, Li Zhou, Baoqiang Fan, Li-Qi Zhang
Publication date: 2 February 2011
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2010.09.017
scheduling; non-availability constraint; fully polynomial-time approximation scheme; deteriorating job
90C60: Abstract computational complexity for mathematical programming problems
90B35: Deterministic scheduling theory in operations research
Related Items
Single-machine scheduling with deteriorating jobs and aging effects under an optional maintenance activity consideration, Scheduling a variable maintenance and linear deteriorating jobs on a single machine, Parallel-machine scheduling with time-dependent and machine availability constraints, Parallel machines scheduling with deteriorating jobs and availability constraints, SINGLE-MACHINE SCHEDULING WITH PROPORTIONALLY DETERIORATING JOBS SUBJECT TO AVAILABILITY CONSTRAINTS
Cites Work
- Scheduling deteriorating jobs subject to job or machine availability constraints
- Time-dependent scheduling
- Scheduling linear deteriorating jobs to minimize makespan with an availability constraint on a single machine
- Two-machine flowshop scheduling with availability constraints
- Scheduling jobs under simple linear deterioration
- A concise survey of scheduling with time-dependent processing times
- Complexity and approximability of scheduling resumable proportionally deteriorating jobs
- Scheduling linear deteriorating jobs with an availability constraint on a single machine
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?
- The NP-completeness column: An ongoing guide
