Scheduling customer orders on unrelated parallel machines to minimise total weighted completion time

References

• Ahmadi, R., Bagchi, U., & Roemer, T. A. (2005). Coordinated scheduling of customer orders for quick response. Naval Research Logistics (Logistics), 52(6), 493–512. doi:10.1002/nav.20092
   Web of Science ®Google Scholar
• Blocher, J. D., & Chhajed, D. (1996). The customer order lead-time problem on parallel machines. Naval Research Logistics (Logistics), 43(5), 629–654. doi:10.1002/(SICI)1520-6750(199608)43:5<629::AID-NAV3>3.0.CO;2-7
   Web of Science ®Google Scholar
• Bookbinder, J. H., & Higginson, J. K. (1986). Customer service vs trim waste in corrugated box manufacture. The Journal of the Operational Research Society, 37(11), 1061–1071. doi:10.2307/2582690
   Web of Science ®Google Scholar
• Boyer, K. K., & Hult, G. T. M. (2005). Extending the supply chain: Integrating operations and marketing in the online grocery industry. Journal of Operations Management, 23(6), 642–661. doi:10.1016/j.jom.2005.01.003
   Web of Science ®Google Scholar
• Garg, N., Kumar, A., & Pandit, V. (2007). Order scheduling models: Hardness and algorithms. In FSTTCS. 2007: Foundations of software technology and theoretical computer science (pp. 96–107). Berlin, Heidelberg: Springer.
   Google Scholar
• Graham, R. L., Lawler, E. L., Lenstra, J. K., & Kan, A. H. G. R. (1979). Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics, 5(2), 287–326. doi:10.1016/S0167-5060(08)70356-X
   Google Scholar
• Guinet, A. (1991). Textile production systems: A succession of non-identical parallel processor shops. Journal of the Operational Research Society, 42(8), 655–671. doi:10.1057/jors.1991.132
   Web of Science ®Google Scholar
• Hardy, G. H., Littlewood, J. E., & Pólya, G. (1952). Inequalities. Cambridge, United Kingdom: Cambridge University Press.
   Google Scholar
• Hendry, L., & Kingsman, B. (1993). Customer enquiry management: Part of a hierarchical system to control lead times in make-to-order companies. The Journal of the Operational Research Society, 44(1), 61–70. doi:10.2307/2584435
   Web of Science ®Google Scholar
• Julien, F. M., & Magazine, M. J. (1990). Scheduling customer orders–an alternative production scheduling approach. Journal of Manufacturing and Operations Management, 3(3), 177–199.
   Google Scholar
• Kim, Y. D., Shim, S. O., Kim, S. B., Choi, Y. C., & Yoon, H. M. (2004). Parallel machine scheduling considering a job-splitting property. International Journal of Production Research, 42(21), 4531–4546. doi:10.1080/00207540410001720745
   Web of Science ®Google Scholar
• Lawrynowicz, A. (2008). Integration of production planning and scheduling using an expert system and a genetic algorithm. Journal of the Operational Research Society, 59(4), 455–463. doi:10.1057/palgrave.jors.2602423
   Web of Science ®Google Scholar
• Lee, I. S. (2013). Minimizing total tardiness for the order scheduling problem. International Journal of Production Economics, 144(1), 128–134. doi:10.1016/j.ijpe.2013.01.025
   Web of Science ®Google Scholar
• Leung, J. Y. T., Li, H., & Pinedo, M. (2005a). Order scheduling in an environment with dedicated resources in parallel. Journal of Scheduling, 8(5), 355–386. doi:10.1007/s10951-005-2860-x
   Web of Science ®Google Scholar
• Leung, J. Y. T., Li, H., & Pinedo, M. (2005b). Order scheduling models: An overview. In Multidisciplinary scheduling: Theory and applications (pp. 37–53). Boston, MA: Springer.
   Google Scholar
• Leung, J. Y. T., Li, H., & Pinedo, M. (2006). Scheduling orders for multiple product types with due date related objectives. European Journal of Operational Research, 168(2), 370–389. doi:10.1016/j.ejor.2004.03.030
   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(8), 945–970. doi:10.1016/j.dam.2006.09.012
   Web of Science ®Google Scholar
• Li, H., Xu, X., & Zhao, Y. (2017). Customer order scheduling on unrelated parallel machines to minimize total weighted completion time. Paper presented at the Proceedings of the 8th Multidisciplinary International Conference on Scheduling: Theory and Applications (pp. 013–029), Kuala Lumpur, Malaysia.
   Google Scholar
• Ng, C. T., Cheng, T. C. E., & Yuan, J. J. (2003). Concurrent open shop scheduling to minimize the weighted number of tardy jobs. Journal of Scheduling, 6(4), 405–412. doi:10.1023/A:1024284828374
   Web of Science ®Google Scholar
• Phalakornkule, C., Polgumhang, S., Tongdaung, W., Karakat, B., & Nuyut, T. (2010). Electrocoagulation of blue reactive, red disperse and mixed dyes, and application in treating textile effluent. Journal of Environmental Management, 91(4), 918–926. doi:10.1016/j.jenvman.2009.11.008
   PubMed Web of Science ®Google Scholar
• Pinedo, M. L. (2012). Scheduling: Theory, algorithms, and systems. New York, NY: Springer.
   Google Scholar
• Sampson, S. E. (2000). Customer-supplier duality and bidirectional supply chains in service organizations. International Journal of Service Industry Management, 11(4), 348–364. doi:10.1108/09564230010355377
   Google Scholar
• Serafini, P. (1996). Scheduling jobs on several machines with the job splitting property. Operations Research, 44(4), 617–628. doi:10.1287/opre.44.4.617
   Web of Science ®Google Scholar
• Shim, S.-O., & Kim, Y.-D. (2008). A branch and bound algorithm for an identical parallel machine scheduling problem with a job splitting property. Computers & Operations Research, 35(3), 863–875. doi:10.1016/j.cor.2006.04.006
   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(3), 247–255. doi:10.1016/S0925-5273(97)00151-5
   Web of Science ®Google Scholar
• Wang, G., & Cheng, T. (2003). Customer order scheduling to minimize total weighted completion time. Paper presented at the Proceedings of the 1-st Multidiscriplinary Conference on Scheduling Theory and Applications (pp. 409–416), Nottingham, UK.
   Google Scholar
• Wang, G., & Cheng, T. C. E. (2007). Customer order scheduling to minimize total weighted completion time. Omega, 35(5), 623–626. doi:10.1016/j.omega.2005.09.007
   Web of Science ®Google Scholar
• Xu, X., Ma, Y., Zhou, Z., & Zhao, Y. (2015). Customer order scheduling on unrelated parallel machines to minimize total completion time. IEEE Transactions on Automation Science and Engineering, 12(1), 244–257. doi:10.1109/TASE.2013.2291899
   Web of Science ®Google Scholar
• Yalaoui, F., & Chu, C. (2003). An efficient heuristic approach for parallel machine scheduling with job splitting and sequence-dependent setup times. IIE Transactions, 35(2), 183–190. doi:10.1080/07408170304382
   Web of Science ®Google Scholar
• Yang, J. (2005). The complexity of customer order scheduling problems on parallel machines. Computers & Operations Research, 32(7), 1921–1939. doi:10.1016/j.cor.2003.12.008
   Web of Science ®Google Scholar