{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,22]],"date-time":"2025-11-22T10:58:35Z","timestamp":1763809115114},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2012,3,6]],"date-time":"2012-03-06T00:00:00Z","timestamp":1330992000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2012,8]]},"DOI":"10.1007\/s10732-012-9199-1","type":"journal-article","created":{"date-parts":[[2012,3,6]],"date-time":"2012-03-06T01:06:49Z","timestamp":1330996009000},"page":"571-591","source":"Crossref","is-referenced-by-count":7,"title":["A novel ant colony optimization approach for on-line scheduling and due date determination"],"prefix":"10.1007","volume":"18","author":[{"given":"Yun-Chia","family":"Liang","sequence":"first","affiliation":[]},{"given":"Zu-Hsu","family":"Lee","sequence":"additional","affiliation":[]},{"given":"Yu-Shen","family":"Chen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,3,6]]},"reference":[{"issue":"2","key":"9199_CR1","first-page":"125","volume":"8","author":"A. Bauer","year":"2000","unstructured":"Bauer, A., Bullnheimer, B., Hartl, R.F., Strauss, C.: Minimizing total tardiness on a single machine using ant colony optimization. Cent. Eur. J. Oper. Res. 8(2), 125\u2013141 (2000)","journal-title":"Cent. Eur. J. Oper. Res."},{"issue":"3","key":"9199_CR2","doi-asserted-by":"crossref","first-page":"464","DOI":"10.1287\/opre.1060.0270","volume":"54","author":"C.F. Chou","year":"2006","unstructured":"Chou, C.F., Liu, H., Queyranne, M., Simchi-Levi, D.: On the asymptotic optimality of a single on-line algorithm for the stochastic single machine weighted completion time problem and its extensions. Oper. Res. 54(3), 464\u2013474 (2006)","journal-title":"Oper. Res."},{"issue":"1","key":"9199_CR3","first-page":"39","volume":"34","author":"A. Colorni","year":"1994","unstructured":"Colorni, A., Dorigo, M., Maniezzo, V., Trubian, M.: Ant system for job-shop scheduling. Belg. J. Oper. Res. Stat. Comput. Sci. 34(1), 39\u201353 (1994)","journal-title":"Belg. J. Oper. Res. Stat. Comput. Sci."},{"key":"9199_CR4","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"611","DOI":"10.1007\/3-540-45356-3_60","volume-title":"Proc. 6th Int. Conf. on Parallel Problem Solving from Nature (PPSN VI)","author":"M. Besten Den","year":"2000","unstructured":"Den Besten, M., St\u00fctzle, T., Dorigo, M.: Ant colony optimization for the total weighted tardiness problem. In: Proc. 6th Int. Conf. on Parallel Problem Solving from Nature (PPSN VI). LNCS, vol.\u00a01917, pp.\u00a0611\u2013620. Springer, Berlin (2000)"},{"issue":"1","key":"9199_CR5","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1109\/4235.585892","volume":"1","author":"M. Dorigo","year":"1997","unstructured":"Dorigo, M., Gambardella, L.M.: Ant colony system: A cooperative learning approach to the travelling salesman problem. IEEE Trans. Evol. Comput. 1(1), 53\u201366 (1997)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"3","key":"9199_CR6","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1287\/ijoc.12.3.237.12636","volume":"12","author":"L.M. Gambardella","year":"2000","unstructured":"Gambardella, L.M., Dorigo, M.: An ant colony system hybridized with a new local search for the sequential ordering problem. INFORMS J. Comput. 12(3), 237\u2013255 (2000)","journal-title":"INFORMS J. Comput."},{"key":"9199_CR7","first-page":"63","volume-title":"New Ideas in Optimization","author":"L.M. Gambardella","year":"1999","unstructured":"Gambardella, L.M., Taillard, E., Agazzi, G.: MACS-VRPTW: A multiple ant colony system for vehicle routing problems with time windows. In: Corne, D., Dorigo, M., Glover, F. (eds.) New Ideas in Optimization, pp. 63\u201376. McGraw-Hill, New York (1999)"},{"key":"9199_CR8","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1287\/moor.10.2.328","volume":"10","author":"P.G. Gazmuri","year":"1985","unstructured":"Gazmuri, P.G.: Probabilistic analysis of a machine scheduling problem. Math. Oper. Res. 10, 328\u2013339 (1985)","journal-title":"Math. Oper. Res."},{"key":"9199_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1155\/JAMDS\/2006\/95060","volume":"2006","author":"K. Ghoseiri","year":"2006","unstructured":"Ghoseiri, K., Morshedsolouk, F.: ACS-TS: Train scheduling using ant colony system. J. Appl. Math. Decis. Sci. 2006, 1\u201328 (2006)","journal-title":"J. Appl. Math. Decis. Sci."},{"key":"9199_CR10","series-title":"LNCS","first-page":"111","volume-title":"Proc. 3rd Int. Workshop on Ant Algorithms (ANTS 02)","author":"M. Guntsch","year":"2002","unstructured":"Guntsch, M., Middendorf, M.: Applying population based ACO to dynamic optimization problems. In: Proc. 3rd Int. Workshop on Ant Algorithms (ANTS 02). LNCS, vol.\u00a02463, pp. 111\u2013122. Springer, Berlin (2002)"},{"key":"9199_CR11","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/s00170-007-1203-9","volume":"39","author":"R.H. Huang","year":"2008","unstructured":"Huang, R.H., Yang, C.L.: Ant colony system for job shop scheduling with time windows. Int. J. Adv. Manuf. Technol. 39, 151\u2013157 (2008)","journal-title":"Int. J. Adv. Manuf. Technol."},{"issue":"3","key":"9199_CR12","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/s10951-008-0053-0","volume":"11","author":"P. Kaminsky","year":"2008","unstructured":"Kaminsky, P., Lee, Z.: Effective on-line algorithms for reliable due date quotation and large-scale scheduling. J. Sched. 11(3), 187\u2013204 (2008)","journal-title":"J. Sched."},{"issue":"1\/2","key":"9199_CR13","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1504\/IJOR.2008.016160","volume":"3","author":"Z. Lee","year":"2008","unstructured":"Lee, Z.: On-line MTO lead-time scheduling: a probabilistic approach. Int. J. Oper. Res. 3(1\/2), 183\u2013220 (2008)","journal-title":"Int. J. Oper. Res."},{"key":"9199_CR14","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/S0167-5060(08)70743-X","volume":"1","author":"J.K. Lenstra","year":"1977","unstructured":"Lenstra, J.K., Kan, A.H.G., Brucker, P.: Complexity of machine scheduling problems. Ann. Discrete Math.\u00a01, 343\u2013362 (1977)","journal-title":"Ann. Discrete Math."},{"key":"9199_CR15","doi-asserted-by":"crossref","DOI":"10.1201\/9780203489802","volume-title":"Handbook of Scheduling: Algorithms, Models, and Performance Analysis","author":"J. Leung","year":"2004","unstructured":"Leung, J., Anderson, J.: Handbook of Scheduling: Algorithms, Models, and Performance Analysis. CRC Press, Boca Raton (2004)"},{"issue":"3","key":"9199_CR16","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1109\/TR.2004.832816","volume":"53","author":"Y.C. Liang","year":"2004","unstructured":"Liang, Y.C., Smith, A.E.: An ant colony optimization algorithm for the redundancy allocation problem (RAP). IEEE Trans. Reliab. 53(3), 417\u2013423 (2004)","journal-title":"IEEE Trans. Reliab."},{"issue":"5","key":"9199_CR17","first-page":"403","volume":"23","author":"Y.C. Liang","year":"2006","unstructured":"Liang, Y.C., Smith, A.E.: An ant colony approach to the orienteering problem. J. Chin. Inst. Ind. Eng. 23(5), 403\u2013414 (2006)","journal-title":"J. Chin. Inst. Ind. Eng."},{"issue":"1","key":"9199_CR18","first-page":"20","volume":"28","author":"Y.C. Liang","year":"2011","unstructured":"Liang, Y.C., Yin, Y.C.: Optimal multilevel thresholding using a hybrid ant colony system. J. Chin. Inst. Ind. Eng. 28(1), 20\u201333 (2011)","journal-title":"J. Chin. Inst. Ind. Eng."},{"key":"9199_CR19","first-page":"600","volume-title":"Proc 8th Annual Int. Conf. on Industrial Engineering\u2014Theory, Applications and Practice (IJIE2003)","author":"Y.C. Liang","year":"2003","unstructured":"Liang, Y.C., Lo, M.H., Chen, A.H.L.: An ant colony approach for the vehicle routing problem under distance and capacity constraints. In: Proc 8th Annual Int. Conf. on Industrial Engineering\u2014Theory, Applications and Practice (IJIE2003), Las Vegas, Nevada, pp. 600\u2013605 (2003)"},{"key":"9199_CR20","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"1183","DOI":"10.1007\/11893257_129","volume-title":"Proc. 13th Int. Conf. on Neural Information Processing (ICONIP2006)","author":"Y.C. Liang","year":"2006","unstructured":"Liang, Y.C., Chen, A.H.L., Chyu, C.C.: Application of a hybrid ant colony optimization for the multilevel thresholding in image processing. In: Proc. 13th Int. Conf. on Neural Information Processing (ICONIP2006). LNCS, vol.\u00a04233, pp. 1183\u20131192. Springer, Berlin (2006),"},{"key":"9199_CR21","first-page":"2816","volume-title":"Proc 36th Int. Conf. on Computers and Industrial Engineering (CIE2006)","author":"Y.C. Liang","year":"2006","unstructured":"Liang, Y.C., Smith, A.E., Hung, C.R.: Ant colony optimization for bi-objective single machine scheduling. In: Proc 36th Int. Conf. on Computers and Industrial Engineering (CIE2006), Taipei, Taiwan, pp.\u00a02816\u20132827 (2006)"},{"issue":"5","key":"9199_CR22","doi-asserted-by":"crossref","first-page":"769","DOI":"10.1109\/69.806935","volume":"11","author":"V. Maniezzo","year":"1999","unstructured":"Maniezzo, V., Colorni, A.: The ant system applied to the quadratic assignment problem. IEEE Trans. Knowl. Data Eng. 11(5), 769\u2013778 (1999)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"5","key":"9199_CR23","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1080\/00207720500062306","volume":"36","author":"D. Merkle","year":"2005","unstructured":"Merkle, D., Middendorf, M.: On solving permutation scheduling problems with ant colony optimization. Int. J. Syst. Sci. 36(5), 255\u2013266 (2005)","journal-title":"Int. J. Syst. Sci."},{"issue":"3","key":"9199_CR24","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1023\/A:1015057701750","volume":"8","author":"M. Middendorf","year":"2002","unstructured":"Middendorf, M., Reischle, F., Schmeck, H.: Multi colony ant algorithms. J. Heuristics 8(3), 305\u2013320 (2002)","journal-title":"J. Heuristics"},{"issue":"4","key":"9199_CR25","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1007\/s10878-005-4922-6","volume":"10","author":"R. Montemanni","year":"2005","unstructured":"Montemanni, R., Gambardella, L.M., Rizzoli, A.E., Donati, A.V.: Ant colony system for a dynamic vehicle routing problem. J. Comb. Optim. 10(4), 327\u2013343 (2005)","journal-title":"J. Comb. Optim."},{"key":"9199_CR26","first-page":"33","volume-title":"New Ideas in Optimization","author":"T. St\u00fctzle","year":"1999","unstructured":"St\u00fctzle, T., Dorigo, M.: ACO algorithms for the quadratic assignment problem. In: Corne, D., Dorigo, M., Glover, F. (eds.) New Ideas in Optimization, pp. 33\u201350. McGraw-Hill, New York (1999)"},{"key":"9199_CR27","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/j.engappai.2007.03.008","volume":"21","author":"W. Xiang","year":"2008","unstructured":"Xiang, W., Lee, H.P.: Ant colony intelligence in multi-agent dynamic manufacturing scheduling. Eng. Appl. Artif. Intell. 21, 73\u201385 (2008)","journal-title":"Eng. Appl. Artif. Intell."}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-012-9199-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10732-012-9199-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-012-9199-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T12:47:58Z","timestamp":1641041278000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10732-012-9199-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,3,6]]},"references-count":27,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2012,8]]}},"alternative-id":["9199"],"URL":"https:\/\/doi.org\/10.1007\/s10732-012-9199-1","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,3,6]]}}}