A concise survey of scheduling with time-dependent processing times
From MaRDI portal
Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Abstract computational complexity for mathematical programming problems (90C60)
Recommendations
- Scheduling with time dependent processing times: Review and extensions
- A survey of scheduling with controllable processing times
- Single-machine scheduling with time window-dependent processing times
- scientific article; zbMATH DE number 5031195
- A review of four decades of time-dependent scheduling: main results, new topics, and open problems
Cites work
- A fully polynomial approximation scheme for minimizing makespan of deteriorating jobs
- A note on scheduling on a single processor with speed dependent on a number of executed jobs
- A note on single-processor scheduling with time-dependent execution times
- A variant of the permutation flow shop model with variable processing times
- Complexity analysis of job-shop scheduling with deteriorating jobs
- Complexity of scheduling tasks with time-dependent execution times
- Hierarchical Control Of The Two Processor Flow-Shop With State Dependent Processing Times: Complexity Analysis And Approximate Algorithms
- scientific article; zbMATH DE number 5345853 (Why is no real title available?)
- scientific article; zbMATH DE number 3906216 (Why is no real title available?)
- scientific article; zbMATH DE number 44978 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 724323 (Why is no real title available?)
- scientific article; zbMATH DE number 2086777 (Why is no real title available?)
- Makespan minimization in single-machine scheduling with step-deterioration of processing times
- Minimizing maximum lateness under linear deterioration
- Minimizing the makespan with late start penalties added to processing times in a single facility scheduling problem
- Minimizing the total weighted completion time of deteriorating jobs
- Multi-Machine Scheduling With Linear Deterioration
- NP-hard cases in scheduling deteriorating jobs on dedicated machines
- On a scheduling problem of time deteriorating jobs
- On general routing problems
- Optimal control of a class of DEDS: Flow-shops with state-dependent processing times
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Parallel machine scheduling with time dependent processing times
- Scheduling Deteriorating Jobs on a Single Processor
- Scheduling deteriorating jobs to minimize makespan
- Scheduling jobs under simple linear deterioration
- Scheduling jobs with piecewise linear decreasing processing times
- Scheduling jobs with varying processing times
- Scheduling of a Two-machine Flowshop with Processing Time Linearly Dependent on Job Waiting-time
- Scheduling problems with a learning effect
- Scheduling start time dependent jobs to minimize the total weighted completion time
- Scheduling start time dependent tasks with deadlines and identical initial processing times on a single machine
- Scheduling with time dependent processing times: Review and extensions
- Scheduling with time-dependent execution times
- Single machine scheduling subject to deadlines and resource dependent processing times
- Single machine scheduling with deadlines and increasing rates of processing times
- Single machine scheduling with learning effect considerations
- Single machine scheduling with nonlinear cost functions
- Single machine scheduling with start time dependent processing times: Some solvable cases
- Single machine scheduling with step-deteriorating processing times
- Single-machine scheduling with learning considerations
- The complexity of scheduling starting time dependent tasks with release times
- The complexity of single machine scheduling with two distinct deadlines and identical decreasing rates of processing times
- The NP-completeness column: An ongoing guide
- The time dependent machine makespan problem is strongly NP-complete
- The two-machine permutation flow shop with state-dependent processing times
- V-Shaped Policies for Scheduling Deteriorating Jobs
- Λ-Shaped Policies to Schedule Deteriorating Jobs
Cited in
(only showing first 100 items - show all)- Minimizing the total completion time in permutation flow shop with machine-dependent job deterioration rates
- Single machine parallel-batch scheduling with deteriorating jobs
- Parallel machine earliness/tardiness scheduling problem under the effects of position based learning and linear/nonlinear deterioration
- A dynamic programming algorithm for the single-machine scheduling problem with release dates and deteriorating processing times
- Single machine scheduling and due date assignment with positionally dependent processing times
- A note on the optimal sequence position for a rate-modifying activity under simple linear deterioration
- Batch scheduling of simple linear deteriorating jobs on a single machine to minimize makespan
- Conjugate problems in time-dependent scheduling
- Scheduling jobs under decreasing linear deterioration
- Equivalent time-dependent scheduling problems
- Minimizing the makespan in a single machine scheduling problem with a time-based learning effect
- A FPTAS for minimizing total completion time in a single machine time-dependent scheduling problem
- Total tardiness minimization in permutation flowshop with deterioration consideration
- Scheduling deteriorating jobs with a learning effect on unrelated parallel machines
- Matheuristic approaches for parallel machine scheduling problem with time-dependent deterioration and multiple rate-modifying activities
- A branch-and-price algorithm for scheduling of deteriorating jobs and flexible periodic maintenance on a single machine
- Single machine group scheduling with position dependent processing times and ready times
- A decomposition-based two-stage optimization algorithm for single machine scheduling problems with deteriorating jobs
- Lot-order assignment applying priority rules for the single-machine total tardiness scheduling with nonnegative time-dependent processing times
- Sum-of-processing-times-based two-agent single-machine scheduling with aging effects and tardiness
- Parallel-machine scheduling with time-dependent and machine availability constraints
- Scheduling problems with past-sequence-dependent setup times and general effects of deterioration and learning
- Single-machine scheduling problems with an actual time-dependent deterioration
- The study of group scheduling problems with general dual-position-based job processing times
- Competitive two-agent scheduling with deteriorating jobs on a single parallel-batching machine
- Scheduling with time-dependent discrepancy times
- Identical parallel machine scheduling with time-dependent processing times
- Scheduling simple linear deteriorating jobs with rejection
- Parallel-batch scheduling with two models of deterioration to minimize the makespan
- Automated sortation conveyors: a survey from an operational research perspective
- Research on scheduling problems with general effects of deterioration and learning
- Some single-machine scheduling problems with elapsed-time-based and position-based learning and forgetting effects
- A survey of scheduling problems with no-wait in process
- Single-machine group scheduling with time-dependent learning effect and position-based setup time learning effect
- Scheduling problems with position dependent job processing times: computational complexity results
- Single-machine makespan minimization scheduling with nonlinear shortening processing times
- Single machine scheduling with precedence constraints and positionally dependent processing times
- A note to due-window assignment and single machine scheduling with deteriorating jobs and a rate-modifying activity
- Valid inequalities for a time-indexed formulation
- Some single-machine scheduling with sum-of-processing-time-based and job-position-based processing times
- Single machine SLK/DIF due window assignment problem with learning effect and deteriorating jobs
- Parallel-machine scheduling with past-sequence-dependent delivery times and learning effect
- Minimizing the total completion time in single-machine scheduling with step-deteriorating jobs
- A note on single-processor scheduling with time-dependent execution times
- Single-machine scheduling with logarithm deterioration
- Simple matching vs linear assignment in scheduling models with positional effects: a critical review
- Two-machine flow shop total tardiness scheduling problem with deteriorating jobs
- Single-machine group scheduling problems with deterioration to minimize the sum of completion times
- Variable neighborhood search for parallel machines scheduling problem with step deteriorating jobs
- Scheduling in a multi-processor environment with deteriorating job processing times and decreasing values: the case of forest fires
- Single machine resource allocation scheduling problems with deterioration effect and general positional effect
- Two-agent single-machine scheduling with cumulative deterioration
- Machine scheduling problems with a position-dependent deterioration
- Minmax scheduling and due-window assignment with position-dependent processing times and job rejection
- Coupled task scheduling with time-dependent processing times
- Mirror scheduling problems with early work and late work criteria
- Single-machine scheduling problems with general truncated sum-of-actual-processing-time-based learning effect
- Online scheduling on a single machine with linear deteriorating processing times and delivery times
- A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems
- Minimizing total load on parallel machines with linear deterioration
- Parallel-batching scheduling of deteriorating jobs with non-identical sizes and rejection on a single machine
- Parallel-batch scheduling with deterioration and rejection on a single machine
- New results for an open time-dependent scheduling problem
- Scheduling jobs with a V-shaped time-dependent processing time
- Robust parallel-batching scheduling with fuzzy deteriorating processing time and variable delivery time in smart manufacturing
- Scheduling piecewise linear deteriorating jobs to minimize makespan in a two-machine flowshop
- Solution methods for scheduling problems with sequence-dependent deterioration and maintenance events
- Fast algorithms for scheduling with learning effects and time-dependent processing times on a single machine
- Parallel machines scheduling with deteriorating jobs and availability constraints
- Single-machine scheduling with both deterioration and learning effects
- Flow shop scheduling problem with position-dependent processing times
- A closed-form solution for the optimal release times for the \(F2|\) deteriorating jobs \(|\sum w_{j}c_{j}\) problem
- Scheduling jobs with position and sum-of-processing-time based processing times
- ND-agent scheduling of linear-deteriorating tasks with positional due indices to minimize total completion time and maximum cost
- A unified view of parallel machine scheduling with interdependent processing rates
- Single-machine scheduling problems with machine aging effect and an optional maintenance activity
- Single machine scheduling with stochastically dependent times
- A review of four decades of time-dependent scheduling: main results, new topics, and open problems
- A branch and bound algorithm for agile earth observation satellite scheduling
- Parallel-machine scheduling with job-dependent cumulative deterioration effect and rejection
- Deteriorating jobs scheduling on a single machine with release dates, rejection and a fixed non-availability interval
- An optimal single-machine scheduling with linear deterioration rate and rate-modifying activities
- Approximation schemes for scheduling a maintenance and linear deteriorating jobs
- Flow shop scheduling problems with deteriorating jobs on no-idle dominant machines
- Complexity and approximability of scheduling resumable proportionally deteriorating jobs
- A note on flow shop scheduling problems with deteriorating jobs on no-idle dominant machines
- The learning effect: getting to the core of the problem
- A survey of scheduling with controllable processing times
- Integrated rescheduling and preventive maintenance for arrival of new jobs through evolutionary multi-objective optimization
- Two-agent scheduling of time-dependent jobs
- Single-machine scheduling with time-and-resource-dependent processing times
- A mathematical programming-based scheduling framework for multitasking environments
- Analysis of a time-dependent scheduling problem by signatures of deterioration rate sequences
- Scheduling with due date assignment under special conditions on job processing
- Scheduling flexible maintenance activities subject to job-dependent machine deterioration
- Stochastic scheduling problems with general position-based learning effects and stochastic breakdowns
- A general variable neighborhood search for single-machine total tardiness scheduling problem with step-deteriorating jobs
- Single-machine scheduling with past-sequence-dependent setup times and general effects of deterioration and learning
- Unrelated parallel-machine scheduling with position-dependent deteriorating jobs and resource-dependent processing time
- Single-machine scheduling with accelerating deterioration effects
This page was built for publication: A concise survey of scheduling with time-dependent processing times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1410319)
