Tardiness minimisation for a customer order scheduling problem with sum-of-processing-time-based learning effect

References

• Ahmadi, R., Bagchi, U., & Roemer, T. A. (2005). Coordinated scheduling of customer orders for quick response. Naval Research Logistics, 52, 493–512.10.1002/(ISSN)1520-6750
   Web of Science ®Google Scholar
• Azizi, V., Jabbari, M., & Kheirkhah, A. S. (2016). M-machine, no-wait flowshop scheduling with sequence dependent setup times and truncated learning function to minimize the makespan. International Journal of Industrial Engineering Computations, 7(2), 309–322.10.5267/j.ijiec.2015.9.004
   Google Scholar
• Biskup, D. (1999). Single-machine scheduling with learning considerations. European Journal of Operational Research, 115, 173–178.10.1016/S0377-2217(98)00246-X
   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, 315–329.10.1016/j.ejor.2007.05.040
   Web of Science ®Google Scholar
• Chaurasia, S. N., Sundar, S., & Singh, A. (2016). Hybrid metaheuristic approaches for the single machine total stepwise tardiness problem with release date. Operational Research An international Journal, 1–21.
   Google Scholar
• Cheng, T. C. E., Wu, C.-C., & Lee, W. C. (2008). Some scheduling problems with sum-of-processing-times-based and job-position-based learning effects. Information Sciences, 178(11), 2476–2487.10.1016/j.ins.2008.02.002
   Web of Science ®Google Scholar
• Emmons, H. (1969). One-machine sequencing to minimize certain functions of job tardiness. Operations Research, 17, 701–715.10.1287/opre.17.4.701
   Web of Science ®Google Scholar
• Framinan, J. M., & Perez-Gonzalez, P. (2018). Order scheduling with tardiness objective: Improved approximate solutions. European Journal of Operational Research, 266(3), 840–850.10.1016/j.ejor.2017.10.064
   Web of Science ®Google Scholar
• Higgins, P., Le, R. P., & Tierney, L. (1996). Manufacturing planning and control-beyond MRP II. London: Chapman & Hall.
   Google Scholar
• Hollander, M. D., Wolfe, A., & Chicken, E. (2014). Nonparametric statistical methods (3rd ed.). Hoboken, NJ: Wiley.
   Google Scholar
• Janiak, A., Krysiak, T., & Trela, R. (2011). Scheduling problems with learning and ageing effects: A survey. Decision Making in Manufacturing, 5(1–2), 19–36.
   Google Scholar
• Karaboga, D. (2005). An Idea Based on Honey Bee Swarm for Numerical Optimization. Technical Report-TR06, Erciyes University, Engineering Faculty, Computer Engineering Department.
   Google Scholar
• Kennedy, J., & Eberhart, R. C. (2001). Swarm intelligence, Morgan Kaufmann, ISBN 1-55860-595-9.
   Google Scholar
• Kirkpatrick, S., Gelatt, C., & Vecchi, M. (1983). Optimization by simulated annealing. Science, 220(4598), 671–680.10.1126/science.220.4598.671
   PubMed Web of Science ®Google Scholar
• Kuo, W. H., & Yang, D. L. (2006). Minimizing the total completion time in a single- machine scheduling problem with a time- dependent learning effect. European Journal of Operational Research, 174(2), 1184–1190.10.1016/j.ejor.2005.03.020
   Web of Science ®Google Scholar
• Lee, I. S. (2013). Minimizing total tardiness for the order scheduling problem. International Journal of Production Economics, 144, 128–134.10.1016/j.ijpe.2013.01.025
   Web of Science ®Google Scholar
• Leung, J. Y. T., Li, H., & Pinedo, M. (2005). Order scheduling in an environment with dedicated resources in parallel. Journal of Scheduling, 8, 355–386.10.1007/s10951-005-2860-x
   Web of Science ®Google Scholar
• Leung, J. Y. T., Li, H., & Pinedo, M. (2006a). Scheduling orders for multiple product types with due date related objectives. European Journal of Operational Research, 168, 370–389.10.1016/j.ejor.2004.03.030
   Web of Science ®Google Scholar
• Leung, J. Y. T., Li, H., & Pinedo, M. (2006b). Approximation algorithms for minimizing total weighted completion time of orders on identical machines in parallel. Naval Research Logistics, 53, 243–260.10.1002/(ISSN)1520-6750
   Web of Science ®Google Scholar
• Leung, J. Y. T., Li, H., & Pinedo, M. (2007). Scheduling orders for multiple product types to minimize total weighted completion time. Discrete Applied Mathematics, 155, 945–970.10.1016/j.dam.2006.09.012
   Web of Science ®Google Scholar
• Leung, J. Y. T., Li, H., Pinedo, M., & Zhang, J. (2007). Minimizing total weighted completion time when scheduling orders in a flexible environment with uniform machines. Information Processing Letters, 103, 119–129.10.1016/j.ipl.2007.03.002
   Web of Science ®Google Scholar
• Leung, J. Y. T., Li, H., & Pinedo, M. (2008). Scheduling orders on either dedicated or flexible machines in parallel to minimize total weighted completion time. Annals of Operations Research, 159, 107–123.10.1007/s10479-007-0270-5
   Web of Science ®Google Scholar
