Minimizing the total weighted tardiness of overlapping jobs on parallel machines with a learning effect

Reference

• Anghinolfi, D., & Paolucci, M. (2007). Parallel machine total tardiness scheduling with a new hybrid metaheuristic approach. Computers & Operations Research, 34(11), 3471–3490. doi:10.1016/j.cor.2006.02.009
   Web of Science ®Google Scholar
• Azadeh, A., Habibnejad-Ledari, H., Zadeh, S. A., & Farahani, M. H. (2017). A single-machine scheduling problem with learning effect, deterioration and non-monotonic time-dependent processing times. International Journal of Computer Integrated Manufacturing, 30(2–3), 292–304. doi:10.1080/0951192X.2016.1145808
   Web of Science ®Google Scholar
• Biskup, D. (2008). A state-of-the-art review on scheduling with learning effect. European Journal of Operational Research, 188(2), 315–329. doi:10.1016/j.ejor.2007.05.040
   Web of Science ®Google Scholar
• Biskup, D., Herrmann, J., & Gupta, J. N. D. (2008). Scheduling identical parallel machines to minimize total tardiness. International Journal of Production Economics, 115(1), 134–142. doi:10.1016/j.ijpe.2008.04.011
   Web of Science ®Google Scholar
• Chang, C. T., Chou, Y. Y., & Zhuang, Z. Y. (2015). A practical expected-value-approach model to assess the relevant procurement costs. Journal of the Operational Research Society, 66(4), 539–553. doi:10.1057/jors.2014.16
   Web of Science ®Google Scholar
• Chang, C. T., Chung, C. K., Sheu, J. B., Zhuang, Z. Y., & Chen, H. M. (2014). The optimal dual-pricing policy of mall parking service. Transportation Research Part A: Policy and Practice, 70, 223–243. doi:10.1016/j.tra.2014.10.012
   Web of Science ®Google Scholar
• Du, J., & Leung, J. Y. T. (1990). Minimizing total tardiness on one machine is NP-hard. Mathematics of Operations Research, 15(3), 483–495. doi:10.1287/moor.15.3.483
   Web of Science ®Google Scholar
• Fromer, R., Sturmer, B., & Sommer, W. (2016). Come to think of it: Contributions of reasoning abilities and training schedule to skill acquisition in a virtual throwing task. Acta Psychologica, 170, 58–65. doi:10.1016/j.actpsy.2016.06.010
   PubMed Web of Science ®Google Scholar
• Ji, M., Tang, X. Y., Zhang, X., & Cheng, T. C. E. (2016). Machine scheduling with deteriorating jobs and DeJong’s learning effect. Computers & Industrial Engineering, 91, 42–47. doi:10.1016/j.cie.2015.10.015
   Web of Science ®Google Scholar
• Ji M, W. J., & Lee, W. C. (2013). Minimizing resource consumption on uniform parallel machines with a bound on makespan. Computers & Operations Research, 40(12), 2970–2974.
   Web of Science ®Google Scholar
• Lai, P. J., & Lee, W. C. (2013). Single-machine scheduling with learning and forgetting effects. Applied Mathematical Modelling, 37(6), 4509–4516.
   Web of Science ®Google Scholar
• Lee, W. C., & Wang, J. Y. (2014). A scheduling problem with three competing agents. Computers & Operations Research, 51, 208–217.
   Web of Science ®Google Scholar
• Lee, W. C., & Wang, J. Y. (2017). A three-agent scheduling problem for minimizing the makespan on a single machine. Computers & Industrial Engineering, 106, 147–160. doi:10.1016/j.cie.2017.02.001
   Web of Science ®Google Scholar
• Lee, W. C., Wang, J. Y., & Lee, L. Y. (2015). A hybrid genetic algorithm for an identical parallel-machine problem with maintenance activity. Journal of the Operational Research Society, 66(11), 1906–1918. doi:10.1057/jors.2015.19
   Web of Science ®Google Scholar
• Liu, S. C., Hung, W. L., & Wu, C. C. (2015). Note on a single-machine scheduling problem with sum of processing times based learning and ready times. Mathematical Problems in Engineering, 2015, 9. doi:10.1155/2015/452602
   Web of Science ®Google Scholar
• Lu, Y. Y., Wang, J. J., & Huang, X. (2015). Scheduling jobs with position and sum-of-processing-time based processing times. Applied Mathematical Modelling, 39(14), 4013–4021. doi:10.1016/j.apm.2014.12.021
   Web of Science ®Google Scholar
• Moradi, H., & Zandieh, M. (2013). An imperialist competitive algorithm for a mixed-model assembly line sequencing problem. Journal of Manufacturing Systems, 32(1), 46–54. doi:10.1016/j.jmsy.2012.05.001
   Web of Science ®Google Scholar
• Qin, H. Z., Zhang, Z. H., & Bai, D. Y. (2016). Permutation flowshop group scheduling with position-based learning effect. Computers & Industrial Engineering, 92, 1–15. doi:10.1016/j.cie.2015.12.001
   Web of Science ®Google Scholar
