Complexity results for single-machine scheduling with positional learning effects
From MaRDI portal
Publication:5447775
DOI10.1057/palgrave.jors.2602227zbMath1278.90164MaRDI QIDQ5447775
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
90B35: Deterministic scheduling theory in operations research
Related Items
Scheduling with variable time slot costs, 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, 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, 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, Some single-machine scheduling problems with general effects of learning and deterioration, Single-machine scheduling with sum-of-logarithm-processing-times-based learning considerations, Some single-machine and \(m\)-machine flowshop scheduling problems with 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, The single-machine total weighted tardiness scheduling problem with position-based learning effects, Proportionate flowshops with general position-dependent processing times, Single-machine scheduling with both deterioration and learning effects, Some scheduling problems with general position-dependent and time-dependent learning effects, A state-of-the-art review on scheduling with learning effects
