Abstract
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.
| Original language | English |
|---|---|
| Pages (from-to) | 743-747 |
| Number of pages | 5 |
| Journal | Information Processing Letters |
| Volume | 112 |
| Issue number | 19 |
| DOIs | |
| State | Published - 15 Oct 2012 |
Bibliographical note
Funding Information:The second author is the Charles Rosen Chair of Management, The School of Business Administration, The Hebrew University. This paper was supported in part by the Recanati Fund of The School of Business Administration, The Hebrew University, Jerusalem, Israel.
Keywords
- Flow-time
- Job-rejection
- Parallel machines
- Position-dependent processing times
- Scheduling