Exact and parallel metaheuristic algorithms for the single processor total weighted completion time scheduling problem with the sum-of-processing-time based models

DOI10.1016/j.cor.2014.01.008zbMath1348.68024OpenAlexW2033957164MaRDI QIDQ336999

Radosław Rudek

Publication date: 10 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2014.01.008

zbMATH Keywords

schedulingdynamic programminglearningparallel algorithmdeterioratingaging

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Dynamic programming (90C39) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (4)

Scheduling with job-splitting considering learning and the vital-few law ⋮ Parallel computational optimization in operations research: a new integrative framework, literature review and research directions ⋮ Some single-machine scheduling problems with elapsed-time-based and position-based learning and forgetting effects ⋮ The single machine total weighted completion time scheduling problem with the sum-of-processing time based models: strongly NP-hard

Cites Work

• Unnamed Item
• Scheduling jobs with a general learning effect model
• The strong NP-hardness of the maximum lateness minimization scheduling problem with the processing-time based aging effect
• Genetic algorithm for minimizing the total weighted completion time scheduling problem with learning and release times
• Scheduling problems with general effects of deterioration and learning
• Single-machine scheduling with a nonlinear deterioration function
• A note on optimization in deteriorating systems using scheduling problems with the aging effect and resource allocation models
• The single processor total weighted completion time scheduling problem with the sum-of-processing-time based learning model
• Single-machine scheduling with sum-of-logarithm-processing-times-based learning considerations
• Single machine scheduling models with deterioration and learning: Handling precedence constraints via priority generation
• Single-machine scheduling with learning functions
• Single-machine scheduling problems with a learning effect
• Some scheduling problems with sum-of-processing-times-based and job-position-based learning effects
• Single-machine scheduling with learning considerations
• The single-machine total weighted tardiness scheduling problem with position-based learning effects
• Solving a two-agent single-machine scheduling problem considering learning effect
• Single-machine due-window assignment and scheduling with job-dependent aging effects and deteriorating maintenance
• A state-of-the-art review on scheduling with learning effects
• Single-machine group scheduling with a time-dependent learning effect
• Single-machine scheduling problems with the time-dependent learning effect
• Self-Improving Algorithms
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Single machine scheduling with learning effect considerations

This page was built for publication: Exact and parallel metaheuristic algorithms for the single processor total weighted completion time scheduling problem with the sum-of-processing-time based models