{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,7]],"date-time":"2025-11-07T13:31:21Z","timestamp":1762522281930,"version":"3.37.3"},"reference-count":74,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2019,5,10]],"date-time":"2019-05-10T00:00:00Z","timestamp":1557446400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2020,2]]},"DOI":"10.1007\/s10479-019-03267-2","type":"journal-article","created":{"date-parts":[[2019,5,10]],"date-time":"2019-05-10T13:42:26Z","timestamp":1557495746000},"page":"315-334","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":21,"title":["Solving parallel machine problems with delivery times and tardiness objectives"],"prefix":"10.1007","volume":"285","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7341-072X","authenticated-orcid":false,"given":"S\u00f6hnke","family":"Maecker","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liji","family":"Shen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,5,10]]},"reference":[{"key":"3267_CR1","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1016\/j.cor.2014.08.012","volume":"53","author":"F Ahmadizar","year":"2015","unstructured":"Ahmadizar, F., & Farhadi, S. (2015). Single-machine batch delivery scheduling with job release dates, due windows and earliness, tardiness, holding and delivery costs. Computers & Operations Research, 53, 194\u2013205.","journal-title":"Computers & Operations Research"},{"issue":"8","key":"3267_CR2","doi-asserted-by":"crossref","first-page":"775","DOI":"10.1016\/S0305-0548(96)00080-9","volume":"24","author":"B Alidaee","year":"1997","unstructured":"Alidaee, B., & Rosa, D. (1997). Scheduling parallel machines to minimize total weighted and unweighted tardiness. Computers & Operations Research, 24(8), 775\u2013788.","journal-title":"Computers & Operations Research"},{"issue":"11","key":"3267_CR3","doi-asserted-by":"crossref","first-page":"3471","DOI":"10.1016\/j.cor.2006.02.009","volume":"34","author":"D Anghinolfi","year":"2007","unstructured":"Anghinolfi, D., & Paolucci, M. (2007). Parallel machine total tardiness scheduling with a new hybrid metaheuristic approach. Computers & Operations Research, 34(11), 3471\u20133490.","journal-title":"Computers & Operations Research"},{"issue":"2","key":"3267_CR4","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/S0925-5273(98)00034-6","volume":"55","author":"M Azizoglu","year":"1998","unstructured":"Azizoglu, M., & Kirca, O. (1998). Tardiness minimization on parallel machines. International Journal of Production Economics, 55(2), 163\u2013168.","journal-title":"International Journal of Production Economics"},{"key":"3267_CR5","unstructured":"Baker, J. E. (1987). Reducing bias and inefficiency in the selection algorithm. In Proceedings of the second international conference on genetic algorithms, pp 14\u201321."},{"issue":"1","key":"3267_CR6","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/0272-6963(82)90020-1","volume":"3","author":"KR Baker","year":"1982","unstructured":"Baker, K. R., & Bertrand, J. (1982). A dynamic priority rule for scheduling against due-dates. Journal of Operations Management, 3(1), 37\u201342.","journal-title":"Journal of Operations Management"},{"issue":"6","key":"3267_CR7","doi-asserted-by":"crossref","first-page":"9637","DOI":"10.1016\/j.eswa.2008.10.007","volume":"36","author":"J Behnamian","year":"2009","unstructured":"Behnamian, J., Zandieh, M., & Ghomi, S. F. (2009). Parallel-machine scheduling problems with sequence-dependent setup times using an aco, sa and vns hybrid algorithm. Expert Systems with Applications, 36(6), 9637\u20139644.","journal-title":"Expert Systems with Applications"},{"issue":"1","key":"3267_CR8","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1016\/j.ijpe.2008.04.011","volume":"115","author":"D Biskup","year":"2008","unstructured":"Biskup, D., Herrmann, J., & Gupta, J. N. (2008). Scheduling identical parallel machines to minimize total tardiness. International Journal of Production Economics, 115(1), 134\u2013142.","journal-title":"International Journal of Production Economics"},{"issue":"5","key":"3267_CR9","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1007\/s10732-014-9249-y","volume":"20","author":"E Cakici","year":"2014","unstructured":"Cakici, E., Mason, S. J., Geismar, H. N., & Fowler, J. W. (2014). Scheduling parallel machines with single vehicle delivery. Journal of Heuristics, 20(5), 511\u2013537.","journal-title":"Journal of Heuristics"},{"issue":"3","key":"3267_CR10","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1016\/0377-2217(87)90243-8","volume":"29","author":"J Carlier","year":"1987","unstructured":"Carlier, J. (1987). Scheduling jobs with release dates and tails on identical machines to minimize the makespan. European Journal of Operational Research, 29(3), 298\u2013306.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"3267_CR11","doi-asserted-by":"crossref","first-page":"470","DOI":"10.1016\/S0377-2217(03)00364-3","volume":"158","author":"YC Chang","year":"2004","unstructured":"Chang, Y. C., & Lee, C. Y. (2004). Machine scheduling with job delivery coordination. European Journal of Operational Research, 158(2), 470\u2013487.","journal-title":"European Journal of Operational Research"},{"issue":"1\u20132","key":"3267_CR12","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/s00170-008-1692-1","volume":"43","author":"CL Chen","year":"2009","unstructured":"Chen, C. L., & Chen, C. L. (2009). Hybrid metaheuristics for unrelated parallel machine scheduling with sequence-dependent setup times. The International Journal of Advanced Manufacturing Technology, 43(1\u20132), 161.","journal-title":"The International Journal of Advanced Manufacturing Technology"},{"key":"3267_CR13","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/j.tcs.2015.03.046","volume":"583","author":"Y Chen","year":"2015","unstructured":"Chen, Y., Lu, L., & Yuan, J. (2015). Preemptive scheduling on identical machines with delivery coordination to minimize the maximum delivery completion time. Theoretical Computer Science, 583, 67\u201377.","journal-title":"Theoretical Computer Science"},{"key":"3267_CR14","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/j.tcs.2016.01.044","volume":"622","author":"Y Chen","year":"2016","unstructured":"Chen, Y., Lu, L., & Yuan, J. (2016). Two-stage scheduling on identical machines with assignable delivery times to minimize the maximum delivery completion time. Theoretical Computer Science, 622, 45\u201365.","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"3267_CR15","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1016\/j.ijpe.2012.06.013","volume":"141","author":"YY Chen","year":"2013","unstructured":"Chen, Y. Y., Cheng, C. Y., Wang, L. C., & Chen, T. L. (2013). A hybrid approach based on the variable neighborhood search and particle swarm optimization for parallel machine scheduling problemsa case study for solar cell industry. International Journal of Production Economics, 141(1), 66\u201378.","journal-title":"International Journal of Production Economics"},{"issue":"1\u20134","key":"3267_CR16","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1016\/0360-8352(95)00126-L","volume":"29","author":"R Cheng","year":"1995","unstructured":"Cheng, R., Gen, M., & Tozawa, T. (1995). Minmax earliness\/tardiness scheduling in identical parallel machine system using genetic algorithms. Computers & Industrial Engineering, 29(1\u20134), 513\u2013517.","journal-title":"Computers & Industrial Engineering"},{"key":"3267_CR17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1155\/2012\/928312","volume":"2012","author":"W Cheng","year":"2012","unstructured":"Cheng, W., Guo, P., Zhang, Z., Zeng, M., & Liang, J. (2012). Variable neighborhood search for parallel machines scheduling problem with step deteriorating jobs. Mathematical Problems in Engineering, 2012, 1\u201320.","journal-title":"Mathematical Problems in Engineering"},{"issue":"2","key":"3267_CR18","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1093\/imaman\/dpm016","volume":"18","author":"MR De Paula","year":"2007","unstructured":"De Paula, M. R., Ravetti, M. G., Mateus, G. R., & Pardalos, P. M. (2007). Solving parallel machines scheduling problems with sequence-dependent setup times using variable neighbourhood search. IMA Journal of Management Mathematics, 18(2), 101\u2013115.","journal-title":"IMA Journal of Management Mathematics"},{"key":"3267_CR19","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1016\/j.tcs.2013.04.025","volume":"491","author":"J Dong","year":"2013","unstructured":"Dong, J., Zhang, A., Chen, Y., & Yang, Q. (2013). Approximation algorithms for two-machine open shop scheduling with batch and delivery coordination. Theoretical Computer Science, 491, 94\u2013102.","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"3267_CR20","doi-asserted-by":"crossref","first-page":"336","DOI":"10.1016\/j.cie.2010.07.001","volume":"61","author":"R Driessel","year":"2011","unstructured":"Driessel, R., & M\u00f6nch, L. (2011). Variable neighborhood search approaches for scheduling jobs on parallel machines with sequence-dependent setup times, precedence constraints, and ready times. Computers & Industrial Engineering, 61(2), 336\u2013345.","journal-title":"Computers & Industrial Engineering"},{"issue":"4","key":"3267_CR21","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1007\/s10878-010-9298-6","volume":"22","author":"Y Fang","year":"2011","unstructured":"Fang, Y., Liu, P., & Lu, X. (2011a). Optimal on-line algorithms for one batch machine with grouped processing times. Journal of Combinatorial Optimization, 22(4), 509\u2013516.","journal-title":"Journal of Combinatorial Optimization"},{"issue":"39","key":"3267_CR22","doi-asserted-by":"crossref","first-page":"5333","DOI":"10.1016\/j.tcs.2011.06.011","volume":"412","author":"Y Fang","year":"2011","unstructured":"Fang, Y., Lu, X., & Liu, P. (2011b). Online batch scheduling on parallel machines with delivery times. Theoretical Computer Science, 412(39), 5333\u20135339.","journal-title":"Theoretical Computer Science"},{"issue":"4","key":"3267_CR23","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1002\/jos.103","volume":"5","author":"A Gharbi","year":"2002","unstructured":"Gharbi, A., & Haouari, M. (2002). Minimizing makespan on parallel machines subject to release dates and delivery times. Journal of Scheduling, 5(4), 329\u2013355.","journal-title":"Journal of Scheduling"},{"issue":"3","key":"3267_CR24","doi-asserted-by":"crossref","first-page":"868","DOI":"10.1016\/j.cor.2005.05.012","volume":"34","author":"A Gharbi","year":"2007","unstructured":"Gharbi, A., & Haouari, M. (2007). An approximate decomposition algorithm for scheduling on parallel machines with heads and tails. Computers & Operations Research, 34(3), 868\u2013883.","journal-title":"Computers & Operations Research"},{"key":"3267_CR25","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"RL Graham","year":"1979","unstructured":"Graham, R. L., Lawler, E. L., Lenstra, J. K., & Rinnooy Kan, A. H. G. (1979). Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics, 5, 287\u2013326.","journal-title":"Annals of Discrete Mathematics"},{"key":"3267_CR26","first-page":"22","volume":"17","author":"LA Hall","year":"1992","unstructured":"Hall, L. A., & Shmoys, D. B. (1992). Jackson\u2019s rule for one-machine scheduling: Making a good heuristic. Operations Research, 17, 22\u201335.","journal-title":"Operations Research"},{"issue":"1","key":"3267_CR27","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1007\/s10479-009-0657-6","volume":"175","author":"P Hansen","year":"2010","unstructured":"Hansen, P., Mladenovi\u0107, N., & P\u00e9rez, J. A. M. (2010). Variable neighbourhood search: Methods and applications. Annals of Operations Research, 175(1), 367\u2013407.","journal-title":"Annals of Operations Research"},{"issue":"3","key":"3267_CR28","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1007\/s13675-016-0075-x","volume":"5","author":"P Hansen","year":"2017","unstructured":"Hansen, P., Mladenovi\u0107, N., Todosijevi\u0107, R., & Hanafi, S. (2017). Variable neighborhood search: Basics and variants. EURO Journal on Computational Optimization, 5(3), 423\u2013454.","journal-title":"EURO Journal on Computational Optimization"},{"issue":"3","key":"3267_CR29","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/j.tcs.2006.04.014","volume":"363","author":"Y He","year":"2006","unstructured":"He, Y., Zhong, W., & Gu, H. (2006). Improved algorithms for two single machine scheduling problems. Theoretical Computer Science, 363(3), 257\u2013265.","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"3267_CR30","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1137\/S0895480196296823","volume":"13","author":"J Hoogeveen","year":"2000","unstructured":"Hoogeveen, J., & Vestjens, A. P. (2000). A best possible deterministic on-line algorithm for minimizing maximum delivery time on a single machine. SIAM Journal on Discrete Mathematics, 13(1), 56\u201363.","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"3267_CR31","unstructured":"Jackson, J. R. (1955). Scheduling a production line to minimize maximum tardiness. Management Science Research Project."},{"issue":"1","key":"3267_CR32","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1002\/(SICI)1520-6750(199702)44:1<109::AID-NAV7>3.0.CO;2-E","volume":"44","author":"C Koulamas","year":"1997","unstructured":"Koulamas, C. (1997). Decomposition and hybrid simulated annealing heuristics for the parallel-machine total tardiness problem. Naval Research Logistics (NRL), 44(1), 109\u2013125.","journal-title":"Naval Research Logistics (NRL)"},{"issue":"2","key":"3267_CR33","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1016\/j.ijpe.2010.03.016","volume":"126","author":"C Koulamas","year":"2010","unstructured":"Koulamas, C., & Kyparisis, G. J. (2010). Single-machine scheduling problems with past-sequence-dependent delivery times. International Journal of Production Economics, 126(2), 264\u2013266.","journal-title":"International Journal of Production Economics"},{"issue":"1","key":"3267_CR34","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1002\/1099-1425(200101\/02)4:1<3::AID-JOS57>3.0.CO;2-D","volume":"4","author":"CY Lee","year":"2001","unstructured":"Lee, C. Y., & Chen, Z. L. (2001). Machine scheduling with transportation considerations. Journal of Scheduling, 4(1), 3\u201324.","journal-title":"Journal of Scheduling"},{"issue":"1","key":"3267_CR35","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/j.ejor.2003.11.022","volume":"164","author":"CL Li","year":"2005","unstructured":"Li, C. L., Vairaktarakis, G., & Lee, C. Y. (2005). Machine scheduling with deliveries to multiple customer locations. European Journal of Operational Research, 164(1), 39\u201351.","journal-title":"European Journal of Operational Research"},{"issue":"12","key":"3267_CR36","doi-asserted-by":"crossref","first-page":"1777","DOI":"10.1016\/S0305-0548(02)00105-3","volume":"30","author":"CF Liaw","year":"2003","unstructured":"Liaw, C. F., Lin, Y. K., Cheng, C.-Y., & Chen, M. (2003). Scheduling unrelated parallel machines to minimize total weighted tardiness. Computers & Operations Research, 30(12), 1777\u20131789.","journal-title":"Computers & Operations Research"},{"key":"3267_CR37","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/s00170-013-4766-7","volume":"67","author":"CW Lin","year":"2013","unstructured":"Lin, C. W., Lin, Y. K., & Hsieh, H. T. (2013). Ant colony optimization for unrelated parallel machine scheduling. International Journal of Advanced Manufacturing Technology, 67, 35\u201345.","journal-title":"International Journal of Advanced Manufacturing Technology"},{"issue":"6","key":"3267_CR38","doi-asserted-by":"crossref","first-page":"901","DOI":"10.1016\/j.cor.2010.08.018","volume":"38","author":"YK Lin","year":"2011","unstructured":"Lin, Y. K., Pfund, M. E., & Fowler, J. W. (2011). Heuristics for minimizing regular performance measures in unrelated parallel machine scheduling problems. Computers & Operations Research, 38(6), 901\u2013916.","journal-title":"Computers & Operations Research"},{"key":"3267_CR39","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/j.tcs.2012.03.009","volume":"438","author":"M Liu","year":"2012","unstructured":"Liu, M., Zheng, F., Chu, C., & Xu, Y. (2012). New results on single-machine scheduling with past-sequence-dependent delivery times. Theoretical Computer Science, 438, 55\u201361.","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"3267_CR40","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1016\/j.tcs.2010.09.025","volume":"412","author":"P Liu","year":"2011","unstructured":"Liu, P., & Lu, X. (2011). An improved approximation algorithm for single machine scheduling with job delivery. Theoretical Computer Science, 412(3), 270\u2013274.","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"3267_CR41","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1007\/s10878-014-9760-y","volume":"30","author":"P Liu","year":"2015","unstructured":"Liu, P., & Lu, X. (2015). Online scheduling on two parallel machines with release dates and delivery times. Journal of Combinatorial Optimization, 30(2), 347\u2013359.","journal-title":"Journal of Combinatorial Optimization"},{"issue":"01","key":"3267_CR42","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1142\/S0217595908001596","volume":"25","author":"L Lu","year":"2008","unstructured":"Lu, L., & Yuan, J. (2008a). Single machine scheduling with job delivery to minimize makespan. Asia-Pacific Journal of Operational Research, 25(01), 1\u201310.","journal-title":"Asia-Pacific Journal of Operational Research"},{"issue":"4","key":"3267_CR43","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1016\/j.orl.2008.01.006","volume":"36","author":"L Lu","year":"2008","unstructured":"Lu, L., & Yuan, J. (2008b). Unbounded parallel batch scheduling with job delivery to minimize makespan. Operations Research Letters, 36(4), 477\u2013480.","journal-title":"Operations Research Letters"},{"issue":"1","key":"3267_CR44","first-page":"6","volume":"12","author":"P Maggu","year":"1980","unstructured":"Maggu, P., & Das, G. (1980). On 2$$\\times $$ n sequencing problem with transportation times of jobs. Pure and Applied Mathematika Sciences, 12(1), 6.","journal-title":"Pure and Applied Mathematika Sciences"},{"issue":"3","key":"3267_CR45","doi-asserted-by":"crossref","first-page":"1030","DOI":"10.1080\/00207543.2017.1351634","volume":"56","author":"M Mateo","year":"2018","unstructured":"Mateo, M., Teghem, J., & Tuyttens, D. (2018). A bi-objective parallel machine problem with eligibility, release dates and delivery times of the jobs. International Journal of Production Research, 56(3), 1030\u20131053.","journal-title":"International Journal of Production Research"},{"issue":"11","key":"3267_CR46","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N Mladenovi\u0107","year":"1997","unstructured":"Mladenovi\u0107, N., & Hansen, P. (1997). Variable neighborhood search. Computers & Operations Research, 24(11), 1097\u20131100.","journal-title":"Computers & Operations Research"},{"key":"3267_CR47","doi-asserted-by":"crossref","unstructured":"M\u00f6nch, L. (2008). Heuristics to minimize total weighted tardiness of jobs on unrelated parallel machines. In Proceedings of the 4th IEEE conference on automation science and engineering, pp 572\u2013577.","DOI":"10.1109\/COASE.2008.4626531"},{"key":"3267_CR48","first-page":"177","volume":"1","author":"P Moscato","year":"1992","unstructured":"Moscato, P., & Norman, M. G. (1992). A memetic approach for the traveling salesman problem implementation of a computational ecology for combinatorial optimization on message-passing systems. Parallel Computing and Transputer Applications, 1, 177\u2013186.","journal-title":"Parallel Computing and Transputer Applications"},{"issue":"3","key":"3267_CR49","doi-asserted-by":"crossref","first-page":"304","DOI":"10.1016\/0377-2217(93)90241-E","volume":"70","author":"S Panwalkar","year":"1993","unstructured":"Panwalkar, S., Smith, M., & Koulamas, C. (1993). A heuristic for the single machine tardiness problem. European Journal of Operational Research, 70(3), 304\u2013310.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"3267_CR50","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/j.ejor.2014.11.034","volume":"244","author":"J Pei","year":"2015","unstructured":"Pei, J., Pardalos, P. M., Liu, X., Fan, W., & Yang, S. (2015). Serial batching scheduling of deteriorating jobs in a two-stage supply chain to minimize the makespan. European Journal of Operational Research, 244(1), 13\u201325.","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"3267_CR51","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1080\/10170660409509404","volume":"21","author":"M Pfund","year":"2004","unstructured":"Pfund, M., Fowler, J. W., & Gupta, J. N. (2004). A survey of algorithms for single and multi-objective unrelated parallel-machine deterministic scheduling problems. Journal of the Chinese Institute of Industrial Engineers, 21(3), 230\u2013241.","journal-title":"Journal of the Chinese Institute of Industrial Engineers"},{"issue":"6","key":"3267_CR52","doi-asserted-by":"crossref","first-page":"1436","DOI":"10.1287\/opre.28.6.1436","volume":"28","author":"CN Potts","year":"1980","unstructured":"Potts, C. N. (1980). Analysis of a heuristic for one machine sequencing with release dates and delivery times. Operations Research, 28(6), 1436\u20131441.","journal-title":"Operations Research"},{"issue":"5","key":"3267_CR53","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/0167-6377(82)90035-9","volume":"1","author":"CN Potts","year":"1982","unstructured":"Potts, C. N., & Van Wassenhove, L. (1982). A decomposition algorithm for the single machine total tardiness problem. Operations Research Letters, 1(5), 177\u2013181.","journal-title":"Operations Research Letters"},{"key":"3267_CR54","doi-asserted-by":"crossref","unstructured":"Radcliffe, N. J., & Surry, P. D. (1994). Formal memetic algorithms. In AISB workshop on evolutionary computing, pp 1\u201316.","DOI":"10.1007\/3-540-58483-8_1"},{"issue":"1","key":"3267_CR55","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/j.ejor.2005.09.038","volume":"177","author":"SO Shim","year":"2007","unstructured":"Shim, S. O., & Kim, Y. D. (2007). Scheduling on parallel identical machines to minimize total tardiness. European Journal of Operational Research, 177(1), 135\u2013146.","journal-title":"European Journal of Operational Research"},{"issue":"9\u201310","key":"3267_CR56","doi-asserted-by":"crossref","first-page":"986","DOI":"10.1007\/s00170-008-1544-z","volume":"41","author":"N Srinivasa Raghavan","year":"2009","unstructured":"Srinivasa Raghavan, N., & Venkataramana, M. (2009). Parallel processor scheduling for minimizing total weighted tardiness using ant colony optimization. The International Journal of Advanced Manufacturing Technology, 41(9\u201310), 986\u2013996.","journal-title":"The International Journal of Advanced Manufacturing Technology"},{"issue":"27\u201329","key":"3267_CR57","first-page":"2581","volume":"410","author":"CS Su","year":"2009","unstructured":"Su, C. S., Pan, J. C. H., & Hsu, T. S. (2009). A new heuristic algorithm for the machine scheduling problem with job delivery coordination. Theoretical Computer Science, 410(27\u201329), 2581\u20132591.","journal-title":"Theoretical Computer Science"},{"issue":"6","key":"3267_CR58","doi-asserted-by":"crossref","first-page":"1900","DOI":"10.1016\/j.cor.2008.06.007","volume":"36","author":"MF Tasgetiren","year":"2009","unstructured":"Tasgetiren, M. F., Pan, Q. K., & Liang, Y. C. (2009). A discrete differential evolution algorithm for the single machine total weighted tardiness problem with sequence dependent setup times. Computers & Operations Research, 36(6), 1900\u20131915.","journal-title":"Computers & Operations Research"},{"issue":"1\u20133","key":"3267_CR59","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/j.tcs.2006.12.001","volume":"374","author":"J Tian","year":"2007","unstructured":"Tian, J., Fu, R., & Yuan, J. (2007). On-line scheduling with delivery time on a single batch machine. Theoretical Computer Science, 374(1\u20133), 49\u201357.","journal-title":"Theoretical Computer Science"},{"issue":"1\u20133","key":"3267_CR60","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/j.tcs.2007.11.006","volume":"393","author":"J Tian","year":"2008","unstructured":"Tian, J., Fu, R., & Yuan, J. (2008). A best on-line algorithm for single machine scheduling with small delivery times. Theoretical Computer Science, 393(1\u20133), 287\u2013293.","journal-title":"Theoretical Computer Science"},{"issue":"21\u201322","key":"3267_CR61","doi-asserted-by":"crossref","first-page":"1048","DOI":"10.1016\/j.ipl.2011.08.003","volume":"111","author":"J Tian","year":"2011","unstructured":"Tian, J., Fu, R., & Yuan, J. (2011). An on-line algorithm for the single machine unbounded parallel-batching scheduling with large delivery times. Information Processing Letters, 111(21\u201322), 1048\u20131053.","journal-title":"Information Processing Letters"},{"issue":"7\u20138","key":"3267_CR62","doi-asserted-by":"crossref","first-page":"1191","DOI":"10.1016\/j.dam.2011.12.002","volume":"160","author":"J Tian","year":"2012","unstructured":"Tian, J., Cheng, T., Ng, C., & Yuan, J. (2012). An improved on-line algorithm for single parallel-batch machine scheduling with delivery times. Discrete Applied Mathematics, 160(7\u20138), 1191\u20131210.","journal-title":"Discrete Applied Mathematics"},{"issue":"8","key":"3267_CR63","doi-asserted-by":"crossref","first-page":"1035","DOI":"10.1287\/mnsc.33.8.1035","volume":"33","author":"AP Vepsalainen","year":"1987","unstructured":"Vepsalainen, A. P., & Morton, T. E. (1987). Priority rules for job shops with weighted tardiness costs. Management Science, 33(8), 1035\u20131047.","journal-title":"Management Science"},{"issue":"1","key":"3267_CR64","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1002\/nav.20175","volume":"54","author":"X Wang","year":"2007","unstructured":"Wang, X., & Cheng, T. E. (2007). Machine scheduling with an availability constraint and job delivery coordination. Naval Research Logistics (NRL), 54(1), 11\u201320.","journal-title":"Naval Research Logistics (NRL)"},{"issue":"6","key":"3267_CR65","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1007\/BF01213203","volume":"31","author":"GJ Woeginger","year":"1994","unstructured":"Woeginger, G. J. (1994). Heuristics for parallel machine scheduling with delivery times. Acta Informatica, 31(6), 503\u2013512.","journal-title":"Acta Informatica"},{"issue":"4","key":"3267_CR66","doi-asserted-by":"crossref","first-page":"564","DOI":"10.1016\/j.jmsy.2013.04.008","volume":"32","author":"D Wu","year":"2013","unstructured":"Wu, D., Greer, M. J., Rosen, D. W., & Schaefer, D. (2013). Cloud manufacturing: Strategic vision and state-of-the-art. Journal of Manufacturing Systems, 32(4), 564\u2013579.","journal-title":"Journal of Manufacturing Systems"},{"key":"3267_CR67","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.cad.2014.07.006","volume":"59","author":"D Wu","year":"2015","unstructured":"Wu, D., Rosen, D. W., Wang, L., & Schaefer, D. (2015). Cloud-based design and manufacturing: A new paradigm in digital manufacturing and design innovation. Computer-Aided Design, 59, 1\u201314.","journal-title":"Computer-Aided Design"},{"issue":"3","key":"3267_CR68","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1007\/s10951-013-0351-z","volume":"17","author":"H Xu","year":"2014","unstructured":"Xu, H., L\u00fc, Z., & Cheng, T. (2014). Iterated local search for single-machine scheduling with sequence-dependent setup times to minimize total weighted tardiness. Journal of Scheduling, 17(3), 271\u2013287.","journal-title":"Journal of Scheduling"},{"issue":"1","key":"3267_CR69","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/j.rcim.2011.07.002","volume":"28","author":"X Xu","year":"2012","unstructured":"Xu, X. (2012). From cloud computing to cloud manufacturing. Robotics and Computer-Integrated Manufacturing, 28(1), 75\u201386.","journal-title":"Robotics and Computer-Integrated Manufacturing"},{"issue":"3","key":"3267_CR70","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/S0925-5273(01)00175-X","volume":"76","author":"F Yalaoui","year":"2002","unstructured":"Yalaoui, F., & Chu, C. (2002). Parallel machine scheduling to minimize total tardiness. International Journal of Production Economics, 76(3), 265\u2013279.","journal-title":"International Journal of Production Economics"},{"issue":"2","key":"3267_CR71","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1007\/s10878-007-9108-y","volume":"17","author":"J Yuan","year":"2009","unstructured":"Yuan, J., Li, S., Tian, J., & Fu, R. (2009). A best on-line algorithm for the single machine parallel-batch scheduling with restricted delivery times. Journal of Combinatorial Optimization, 17(2), 206\u2013213.","journal-title":"Journal of Combinatorial Optimization"},{"issue":"2","key":"3267_CR72","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1080\/17517575.2012.683812","volume":"8","author":"L Zhang","year":"2014","unstructured":"Zhang, L., Luo, Y., Tao, F., Li, B. H., Ren, L., Zhang, X., et al. (2014). Cloud manufacturing: A new manufacturing paradigm. Enterprise Information Systems, 8(2), 167\u2013187.","journal-title":"Enterprise Information Systems"},{"issue":"3","key":"3267_CR73","doi-asserted-by":"crossref","first-page":"1057","DOI":"10.1016\/j.ejor.2006.09.059","volume":"182","author":"W Zhong","year":"2007","unstructured":"Zhong, W., D\u00f3sa, G., & Tan, Z. (2007). On the machine scheduling problem with job delivery coordination. European Journal of Operational Research, 182(3), 1057\u20131072.","journal-title":"European Journal of Operational Research"},{"key":"3267_CR74","doi-asserted-by":"crossref","unstructured":"Zhou, H., Li, Z., & Wu, X. (2007). Scheduling unrelated parallel machine to minimize total weighted tardiness using ant colony optimization. In Proceedings of the 2007 IEEE international conference on automation and logistics. IEEE, pp. 132\u2013136.","DOI":"10.1109\/ICAL.2007.4338544"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-019-03267-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-019-03267-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-019-03267-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,8]],"date-time":"2020-05-08T19:19:43Z","timestamp":1588965583000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-019-03267-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,5,10]]},"references-count":74,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2020,2]]}},"alternative-id":["3267"],"URL":"https:\/\/doi.org\/10.1007\/s10479-019-03267-2","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"type":"print","value":"0254-5330"},{"type":"electronic","value":"1572-9338"}],"subject":[],"published":{"date-parts":[[2019,5,10]]},"assertion":[{"value":"10 May 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}