Title | ||
---|---|---|
Single-machine due-window assignment and scheduling with resource allocation, aging effect, and a deteriorating rate-modifying activity. |
Abstract | ||
---|---|---|
We consider single-machine scheduling with a common due-window and a deteriorating rate-modifying activity. We assume that the processing time of a job is a function of the amount of a resource allocated to it, its position in the processing sequence, and its aging effect. The objective is to minimize the total cost, which is a function of earliness, tardiness, due-window starting time, due-window size, and resource consumption. We consider two models of the job processing time function and provide polynomial-time solution algorithms for the corresponding problems. We also give a more efficient solution algorithm for a special case of the second problem. |
Year | DOI | Venue |
---|---|---|
2013 | 10.1016/j.cie.2013.08.020 | Computers & Industrial Engineering |
Keywords | Field | DocType |
rate-modifying activity,polynomial-time solution algorithm,single-machine due-window assignment,resource consumption,processing sequence,due-window size,resource allocation,job processing time function,common due-window,processing time,corresponding problem,efficient solution algorithm,scheduling | Single-machine scheduling,Mathematical optimization,Tardiness,Scheduling (computing),Computer science,Regular polygon,Resource allocation,Time complexity,Total cost,Operations management,Special case | Journal |
Volume | Issue | ISSN |
66 | 4 | 0360-8352 |
Citations | PageRank | References |
3 | 0.40 | 30 |
Authors | ||
4 |
Name | Order | Citations | PageRank |
---|---|---|---|
Min Ji | 1 | 365 | 25.25 |
Jiaojiao Ge | 2 | 11 | 1.24 |
Ke Chen | 3 | 3 | 0.40 |
T. C. E. Cheng | 4 | 378 | 49.65 |