.png){kind=icon}
.png){kind=icon}
Return
Scheduling problems with a weight-modifying-activity
.png){kind=icon}
PRE
AI
DOI：10.1007/s10479-020-03782-7.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
Scheduling
Single machine
Weight-modifying-activity
Total weighted completion time
Dynamic programming
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.5
Papers:
8.0K
Citations:
2.1W