Single facility scheduling with nonlinear processing times
Computers and Industrial Engineering
Scheduling deteriorating jobs on a single processor
Operations Research
Scheduling jobs under simple linear deterioration
Computers and Operations Research
Parallel machine scheduling with time dependent processing times
Discrete Applied Mathematics
Multiprocessor scheduling with rejection
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Preemptive multiprocessor scheduling with rejection
Theoretical Computer Science
A Fully Polynomial Approximation Scheme for Minimizing Makespan of Deteriorating Jobs
Journal of Heuristics
Approximation Schemes for Minimizing Average Weighted Completion Time with Release Dates
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Parallel-machine scheduling with time dependent processing times
Theoretical Computer Science
Time-Dependent Scheduling
Scheduling: Theory, Algorithms, and Systems
Scheduling: Theory, Algorithms, and Systems
On-line scheduling of unit time jobs with rejection: minimizing the total completion time
Operations Research Letters
Scheduling on parallel identical machines with job-rejection and position-dependent processing times
Information Processing Letters
A survey on offline scheduling with rejection
Journal of Scheduling
| Hi-index | 5.23 |
We consider several parallel-machine scheduling problems in which the processing time of a job is a (simple) linear increasing function of its starting time and jobs can be rejected by paying penalties. The objective is to minimize the scheduling cost of the accepted jobs plus the total penalty of the rejected jobs. Three variations of the scheduling cost are considered in this paper. The first is the makespan, the second is the total weighted completion time (for simple linear deterioration), and the third is the total completion time. For the former two problems, we propose two fully polynomial-time approximation schemes to solve them when the number of machines is fixed. For the last problem, we present an optimal O(n^2)-time dynamic programming algorithm when the deteriorating rates are equal for all jobs.