Single-machine scheduling with a sum-of-actual-processing-time-based learning effect
From MaRDI portal
Publication:3582646
DOI10.1057/jors.2008.146zbMath1193.90115OpenAlexW2111639937MaRDI QIDQ3582646
No author found.
Publication date: 2 September 2010
Published in: Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/jors.2008.146
Learning and adaptive systems in artificial intelligence (68T05) Deterministic scheduling theory in operations research (90B35)
Related Items (13)
Scheduling jobs with general truncated learning effects including proportional setup times ⋮ A note on ``Single-machine scheduling problems with both deteriorating jobs and learning effects ⋮ Parallel-machine scheduling of jobs with mixed job-, machine- and position-dependent processing times ⋮ Single machine past-sequence-dependent delivery times scheduling with general position-dependent and time-dependent learning effects ⋮ Heuristic and exact algorithms for single-machine scheduling problems with general truncated learning effects ⋮ Genetic algorithm for minimizing the total weighted completion time scheduling problem with learning and release times ⋮ Solution algorithms for single-machine scheduling with learning effects and exponential past-sequence-dependent delivery times ⋮ Scheduling jobs with an exponential sum-of-actual-processing-time-based learning effect ⋮ Research on delivery times scheduling with truncated learning effects ⋮ Single machine scheduling with sum-of-logarithm-processing-times based and position based learning effects ⋮ Single machine scheduling with exponential learning functions ⋮ Genetic Algorithm for a Two-Agent Scheduling Problem with Truncated Learning Consideration ⋮ Two-agent scheduling with position-based deteriorating jobs and learning effects
This page was built for publication: Single-machine scheduling with a sum-of-actual-processing-time-based learning effect
