Complexity of scheduling tasks with time-dependent execution times
From MaRDI portal
Cites work
Cited in
(49)- An FPTAS for scheduling jobs with piecewise linear decreasing processing times to minimize makespan
- Parallel-machine scheduling with time dependent processing times
- Online Parallel-Batch Scheduling of Learning Effect Jobs with Incompatible Job Families for Prefabricated Components
- Flow shop scheduling with effects of learning and deterioration
- Flow shop scheduling problems with decreasing linear deterioration under dominant machines
- A dynamic programming algorithm for scheduling problems on earliness award and tardiness penalty with time-dependent processing time
- Scheduling linearly shortening jobs under precedence constraints
- Scheduling two-agents with a time-dependent deterioration to minimize the minsum earliness measures
- Parallel-batching machines scheduling problem with a truncated time-dependent learning effect via a hybrid CS-JADE algorithm
- Single machine group scheduling with decreasing time-dependent processing times subject to release dates
- Single machine group scheduling under decreasing linear deterioration
- Greedy solutions of selection and ordering problems
- Optimal composition ordering problems for piecewise linear functions
- The complexity of scheduling starting time dependent tasks with release times
- Scheduling jobs with a V-shaped time-dependent processing time
- Parallel machine scheduling with time dependent processing times
- Two-agent scheduling of time-dependent jobs
- A note on single-machine scheduling with decreasing time-dependent job processing times
- SCHEDULING PROBLEMS WITH THE EFFECTS OF DETERIORATION AND LEARNING
- Single-machine scheduling with linear decreasing deterioration to minimize earliness penalties
- Scheduling time-dependent jobs under mixed deterioration
- Scheduling in a contaminated area: a model and polynomial algorithms
- A fully polynomial-time approximation scheme for total completion time minimization on a single machine with DeJong's learning effect and an availability constraint
- Conjugate problems in time-dependent scheduling
- The complexity of single machine scheduling with two distinct deadlines and identical decreasing rates of processing times
- Scheduling problems with two agents and a linear non-increasing deterioration to minimize earliness penalties
- Preemptive repayment policy for multiple loans
- Single machine scheduling models with deterioration and learning: Handling precedence constraints via priority generation
- A review of four decades of time-dependent scheduling: main results, new topics, and open problems
- Scheduling start time dependent tasks with deadlines and identical initial processing times on a single machine
- Equivalent time-dependent scheduling problems
- Minimizing total completion time in a two-machine flow shop with deteriorating jobs
- Polynomial time algorithm for minmax scheduling with common due-window and proportional-linear shortening processing times
- Flow shop scheduling problems with deteriorating jobs on no-idle dominant machines
- A note on scheduling on a single processor with speed dependent on a number of executed jobs
- Single machine scheduling problems with deteriorating jobs
- A concise survey of scheduling with time-dependent processing times
- Single-machine scheduling problems with precedence constraints and simple linear deterioration
- Learning effect and deteriorating jobs in the single machine scheduling problems
- Minimizing total weighted completion time in a two-machine flow shop scheduling under simple linear deterioration
- Permutation flow shop problem with shortening job processing times
- Single-machine scheduling problems with time and position dependent processing times
- Scheduling jobs under decreasing linear deterioration
- Single-machine time-dependent scheduling problems with fixed rate-modifying activities and resumable jobs
- Single machine scheduling with decreasing linear deterioration under precedence constraints
- Scheduling with time-dependent execution times
- A note on single-processor scheduling with time-dependent execution times
- Scheduling on a single processor with variable speed
- Scheduling jobs with varying processing times
This page was built for publication: Complexity of scheduling tasks with time-dependent execution times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1334634)
