Single machine scheduling models with deterioration and learning: Handling precedence constraints via priority generation
From MaRDI portal
Publication:835616
DOI10.1007/s10951-008-0064-xzbMath1168.90441OpenAlexW2070245112MaRDI QIDQ835616
J. D. Whitehead, Vitaly A. Strusevich, Valery S. Gordon, Chris N. Potts
Publication date: 28 August 2009
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-008-0064-x
deteriorating jobssingle machine schedulingprecedence constraintslearning effectpriority-generating functions
Related Items
A survey on how the structure of precedence constraints may change the complexity class of scheduling problems, 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, 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, `Strong'-`weak' precedence in scheduling: extensions to series-parallel orders, Simple matching vs linear assignment in scheduling models with positional effects: a critical review, Scheduling problems with partially ordered jobs, The symmetric quadratic knapsack problem: approximation and scheduling applications, Single-machine Scheduling Problems with Aging/Deteriorating Effect under an Optional Maintenance Activity Consideration, Scheduling jobs with an exponential sum-of-actual-processing-time-based learning effect, The strong NP-hardness of the maximum lateness minimization scheduling problem with the processing-time based aging effect, Single machine scheduling with a generalized job-dependent cumulative effect, 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, Single-machine due-window assignment problem with learning effect and deteriorating jobs, Maximum cost scheduling of jobs with mixed variable processing times and \(k\)-partite precedence constraints, 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, Single-machine group scheduling with deteriorating jobs 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, SCHEDULING JOBS WITH PROCESSING TIMES DEPENDENT ON POSITION, STARTING TIME, AND ALLOTTED RESOURCE, Fast algorithms for scheduling with learning effects and time-dependent processing times on a single machine, Single machine scheduling with precedence constraints and positionally dependent processing times, Single machine scheduling with general job-dependent aging effect and maintenance activities to minimize makespan, Scheduling linearly shortening jobs under precedence constraints, 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 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, An optimal online algorithm for single-processor scheduling problem with learning effect, An Optimal Online Algorithm for Scheduling with Learning Consideration
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Scheduling jobs with varying processing times
- A note on scheduling deteriorating jobs
- A linear programming method for generating the most favorable weights from a pairwise comparison matrix
- Minimizing the makespan in a single machine scheduling problem with a time-based learning effect
- Single-machine scheduling with learning considerations
- 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
- Local search heuristics for single machine scheduling with batch set-up times to minimize total weighted completion time
- A concise survey of scheduling with time-dependent processing times
- Minimizing the total weighted completion time of deteriorating jobs
- A state-of-the-art review on scheduling with learning effects
- Scheduling in a contaminated area: a model and polynomial algorithms
- Single machine scheduling and due date assignment under series-parallel precedence constraints
- Minimizing the total completion time in a single-machine scheduling problem with a time-dependent learning effect
- The single-machine scheduling problems with deteriorating jobs and learning effect
- Scheduling with time dependent processing times: Review and extensions
- Scheduling Deteriorating Jobs on a Single Processor
- Optimal Sequencing by Modular Decomposition: Polynomial Algorithms
- Optimal Sequencing Via Modular Decomposition: Characterization of Sequencing Functions
- Method for optimzing functionals of permutations in the presence of constraints
- The Recognition of Series Parallel Digraphs
- Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints
- Minimization of Time-Varying Costs in Single-Machine Scheduling
- Scheduling start time dependent jobs to minimize the total weighted completion time
- Λ-Shaped Policies to Schedule Deteriorating Jobs
- Scheduling problems with a learning effect
