Minimizing the total completion time in a single-machine scheduling problem with a learning effect

DOI10.1016/j.apm.2010.11.006zbMath1217.90109OpenAlexW2014203678MaRDI QIDQ552439

Chinyao Low, Wen Yi Lin

Publication date: 21 July 2011

Published in: Applied Mathematical Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apm.2010.11.006

zbMATH Keywords

single-machinetotal completion timetime-dependentlearning effectSPT rule

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

Single-machine scheduling with learning and forgetting effects, Scheduling problems with past-sequence-dependent setup times and general effects of deterioration and learning, Bicriterion scheduling with truncated learning effects and convex controllable processing times, Logic-based Benders decomposition method for the \textit{seru} scheduling problem with sequence-dependent setup time and DeJong's learning effect, A note on single-machine scheduling with sum-of-processing-time-based learning and forgetting effects

Cites Work

• Single machine scheduling with past-sequence-dependent setup times and learning effects
• Single-machine and two-machine flowshop scheduling with general learning functions
• Single-machine scheduling against due dates with past-sequence-dependent setup times
• Single-machine scheduling problems with a learning effect
• Minimizing the makespan in a single machine scheduling problem with a time-based learning effect
• Single-machine scheduling with learning considerations
• Scheduling with general job-dependent learning curves.
• Single-machine scheduling with general learning functions
• Single-machine scheduling problems with past-sequence-dependent setup times
• Single-machine group scheduling with a time-dependent learning effect
• Minimizing the total completion time in a single-machine scheduling problem with a time-dependent learning effect
• Scheduling problems with a learning effect