A note: minimizing total absolute deviation of job completion times on unrelated machines with general position-dependent processing times and job-rejection
- 95 Downloads
We study a scheduling problem with the objective of minimizing total absolute deviation of completion times (TADC). TADC is considered here in the most general form studied so far: the machine setting is that of parallel unrelated, job processing time are assumed to be position-dependent with no restrictions on the functional form, and the option of processing only a subset of the jobs (i.e., job-rejection) is allowed. We show that minimizing TADC in this very general form remains polynomially solvable in the number of jobs.
KeywordsScheduling Unrelated machines Total absolute deviation of completion times Position-dependent processing times Job-rejection
This research was supported by the Israel Science Foundation (Grant No. 1286/14). The second author was also supported by the Charles I. Rosen Chair of Management, and by The Recanati Fund of The School of Business Administration, The Hebrew University, Jerusalem, Israel.
- Chen, S. H., Mani, V., & Chen, Y. H. (2015). Bi-criterion single machine scheduling problem with a past-sequence-dependent setup times and learning effect. In Proceedings of the 2015 IEEE IEEM (pp. 185–189).Google Scholar
- Gerstl, E., & Mosheiov, G. (2017). Single machine scheduling problems with generalized due-dates and job-rejection. International Journal of Operations Research, 55, 3164–3172.Google Scholar
- Pei, J., Cheng, B., Liu, X., Pardalos, P. M., & Kong, M. (2017). Single-machine and parallel-machine serial-batching scheduling problems with position-based learning effect and linear setup time. Annals of Operations Research. https://doi.org/10.1007/s10479-017-2481-8.
- Stirzaker, D. (1994). Elementary probability. Cambridge: Cambridge University Press.Google Scholar