Complexity results for single-machine scheduling with positional learning effects

DOI10.1057/palgrave.jors.2602227zbMath1278.90164OpenAlexW2105032709MaRDI QIDQ5447775

Bertrand M. T. Lin

Publication date: 20 March 2008

Published in: Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1057/palgrave.jors.2602227

zbMATH Keywords

single-machine schedulinglearning effectlate job\(\mathcal{N}\mathcal{P}\)-hardness

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (20)

Some single-machine and \(m\)-machine flowshop scheduling problems with learning considerations ⋮ A note on resource allocation scheduling with position-dependent workloads ⋮ Some scheduling problems with general position-dependent and time-dependent learning effects ⋮ On single processor scheduling problems with learning dependent on the number of processed jobs ⋮ Some single-machine scheduling problems with actual time and position dependent learning effects ⋮ Single-machine scheduling problems with a sum-of-processing-time-based learning function ⋮ Single-machine scheduling with a general sum-of-actual-processing-times-based and job-position-based learning effect ⋮ Single-machine Scheduling Problems with Aging/Deteriorating Effect under an Optional Maintenance Activity Consideration ⋮ Proportionate flowshops with general position-dependent processing times ⋮ Some single-machine scheduling problems with general effects of learning and deterioration ⋮ 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 ⋮ Group scheduling with learning effect and random processing time ⋮ A state-of-the-art review on scheduling with learning effects ⋮ Single-machine scheduling with learning effects and maintenance: a methodological note on some polynomial-time solvable cases ⋮ The single-machine total weighted tardiness scheduling problem with position-based learning effects ⋮ Single-machine scheduling with both deterioration and learning effects ⋮ Scheduling with variable time slot costs ⋮ Single-machine scheduling with sum-of-logarithm-processing-times-based learning considerations ⋮ Minimizing total weighted completion time on single machine with past-sequence-dependent setup times and exponential time-dependent and position-dependent learning effects

This page was built for publication: Complexity results for single-machine scheduling with positional learning effects