Scheduling problems with a weight-modifying-activity

Gur Mosheiov, Daniel Oron*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

2 Scopus citations


We study single machine scheduling problems with an additional option of performing a weight-modifying-activity. If such an activity is performed, the cost of subsequent jobs is reduced, as reflected by smaller job-weights. We focus first on minimizing total weighted completion time. A pseudo-polynomial dynamic programming algorithm is introduced for this problem. Several special cases of unit processing time jobs are solved in polynomial time. We also solve in polynomial time (an extension of) the minmax version of the problem, by adapting the well-known Lawler’s Algorithm for minimizing maximum cost on a single machine.

Original languageAmerican English
Pages (from-to)737-745
Number of pages9
JournalAnnals of Operations Research
Issue number2
StatePublished - Dec 2020

Bibliographical note

Publisher Copyright:
© 2020, Crown.


  • Dynamic programming
  • Scheduling
  • Single machine
  • Total weighted completion time
  • Weight-modifying-activity


Dive into the research topics of 'Scheduling problems with a weight-modifying-activity'. Together they form a unique fingerprint.

Cite this