Scheduling deteriorating jobs on a single processor
Operations Research
Multiprocessor Scheduling with Rejection
SIAM Journal on Discrete Mathematics
A PTAS for parallel batch scheduling with rejection and dynamic job arrivals
Theoretical Computer Science
Scheduling with job-dependent learning effects and multiple rate-modifying activities
Information Processing Letters
Parallel-machine scheduling with deteriorating jobs and rejection
Theoretical Computer Science
Two-machine flow-shop scheduling with rejection
Computers and Operations Research
A bicriteria approach to scheduling a single machine with job rejection and positional penalties
Journal of Combinatorial Optimization
On-line scheduling of unit time jobs with rejection: minimizing the total completion time
Operations Research Letters
Several flow shop scheduling problems with truncated position-based learning effect
Computers and Operations Research
| Hi-index | 0.89 |
We solve scheduling problems which combine the option of job-rejection and general position-dependent processing times. The option of rejection reflects a very common scenario, where the scheduler may decide not to process a job if it is not profitable. The assumption of position-dependent processing time is a common generalization of classical settings, and contains the well-known and extensively studied special cases of ''learning'' and ''aging''. The machine setting is parallel identical machines, and two scheduling measures are considered: total flow-time and total load. When the number of jobs is given, both problems are shown to be solved in polynomial time in the number of jobs. The special case of non-decreasing job-position processing times (''aging'') is shown to be solved much faster.