Single machine scheduling models with deterioration and learning: Handling precedence constraints via priority generation
From MaRDI portal
(Redirected from Publication:835616)
Recommendations
- Single machine scheduling with precedence constraints and positionally dependent processing times
- Single-machine scheduling problems with precedence constraints and simple linear deterioration
- Single machine scheduling with decreasing linear deterioration under precedence constraints
- Single-machine scheduling with precedence constraints and position-dependent processing times
- SCHEDULING PROBLEMS WITH THE EFFECTS OF DETERIORATION AND LEARNING
Cites work
- A concise survey of scheduling with time-dependent processing times
- A linear programming method for generating the most favorable weights from a pairwise comparison matrix
- A note on scheduling deteriorating jobs
- A state-of-the-art review on scheduling with learning effects
- Branch and bound algorithms for single-machine scheduling with batch set-up times to minimize total weighted completion time
- Complexity of scheduling tasks with time-dependent execution times
- scientific article; zbMATH DE number 3612753 (Why is no real title available?)
- scientific article; zbMATH DE number 724323 (Why is no real title available?)
- scientific article; zbMATH DE number 3894817 (Why is no real title available?)
- Local search heuristics for single machine scheduling with batch set-up times to minimize total weighted completion time
- Method for optimzing functionals of permutations in the presence of constraints
- Minimization of Time-Varying Costs in Single-Machine Scheduling
- Minimizing the makespan in a single machine scheduling problem with a time-based learning effect
- Minimizing the total completion time in a single-machine scheduling problem with a time-dependent learning effect
- Minimizing the total weighted completion time of deteriorating jobs
- Optimal Sequencing by Modular Decomposition: Polynomial Algorithms
- Optimal Sequencing Via Modular Decomposition: Characterization of Sequencing Functions
- Scheduling Deteriorating Jobs on a Single Processor
- Scheduling in a contaminated area: a model and polynomial algorithms
- Scheduling jobs with varying processing times
- Scheduling problems with a learning effect
- Scheduling start time dependent jobs to minimize the total weighted completion time
- Scheduling with time dependent processing times: Review and extensions
- Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints
- Single machine scheduling and due date assignment under series-parallel precedence constraints
- Single-machine scheduling with learning considerations
- The Recognition of Series Parallel Digraphs
- The single-machine scheduling problems with deteriorating jobs and learning effect
- Λ-Shaped Policies to Schedule Deteriorating Jobs
Cited in
(40)- 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
- A survey on how the structure of precedence constraints may change the complexity class of scheduling problems
- Single machine scheduling with a generalized job-dependent cumulative effect
- Single machine scheduling with precedence constraints and positionally dependent processing times
- Simple matching vs linear assignment in scheduling models with positional effects: a critical review
- The symmetric quadratic knapsack problem: approximation and scheduling applications
- An optimal online algorithm for single-processor scheduling problem with learning effect
- Refined conditions for V-shaped optimal sequencing on a single machine to minimize total completion time under combined effects
- Scheduling jobs with a V-shaped time-dependent processing time
- Fast algorithms for scheduling with learning effects and time-dependent processing times on a single machine
- The single machine total weighted completion time scheduling problem with the sum-of-processing time based models: strongly NP-hard
- A review of four decades of time-dependent scheduling: main results, new topics, and open problems
- Single-machine time-dependent scheduling problems with fixed rate-modifying activities and resumable jobs
- Integrated rescheduling and preventive maintenance for arrival of new jobs through evolutionary multi-objective optimization
- Vyacheslav Tanaev: contributions to scheduling and related areas
- Scheduling with due date assignment under special conditions on job processing
- Approximation schemes for scheduling on a single machine subject to cumulative deterioration and maintenance
- Maximum cost scheduling of jobs with mixed variable processing times and \(k\)-partite precedence constraints
- Single-machine group scheduling with deteriorating jobs and allotted resource
- Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications
- Parallel-machine scheduling with maintenance: praising the assignment problem
- Exact and parallel metaheuristic algorithms for the single processor total weighted completion time scheduling problem with the sum-of-processing-time based models
- Single-machine scheduling with precedence constraints and position-dependent processing times
- The strong NP-hardness of the maximum lateness minimization scheduling problem with the processing-time based aging effect
- SCHEDULING JOBS WITH PROCESSING TIMES DEPENDENT ON POSITION, STARTING TIME, AND ALLOTTED RESOURCE
- Scheduling with learning effects and/or time-dependent processing times to minimize the weighted number of tardy jobs on a single machine
- An optimal online algorithm for scheduling with learning consideration
- Scheduling linearly shortening jobs under precedence constraints
- `Strong'-`weak' precedence in scheduling: extensions to series-parallel orders
- Single-machine Scheduling Problems with Aging/Deteriorating Effect under an Optional Maintenance Activity Consideration
- Scheduling problems with partially ordered jobs
- Scheduling jobs with an exponential sum-of-actual-processing-time-based learning effect
- Single-machine due-window assignment problem with learning effect and deteriorating jobs
- Sequencing situations with position-dependent effects under cooperation
- Theory and methodology of time-dependent scheduling: past, present and future
- Scheduling maintenance activities subject to stochastic job-dependent machine deterioration
- State-dependent machine availability in scheduling
- Scheduling maintenance activities subject to continuous stochastic job-dependent machine deterioration
- Single machine scheduling with general job-dependent aging effect and maintenance activities to minimize makespan
This page was built for publication: Single machine scheduling models with deterioration and learning: Handling precedence constraints via priority generation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q835616)
