In this note we consider some single-machine scheduling problems with decreasing time-dependent job processing times. Decreasing time-dependent job processing times means that its processing time is a non-increasing function of its execution start time. We present polynomial solutions for the sum of squared completion times minimization problem, and the sum of earliness penalties minimization problem subject to no tardy jobs, respectively. We also study two resource constrained scheduling problems under the same decreasing time-dependent job processing times model and present algorithms to find their optimal solutions. © 2009 Elsevier Inc. All rights reserved.
Wang, J. B. (2010). A note on single-machine scheduling with decreasing time-dependent job processing times. Applied Mathematical Modelling, 34(2), 294–300. https://doi.org/10.1016/j.apm.2009.04.018