Scheduling on parallel identical machines with job-rejection and position-dependent processing times

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.

[1]  Leen Stougie,et al.  Multiprocessor scheduling with rejection , 1996, SODA '96.

[2]  David R. Karger,et al.  Techniques for scheduling with rejection , 2003, J. Algorithms.

[3]  Sudipta Sengupta,et al.  Algorithms and Approximation Schemes for Minimum Lateness/Tardiness Scheduling with Rejection , 2003, WADS.

[4]  Gur Mosheiov,et al.  A note: Multi-machine scheduling with general position-based deterioration to minimize total load , 2012 .

[5]  Han Hoogeveen,et al.  Preemptive scheduling with rejection , 2000, Math. Program..

[6]  Jinjiang Yuan,et al.  Parallel-machine scheduling with deteriorating jobs and rejection , 2010, Theor. Comput. Sci..

[7]  Dirk Biskup,et al.  Single-machine scheduling with learning considerations , 1999, Eur. J. Oper. Res..

[8]  T. C. Edwin Cheng,et al.  Scheduling with job-dependent learning effects and multiple rate-modifying activities , 2010, Inf. Process. Lett..

[9]  Zhigang Cao,et al.  A PTAS for parallel batch scheduling with rejection and dynamic job arrivals , 2009, Theor. Comput. Sci..

[10]  Dvir Shabtay,et al.  Two-machine flow-shop scheduling with rejection , 2012, Comput. Oper. Res..

[11]  Gerhard J. Woeginger,et al.  On-line scheduling of unit time jobs with rejection: minimizing the total completion time , 2002, Oper. Res. Lett..

[12]  Shijie Sun,et al.  Scheduling linear deteriorating jobs with rejection on a single machine , 2009, Eur. J. Oper. Res..

[13]  Gur Mosheiov,et al.  Scheduling and due-date assignment problems with job rejection , 2009 .

[14]  Dvir Shabtay,et al.  A bicriteria approach to scheduling a single machine with job rejection and positional penalties , 2012, J. Comb. Optim..

[15]  C. T. Ng,et al.  The unbounded parallel-batch scheduling with rejection , 2012, J. Oper. Res. Soc..

[16]  Gur Mosheiov,et al.  Parallel machine scheduling with a learning effect , 2001, J. Oper. Res. Soc..

[17]  Sid Browne,et al.  Scheduling Deteriorating Jobs on a Single Processor , 1990, Oper. Res..