Parallel-machine scheduling of simple linear deteriorating jobs
From MaRDI portal
Recommendations
- Parallel-machine scheduling with simple linear deterioration to minimize total completion time
- An approximation algorithm for parallel machine scheduling with simple linear deterioration
- Parallel machine scheduling problems with proportionally deteriorating jobs
- Single machine parallel-batch scheduling with deteriorating jobs
- Approximation algorithms for parallel machine scheduling with linear deterioration
Cites work
- A concise survey of scheduling with time-dependent processing times
- A fully polynomial approximation scheme for minimizing makespan of deteriorating jobs
- A Fully Polynomial Approximation Scheme for the Weighted Earliness–Tardiness Problem
- scientific article; zbMATH DE number 5345854 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 942479 (Why is no real title available?)
- Minimizing the makespan with late start penalties added to processing times in a single facility scheduling problem
- Multi-Machine Scheduling With Linear Deterioration
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Parallel machine scheduling with time dependent processing times
- Parallel-machine scheduling with simple linear deterioration to minimize total completion time
- Scheduling Deteriorating Jobs on a Single Processor
- Scheduling jobs under simple linear deterioration
- 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
- Scheduling with time dependent processing times: Review and extensions
Cited in
(44)- Single machine parallel-batch scheduling with deteriorating jobs
- Parallel machine scheduling with completion-time-based criteria and sequence-dependent deterioration
- Parallel-machine scheduling with time-dependent and machine availability constraints
- Iterated greedy with random variable neighborhood descent for scheduling jobs on parallel machines with deterioration effect
- Coordination mechanisms for scheduling games with proportional deterioration
- Identical parallel machine scheduling with time-dependent processing times
- Parallel-batch scheduling with two models of deterioration to minimize the makespan
- Unrelated parallel-machine scheduling with aging effects and multi-maintenance activities
- Parallel machine scheduling with time dependent processing times
- Bounded parallel-batch scheduling on single and multi machines for deteriorating jobs
- Batch scheduling with proportional-linear deterioration and outsourcing
- Uniform parallel machine scheduling with resource consumption constraint
- Patient scheduling with deteriorating treatment duration and maintenance activity
- Minimizing total load on parallel machines with linear deterioration
- An approximation algorithm based on game theory for scheduling simple linear deteriorating jobs
- Parallel machines scheduling with deteriorating jobs and availability constraints
- A review of four decades of time-dependent scheduling: main results, new topics, and open problems
- Single-machine batch scheduling of linear deteriorating jobs
- A general variable neighborhood search for single-machine total tardiness scheduling problem with step-deteriorating jobs
- Unrelated parallel-machine scheduling problems with multiple rate-modifying activities
- Parallel-machine scheduling with simple linear deterioration to minimize total completion time
- Parallel-machine scheduling with time dependent processing times
- Makespan minimization on three-machine flow shop with deteriorating jobs
- Parallel-machine scheduling with maintenance: praising the assignment problem
- Parallel machine scheduling to minimize the makespan with sequence dependent deteriorating effects
- Parallel machine scheduling problems with proportionally deteriorating jobs
- Single-machine scheduling with deteriorating jobs and aging effects under an optional maintenance activity consideration
- Approximation algorithms for parallel machine scheduling with linear deterioration
- An FPTAS for uniform machine scheduling to minimize makespan with linear deterioration
- Uniform parallel-machine scheduling with time dependent processing times
- NP-hard cases in scheduling deteriorating jobs on dedicated machines
- Single-machine scheduling with deteriorating jobs
- A comparison of mixed-integer linear programming models for workforce scheduling with position-dependent processing times
- Heuristics for parallel machine scheduling with deterioration effect
- Parallel machine scheduling with linearly decreasing processing times
- Single-machine total completion time scheduling with a time-dependent deterioration
- Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan
- A note on parallel-machine scheduling with deteriorating jobs
- An approximation algorithm for parallel machine scheduling with simple linear deterioration
- Multi-Machine Scheduling With Linear Deterioration
- Parallel Processing and Applied Mathematics
- Scheduling of deteriorating jobs with release dates to minimize the maximum lateness
- Two new approximation schemes for maximizing the weighted number of just-in-time jobs in a multi-machine proportionate flow shop
- Parallel machines scheduling to minimize job tardiness and machine deteriorating cost with deteriorating jobs
This page was built for publication: Parallel-machine scheduling of simple linear deteriorating jobs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q837167)
