Scheduling with regular performance measures and optional job rejection on a single machine

References

• Agnetis, A., & Mosheiov, G. (2017). Scheduling with job-rejection and position-dependent processing times on proportionate flowshops. Optimization Letters, 11(4), 885–892. doi:10.1007/s11590-016-1059-8
   Web of Science ®Google Scholar
• Cao, Z. G., Wang, Z., Zhang, Y. Z., & Liu, S. P. (2006). On several scheduling problems with rejection or discretely compressible processing times. Lecture Notes in Computer Science, 3959, 90–98. doi:10.1007/11750321_8
   Google Scholar
• Domaniç, N. O., & Plaxton, C. G. (2014). Scheduling unit jobs with a common deadline to minimize the sum of weighted completion times and rejection penalties. Lecture Notes in Computer Science, 8889, 646–657. doi:10.1007/978-3-319-13075-0_51
   Google Scholar
• Garey, M. R., & Johnson, D. S. (1979). Computers and intractability a guide to the theory of NP-completeness San Francisco. New Orleans, LA: Freeman.
   Google Scholar
• Gerstl, E., Mor, B., & Mosheiov, G. (2017). Minmax scheduling with acceptable lead-times: Extensions to position-dependent processing times, due-window and job rejection. Computers & Operations Research, 83, 150–156. doi:10.1016/j.cor.2017.02.010
   Web of Science ®Google Scholar
• Gerstl, E., & Mosheiov, G. (2017). Single machine scheduling problems with generalised due-dates and job-rejection. International Journal of Production Research, 55(11), 3164–3172. doi:10.1080/00207543.2016.1266055
   Web of Science ®Google Scholar
• Graham, R. L., Lawler, E. L., & Lenstra, J. K. (1979). Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics, 4, 287–326. doi:10.1016/S0167-5060(08)70356-X
   Google Scholar
• Güntzer, M. M., & Jungnickel, D. (2000). Approximate minimization algorithms for the 0/1 knapsack and subset-sum problem. Operations Research Letters, 26(2), 55–66. doi:10.1016/S0167-6377(99)00066-8
   Web of Science ®Google Scholar
• He, C., Leung, J. Y. T., Lee, K., & Pinedo, M. L. (2016a). Scheduling a single machine with parallel batching to minimize makespan and total rejection cost. Discrete Applied Mathematics, 204, 150–163. doi:10.1016/j.dam.2015.10.021
   Web of Science ®Google Scholar
• He, C., Leung, J. Y. T., Lee, K., & Pinedo, M. L. (2016b). Improved algorithms for single machine scheduling with release dates and rejections. 4OR, 14(1), 41–55. doi:10.1007/s10288-016-0303-5
   Google Scholar
• Jackson, J. R. (1955). Scheduling a production line to minimize maximum tardiness. Management Sciences Research Project, Research Report 43, UCLA.
   Google Scholar
• Jiang, D., & Tan, J. (2016). Scheduling with job rejection and nonsimultaneous machine available time on unrelated parallel machines. Theoretical Computer Science, 616, 94–99. doi:10.1016/j.tcs.2015.12.020
   Web of Science ®Google Scholar
• Kacem, I. (2010). Fully polynomial time approximation scheme for the total weighted tardiness minimization with a common due date. Discrete Applied Mathematics, 158(9), 1035–1040. doi:10.1016/j.dam.2010.01.013
   Web of Science ®Google Scholar
• Kellerer, H., & Strusevich, V. A. (2006). A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date. Theoretical Computer Science, 369(1–3), 230–238. doi:10.1016/j.tcs.2006.08.030
   Web of Science ®Google Scholar
• Li, S. S., & Chen, R. X. (2017). Scheduling with rejection and a deteriorating maintenance activity on a single machine. Asia-Pacific Journal of Operational Research, doi:10.1142/S0217595917500105
   Web of Science ®Google Scholar
• Li, W. X., & Zhao, C. L. (2015). Deteriorating jobs scheduling on a single machine with release dates, rejection and a fixed non-availability interval. Journal of Applied Mathematics and Computing, 48(1–2), 585–605. doi:10.1007/s12190-014-0820-3
   Web of Science ®Google Scholar
• Ma, R., & Yuan, J. J. (2016). Online scheduling with rejection to minimize the total weighted completion time plus the total rejection cost on parallel machines. Journal of the Operations Research Society of China, 4(1), 111–119. doi:10.1007/s40305-015-0093-z
   Web of Science ®Google Scholar
• Mor, B. (2018). Minmax scheduling problems with common due-date and completion time penalty. Journal of Combinatorial Optimization. https://doi.org/10.1007/s10878-018-0365-8.
   Web of Science ®Google Scholar
