The single processor total weighted completion time scheduling problem with the sum-of-processing-time based learning model

DOI10.1016/j.ins.2012.02.043zbMath1248.90052MaRDI QIDQ712692

Radosław Rudek

Publication date: 17 October 2012

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2012.02.043

zbMATH Keywords

computational complexity; scheduling; dynamic programming; learning; metaheuristic

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68T05: Learning and adaptive systems in artificial intelligence

90B35: Deterministic scheduling theory in operations research

90C39: Dynamic programming

68M20: Performance evaluation, queueing, and scheduling in the context of computer systems

Related Items

A Note on Scheduling Jobs with Extended Sum-of-Processing-Times-Based and Position-Based Learning Effect, 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 learning and forgetting effects, Complexity and approximation of single machine scheduling with an operator non-availability period to minimize total completion time, Four single-machine scheduling problems involving due date determination decisions, Single machine group scheduling with time dependent processing times and ready times, Single-machine scheduling CON/SLK due window assignment problems with sum-of-processed times based learning effect, Scheduling with job-splitting considering learning and the vital-few law, Minimizing the makespan for a two-stage three-machine assembly flow shop problem with the sum-of-processing-time based learning effect, Some single-machine scheduling with sum-of-processing-time-based and job-position-based processing times, The single machine total weighted completion time scheduling problem with the sum-of-processing time based models: strongly NP-hard, A note on single-machine scheduling with sum-of-processing-time-based learning and forgetting effects, Parallel-machine scheduling to minimize makespan with fuzzy processing times and learning effects

Uses Software

• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• Single machine scheduling with exponential sum-of-logarithm-processing-times based learning effect
• Scheduling problems with general effects of deterioration and learning
• Single-machine scheduling with sum-of-logarithm-processing-times-based learning considerations
• Some single-machine and \(m\)-machine flowshop scheduling problems with learning considerations
• Single-machine and two-machine flowshop scheduling with general learning functions
• Single-machine scheduling with learning functions
• Note on ``Single-machine and flowshop scheduling with a general learning effect model and ``Some single-machine and m-machine flowshop scheduling problems with learning considerations
• Single-machine scheduling problems with a learning effect
• Some scheduling problems with sum-of-processing-times-based and job-position-based learning effects
• Minimizing the makespan in a single machine scheduling problem with a time-based learning effect
• Single-machine scheduling with learning considerations
• Some scheduling problems with general position-dependent and time-dependent learning effects
• A state-of-the-art review on scheduling with learning effects
• Single-machine group scheduling with a time-dependent learning effect
• Minimizing the total completion time in a single-machine scheduling problem with a time-dependent learning effect
• Single-machine scheduling problems with the time-dependent learning effect
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Scheduling jobs under an aging effect
• Single machine scheduling with learning effect considerations