• Leung, J. Y. T., Lee, C. Y., Ng, C. W., & Young, G. H. (2008). Preemptive multiprocessor order scheduling to minimize total weighted flowtime. European Journal of Operational Research, 190, 40–51.10.1016/j.ejor.2007.05.052
   Web of Science ®Google Scholar
• Lin, W.-C., Yin, Y., Cheng, S. R., Cheng, T. C. E., Wu, C. H., & Wu, C.-C. (2017). Particle swarm optimization and opposite-based particle swarm optimization for two-agent multi-facility customer order scheduling with ready times. Applied Soft Computing, 52, 877–884.10.1016/j.asoc.2016.09.038
   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, Article ID 452602.
   Google Scholar
• Ma, Q., Lei, X., & Zhang, Q. (2009). Mobile robot path planning with complex constraints based on the second-order oscillating particle swarm optimization algorithm. Word Congress on Computer Science and Information Engineering, 2009, 244–248.
   Google Scholar
• Nadler, D., & Smith, W. D. (1963). Manufacturing progress functions for types of processes. International Journal of Production Research, 2, 115–135.10.1080/00207546308947818
   Google Scholar
• Poli R. (2008). Analysis of the publications on the applications of particle swarm optimization, Journal of Artificial Evolution and Applications, 1–10.
   Google Scholar
• Singh, A. (2009). An artificial bee colony algorithm for the leaf-constrained minimum spanning tree problem. Applied Soft Computing, 9, 625–631.10.1016/j.asoc.2008.09.001
   Web of Science ®Google Scholar
• Sung, C. S., & Yoon, S. H. (1998). Minimizing total weighted completion time at a pre- assembly stage composed of two feeding machines. International Journal of Production Economics, 54, 247–255.10.1016/S0925-5273(97)00151-5
   Web of Science ®Google Scholar
• Wagneur, E., & Sriskandarajah, C. (1993). Open shops with jobs overlap. European Journal of Operational Research, 71, 366–378.10.1016/0377-2217(93)90347-P
   Web of Science ®Google Scholar
• Wang, G., & Cheng, T. C. E. (2003). Customer order scheduling to minimize total weighted completion time. Proceedings of the 1st Multidisciplinary Conference on Scheduling Theory and Applications (pp. 409–416).
   Google Scholar
• Wang, G., & Cheng, T. C. E. (2007). Customer order scheduling to minimize total weighted completion time. Omega, 35, 623–626.10.1016/j.omega.2005.09.007
   Web of Science ®Google Scholar
• Wang, J. B. (2010). Single-machine scheduling with a sum-of-actual-processing-time- based learning effect. Journal of the Operational Research Society, 62(1), 172–177.10.1057/jors.2008.146
   Web of Science ®Google Scholar
• Wang, L. Y., Wang, J. B., Wang, D., Yin, N., Huang, X., & Feng, E. M. (2009). Single-machine scheduling with a sum-of-processing-time based learning effect and deteriorating job. The International Journal of Advanced Manufacturing Technology, 29, 336.10.1007/s00170-009-1950-x
   Web of Science ®Google Scholar
• Wu, C.-C., Wu, W. H., Hsu, P. H., & Lai, K. (2012). A two-machine flowshop scheduling problem with a truncated sum of processing-times-based learning function. Applied Mathematical Modelling, 36(10), 5001–5014.10.1016/j.apm.2011.12.038
   Web of Science ®Google Scholar
• Wu, C.-C., Liu, S. C., Zhao, C. L., Wang, S. Z., & Lin, W.-C. (2017). A multi-machine order scheduling with learning using the genetic algorithm and particle swarm optimization. The Computer Journal, 61(1), 14–31. doi:10.1093/comjnl/bxx021
   Web of Science ®Google Scholar
• Xu, J., Wu, C.-C., Yin, Y., Zhao, C. L., Chiou, Y. T., & Lin, W.-C. (2016). An order scheduling problem with position-based learning effect. Computers & Operations Research, 74, 175–186.10.1016/j.cor.2016.04.021
   Web of Science ®Google Scholar
• Yelle, L. E. (1979). The learning curve: Historical review and comprehensive survey. Decision Science, 10, 302–328.10.1111/deci.1979.10.issue-2
   Google Scholar
• Yin, Y., Cheng, T. C. E., & Wu C.-C. (2014). Scheduling with time-dependent processing times. Mathematical Problems in Engineering, 2014, 2, Article ID 201421.
   Web of Science ®Google Scholar
• Yin, Y., Cheng, T. C. E., & Wu C.-C. (2015). Scheduling with time-depending processing times. Mathematical Problems in Engineering, 2015, 2, Article ID 367585.
   Web of Science ®Google Scholar
• Yoon, S. H., & Sung, C. S. (2005). Fixed pre-assembly scheduling on multiple fabrication machines. International Journal of Production Economics, 96, 109–118.10.1016/j.ijpe.2004.03.005
   Web of Science ®Google Scholar
• Zhang, X., Yan, G., Huang, W., & Tang, G. (2012). A note on machine scheduling with sum-of-logarithm-processing-time-based and position-based learning effects. Information Sciences, 187, 298–304.
   Web of Science ®Google Scholar