• Mor, B., & Mosheiov, G. (2016). Minimizing maximum cost on a single machine with two competing agents and job rejection. Journal of the Operational Research Society, 67(12), 1524–1531. doi:10.1057/s41274-016-0003-8
   Web of Science ®Google Scholar
• Mor, B., & Mosheiov, G. (2018). A note: Minimizing total absolute deviation of job completion times on unrelated machines with general position-dependent processing times and job-rejection. Annals of Operations Research, 271(2), 1079–1085. doi:10.1007/s10479-018-2779-1
   Web of Science ®Google Scholar
• Mor, B., & Shapira, D. (2019). Improved algorithms for scheduling on proportionate flowshop with job-rejection. Journal of the Operational Research Society. doi:10.1080/01605682.2018.1506540
   Web of Science ®Google Scholar
• Ou, J., Zhong, X., & Li, C. L. (2016). Faster algorithms for single machine scheduling with release dates and rejection. Information Processing Letters, 116(8), 503–507. doi:10.1016/j.ipl.2016.02.008
   Web of Science ®Google Scholar
• Ou, J., Zhong, X., & Wang, G. (2015). An improved heuristic for parallel machine scheduling with rejection. European Journal of Operational Research, 241(3), 653–661. doi:10.1016/j.ejor.2014.09.028
   Web of Science ®Google Scholar
• Pinedo, M. L. (2016). Scheduling: Theory, algorithms and systems (5th ed.). New York, NY: Springer.
   Google Scholar
• Shabtay, D. (2014). The single machine serial batch scheduling problem with rejection to minimize total completion time and total rejection cost. European Journal of Operational Research, 233(1), 64–74. doi:10.1016/j.ejor.2013.08.013
   Web of Science ®Google Scholar
• Shabtay, D., Gaspar, N., & Kaspi, M. (2013). A survey on offline scheduling with rejection. Journal of Scheduling, 16(1), 3–28. doi:10.1007/s10951-012-0303-z
   Web of Science ®Google Scholar
• Shabtay, D., & Oron, D. (2016). Proportionate flow-shop scheduling with rejection. Journal of the Operational Research Society, 67(5), 752–769. doi:10.1057/jors.2015.95
   Web of Science ®Google Scholar
• Wang, D. J., Liu, F., & Jin, Y. (2017). A multi-objective evolutionary algorithm guided by directed search for dynamic scheduling. Computers & Operations Research, 79, 279–290. doi:10.1016/j.cor.2016.04.024
   Web of Science ®Google Scholar
• Wang, D. J., Yin, Y., Cheng, S. R., Cheng, T. C. E., & Wu, C. C. (2016). Due date assignment and scheduling on a single machine with two competing agents. International Journal of Production Research, 54(4), 1152–1169. doi:10.1080/00207543.2015.1056317
   Web of Science ®Google Scholar
• Wang, D. J., Yin, Y., & Cheng, T. C. E. (2018). Parallel-machine rescheduling with job unavailability and rejection. Omega, 81, 246–260. doi:10.1016/j.omega.2018.04.008
   Web of Science ®Google Scholar
• Yin, Y., Cheng, T. C. E., Wang, D., & Wu, C. (2016). Improved algorithms for single-machine serial-batch scheduling with rejection to minimize total completion time and total rejection cost. IEEE Transactions on Systems, Man, and Cybernetics: Systems, 46(11), 1578–1588. doi:10.1109/TSMC.2015.2505644
   Web of Science ®Google Scholar
• Yuan, J. (1992). The NP-hardness of the single machine common due date weighted tardiness problem. Systems Science and Mathematical Sciences, 5, 328–333.
   Google Scholar
• Zhang, L., Lu, L., & Yuan, J. (2010). Single-machine scheduling under the job rejection constraint. Theoretical Computer Science, 411(16–18), 1877–1882. doi:10.1016/j.tcs.2010.02.006
   Web of Science ®Google Scholar
• Zhang, X., Xu, D., Du, D., & Wu, C. (2016). Approximation algorithms for precedence-constrained identical machine scheduling with rejection. Journal of Combinatorial Optimization. doi:10.1007/s10878-016-0044-6.
   Web of Science ®Google Scholar
• Zhong, X., Pan, Z., & Jiang, D. (2017). Scheduling with release times and rejection on two parallel machines. Journal of Combinatorial Optimization, 33(3), 934–944. doi:10.1007/s10878-016-0016-x
   Web of Science ®Google Scholar
• Zou, J., & Miao, C. (2016). The single machine serial batch scheduling problems with rejection. Operational Research, 16(2), 211–221. doi:10.1007/s12351-015-0193-x
   Web of Science ®Google Scholar