Complexity and approximability of scheduling resumable proportionally deteriorating jobs
From MaRDI portal
Publication:2379562
Recommendations
- Scheduling resumable deteriorating jobs on a single machine with non-availability constraints
- Approximation scheme for scheduling resumable proportionally deteriorating jobs
- Scheduling deteriorating jobs subject to job or machine availability constraints
- Single-machine scheduling with proportionally deteriorating jobs subject to availability constraints
- On a scheduling problem of time deteriorating jobs
Cites work
- A concise survey of scheduling with time-dependent processing times
- Scheduling deteriorating jobs subject to job or machine availability constraints
- Scheduling linear deteriorating jobs to minimize makespan with an availability constraint on a single machine
- Scheduling linear deteriorating jobs with an availability constraint on a single machine
- The NP-completeness column: An ongoing guide
- Time-dependent scheduling
- Two-machine flowshop scheduling with availability constraints
- When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?
Cited in
(38)- Total tardiness minimization in permutation flowshop with deterioration consideration
- Single machine scheduling with aging effect and upper-bounded actual processing times
- A branch-and-price algorithm for scheduling of deteriorating jobs and flexible periodic maintenance on a single machine
- Parallel-machine scheduling with time-dependent and machine availability constraints
- Single-machine serial-batching scheduling with a machine availability constraint, position-dependent processing time, and time-dependent set-up time
- Single-machine scheduling and slack due-date assignment with aging effect and deteriorating maintenance
- A review of four decades of time-dependent scheduling: main results, new topics, and open problems
- An uncertain parallel machine problem with deterioration and learning effect
- Approximation schemes for scheduling a maintenance and linear deteriorating jobs
- Unrelated parallel-machine scheduling with position-dependent deteriorating jobs and resource-dependent processing time
- Bicriteria hierarchical optimization of two-machine flow shop scheduling problem with time-dependent deteriorating jobs
- Single-machine scheduling with proportionally deteriorating jobs subject to availability constraints
- Single-machine scheduling problems simultaneous with deteriorating and learning effects under a deteriorating maintenance consideration
- Approximation scheme for scheduling resumable proportionally deteriorating jobs
- Scheduling deteriorating jobs on a single machine with release times and rejection
- 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
- scientific article; zbMATH DE number 942479 (Why is no real title available?)
- Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan
- Single-machine scheduling with deteriorating jobs and setup times to minimize the maximum tardiness
- Single-machine Scheduling Problems with Aging/Deteriorating Effect under an Optional Maintenance Activity Consideration
- A single-machine scheduling problem with two-agent and deteriorating jobs
- Single-machine scheduling with deteriorating functions for job processing times
- Single-machine scheduling problems with both start-time dependent learning and position dependent aging effects under deteriorating maintenance consideration
- Scheduling resumable deteriorating jobs on a single machine with non-availability constraints
- Minimizing the total completion time in single-machine scheduling with aging/deteriorating effects and deteriorating maintenance activities
- Scheduling with periodic availability constraints to minimize makespan
- Online scheduling with linear deteriorating jobs to minimize the total weighted completion time
- Theory and methodology of time-dependent scheduling: past, present and future
- Complexity analysis and approximation algorithms for the single-machine scheduling problem with workload-dependent maintenance activities
- Two new approximation schemes for maximizing the weighted number of just-in-time jobs in a multi-machine proportionate flow shop
- Scheduling maintenance activities subject to stochastic job-dependent machine deterioration
- Unrelated parallel-machine scheduling with deterioration effects and deteriorating multi-maintenance activities for minimizing the total completion time
- Scheduling maintenance activities subject to continuous stochastic job-dependent machine deterioration
- Isomorphic scheduling problems
- Scheduling deteriorating jobs subject to job or machine availability constraints
- An improved approximation scheme for scheduling a maintenance and proportional deteriorating jobs
- Scheduling time-dependent jobs under mixed deterioration
This page was built for publication: Complexity and approximability of scheduling resumable proportionally deteriorating jobs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2379562)