Single machine scheduling with non-availability interval and optional job rejection |
| |
Authors: | Mor Baruch Shapira Dana |
| |
Affiliation: | 1.Department of Economics and Business Administration, Ariel University, Ariel, Israel ;2.Department of Computer Science, Ariel University, Ariel, Israel ; |
| |
Abstract: | This paper studies the single machine scheduling problem with availability constraints and optional job rejection. We consider the non-resumable and resumable variants, and show that the problems remain ordinary NP-hard, even with the rejection possibility extension, by presenting pseudo-polynomial dynamic-programming (DP) solutions. We also present an enhanced running time implementation of the algorithm of Kellerer and Strusevich (Algorithmica 57(4):769–795, 2010) for the resumable scenario without job rejection. This solution is adapted to efficiently solve the machine non-availability problem with a floating interval and the problem of two competing agents on a single machine, with and without optional job rejection. Numerical experiments support the efficiency of our DP implementation. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|