The learning effect: getting to the core of the problem

DOI10.1016/j.ipl.2007.03.013zbMath1184.68405OpenAlexW2088713290MaRDI QIDQ2379968

Adam Janiak, Radosław Rudek

Publication date: 24 March 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2007.03.013

zbMATH Keywords

computational complexityschedulinglearning effect

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (11)

Minimization of the total weighted tardiness on a single machine scheduling problem with a position based learning effect and unequal release dates ⋮ Genetic algorithm for minimizing the total weighted completion time scheduling problem with learning and release times ⋮ Single-machine Scheduling Problems with Aging/Deteriorating Effect under an Optional Maintenance Activity Consideration ⋮ Proportionate flowshops with general position-dependent processing times ⋮ Worst-case and numerical analysis of heuristic algorithms for flowshop scheduling problems with a time-dependent learning effect ⋮ A note on machine scheduling with sum-of-logarithm-processing-time-based and position-based learning effects ⋮ Scheduling with job-dependent learning effects and multiple rate-modifying activities ⋮ Single-machine scheduling with both deterioration and learning effects ⋮ Bi-criteria single machine scheduling problem with a learning effect: Aneja-Nair method to obtain the set of optimal sequences ⋮ Scheduling with variable time slot costs ⋮ Single-machine scheduling with sum-of-logarithm-processing-times-based learning considerations

Cites Work

• Minimizing the makespan in a single machine scheduling problem with a time-based learning effect
• Single-machine scheduling with learning considerations
• A concise survey of scheduling with time-dependent processing times
• Scheduling with general job-dependent learning curves.
• Minimizing Total Tardiness on One Machine is NP-Hard
• Scheduling start time dependent jobs to minimize the total weighted completion time
• Parallel machine scheduling with a learning effect
• Scheduling jobs with position-dependent processing times
• Note on scheduling with general learning curves to minimize the number of tardy jobs
• Single machine scheduling with learning effect considerations
• Scheduling problems with a learning effect

This page was built for publication: The learning effect: getting to the core of the problem