Improved algorithms for scheduling on proportionate flowshop with job-rejection

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
• Deng, W., Chen, R., He, B., Liu, Y., Yin, L., & Guo, J. (2012). A novel two-stage hybrid swarm intelligence optimization algorithm and application. Soft Computing, 16(10), 1707–1722. doi: 10.1007/s00500-012-0855-z
   Web of Science ®Google Scholar
• Deng, W., Zhao, H., Liu, J., Yan, X., Li, Y., Yin, L., & Ding, C. (2015). An improved CACO algorithm based on adaptive method and multi-variant strategies. Soft Computing, 19(3), 701–713. doi: 10.1007/s00500-014-1294-9
   Web of Science ®Google Scholar
• Deng, W., Zhao, H., Yang, X., Xiong, J., Sun, M., & Li, B. (2017). Study on an improved adaptive PSO algorithm for solving multi-objective gate assignment. Applied Soft Computing, 59, 288–302. doi: 10.1016/j.asoc.2017.06.004
   Web of Science ®Google Scholar
• Deng, W., Zhao, H., Zou, L., Li, G., Yang, X., & Wu, D. (2017). A novel collaborative optimization algorithm in solving complex optimization problems. Soft Computing, 21(15), 4387–4398. doi: 10.1007/s00500-016-2071-8
   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
• 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., Mor, B., & Mosheiov, G. (2018). Scheduling on a proportionate flowshop to minimize total late work. International Journal of Production Research, 1, 1–13. doi: 10.1080/00207543.2018.1456693
   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
• Li, S. S., Qian, D. L., & Chen, R. X. (2017). Proportionate flow shop scheduling with rejection. Asia-Pacific Journal of Operational Research, 34(4), 1750015. doi: 10.1142/S0217595917500154
   Web of Science ®Google Scholar
• Mor, B., & Mosheiov, G. (2016). Minsum and minmax scheduling on a proportionate flowshop with common flow-allowance. European Journal of Operational Research, 254(2), 360–370. doi: 10.1016/j.ejor.2016.03.037
   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, doi: 10.1007/s10479-018-2779-1
   PubMed Web of Science ®Google Scholar
• Panwalkar, S. S., & Koulamas, C. (2015). Proportionate flow shop: New complexity results and models with due date assignment. Naval Research Logistics (Nrl), 62(2), 98–106. doi: 10.1002/nav.21615
   Web of Science ®Google Scholar
• Panwalkar, S. S., & Koulamas, C. (2017). On the dominance of permutation schedules for some ordered and proportionate flow shop problem. Computers & Industrial Engineering, 107, 105–108. doi: 10.1016/j.cie.2017.03.013
   Web of Science ®Google Scholar
• Panwalkar, S. S., Smith, M. L., & Koulamas, C. (2013). Review of the ordered and proportionate flow shop scheduling research. Naval Research Logistics (Nrl), 60(1) 46–55. doi: 10.1002/nav.21518
   Web of Science ®Google Scholar
• Pinedo, M. L. (2016). Scheduling: Theory, algorithms and systems (5th ed.). New-York: Springer.
   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
• Xue, Y., Jiang, J., Zhao, B., & Ma, T. (2018). A self-adaptive artificial bee colony algorithm based on global best for global optimization. Soft Computing, 22(9), 2935–2952. doi: 10.1007/s00500-017-2547-1
   Web of Science ®Google Scholar