• Renna, P. (2015). Deteriorating job scheduling problem in a job-shop manufacturing system by multi-agent system. International Journal of Computer Integrated Manufacturing, 28(9), 936–945. doi:10.1080/0951192X.2014.928747
   Web of Science ®Google Scholar
• Shiau, Y. R., Lee, W. C., Kung, Y. S., & Wang, J. Y. (2016). A lower bound for minimizing the total completion time of a three-agent scheduling problem. Information Sciences, 340, 305–320. doi:10.1016/j.ins.2016.01.031
   Web of Science ®Google Scholar
• Soroush, H. M. (2016). Multicriteria scheduling with controllable processing times, setup times, and learning, ageing and deterioration effects on a single machine. European Journal of Industrial Engineering, 10(4), 455–478. doi:10.1504/EJIE.2016.078140
   Web of Science ®Google Scholar
• Sun, L. H., Cui, K., Chen, J. H., & Wang, J. (2016). Due date assignment and convex resource allocation scheduling with variable job processing times. International Journal of Production Research, 54(12), 3551–3560. doi:10.1080/00207543.2015.1083628
   Web of Science ®Google Scholar
• Toksari, M. D. (2011). A branch and bound algorithm for minimizing makespan on a single machine with unequal release times under learning effect and deteriorating jobs. Computers & Operations Research, 38(9), 1361–1365.
   Web of Science ®Google Scholar
• Toksari, M. D. (2016). A branch and bound algorithm to minimize the single machine maximum tardiness problem under effects of learning and deterioration with setup times. Rairo-Operations Research, 50(1), 211–219.
   Web of Science ®Google Scholar
• Wang, J. B., Liu, F., & Wang, J. J. (2016). Research on m-machine flow shop scheduling with truncated learning effects. International Transactions in Operational Research, 26(3), 1135–1151.
   Web of Science ®Google Scholar
• Wang, J. Y. (2012). Set-based broadcast scheduling for minimizing the worst access time of multiple data items in wireless environments. Information Sciences, 199, 93–108. doi:10.1016/j.ins.2012.02.038
   Web of Science ®Google Scholar
• Wang, J. Y. (2016). Minimizing the average waiting time of unequal-size data items in a mobile computing environment. Mobile Information Systems, 2016, 1. doi:10.1155/2016/9371563
   Web of Science ®Google Scholar
• Wu, C. H., Lee, W. C., Lai, P. J., & Wang, J. Y. (2016). Some single-machine scheduling problems with elapsed-time-based and position-based learning and forgetting effects. Discrete Optimization, 19, 1–11. doi:10.1016/j.disopt.2015.11.002
   Web of Science ®Google Scholar
• Wu, W. H., Yin, Y. Q., Cheng, T. C. E., Lin, W. C., Chen, J. C., Luo, S. Y., & Wu, C. C. (2017). A combined approach for two-agent scheduling with sum-of-processing-times-based learning effect. Journal of the Operational Research Society, 68(2), 111–120. doi:10.1057/s41274-016-0008-3
   Web of Science ®Google Scholar
• Wu, Y. B., & Wang, J. J. (2016). Single-machine scheduling with truncated sum-of-processing-times-based learning effect including proportional delivery times. Neural Computing and Applications, 27(4), 937–943. doi:10.1007/s00521-015-1910-3
   Web of Science ®Google Scholar
• Xu, J. Y., Lin, W. C., Wu, J. J., Cheng, S. R., Wang, Z. L., & Wu, C. C. (2016a). Heuristic based genetic algorithms for the re-entrant total completion time flowshop scheduling with learning consideration. International Journal of Computational Intelligence Systems, 9(6), 1082–1100. doi:10.1080/18756891.2016.1256572
   Web of Science ®Google Scholar
• Xu, J. Y., Wu, C. C., Yin, Y. Q., Zhao, C. L., Chiou, Y. T., & Lin, W. C. (2016b). An order scheduling problem with position-based learning effect. Computers & Operations Research, 74, 175–186. doi:10.1016/j.cor.2016.04.021
   Web of Science ®Google Scholar
• Yang, W. H., & Chand, S. (2008). Learning and forgetting effects on a group scheduling problem. European Journal of Operational Research, 187(3), 1033–1044. doi:10.1016/j.ejor.2006.03.065
   Web of Science ®Google Scholar
• Yazdani, M., Khalili, S. M., & Jolai, F. (2016). A parallel machine scheduling problem with two-agent and tool change activities: An efficient hybrid metaheuristic algorithm. International Journal of Computer Integrated Manufacturing, 29(10), 1075–1088. doi:10.1080/0951192X.2015.1130261
   Web of Science ®Google Scholar
• Yin, Y., Wu, W.-H., Wu, W.-H., & Wu, C.-C. (2014). A branch-and-bound algorithm for a single machine sequencing to minimize the total tardiness with arbitrary release dates and position-dependent learning effects. Information Sciences, 256, 91–108.
   Web of Science ®Google Scholar
• Zandieh, M., Khatami, A. R., & Rahmati, S. H. A. (2017). Flexible job shop scheduling under condition-based maintenance: Improved version of imperialist competitive algorithm. Applied Soft Computing, 58, 449–464.
   Web of Science ®Google Scholar