{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T10:11:14Z","timestamp":1725876674760},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319516905"},{"type":"electronic","value":"9783319516912"}],"license":[{"start":{"date-parts":[[2016,12,27]],"date-time":"2016-12-27T00:00:00Z","timestamp":1482796800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-51691-2_23","type":"book-chapter","created":{"date-parts":[[2016,12,26]],"date-time":"2016-12-26T15:23:38Z","timestamp":1482765818000},"page":"266-278","source":"Crossref","is-referenced-by-count":8,"title":["Resource Constrained Job Scheduling with Parallel Constraint-Based ACO"],"prefix":"10.1007","author":[{"given":"Dror","family":"Cohen","sequence":"first","affiliation":[]},{"given":"Antonio","family":"G\u00f3mez-Iglesias","sequence":"additional","affiliation":[]},{"given":"Dhananjay","family":"Thiruvady","sequence":"additional","affiliation":[]},{"given":"Andreas T.","family":"Ernst","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,12,27]]},"reference":[{"key":"23_CR1","doi-asserted-by":"crossref","unstructured":"Amdahl, G.M.: Validity of the single processor approach to achieving large scale computing capabilities. In: Proceedings of the April 18\u201320, 1967, Spring Joint Computer Conference, AFIPS 1967 (Spring), pp. 483\u2013485. ACM, New York (1967)","DOI":"10.1145\/1465482.1465560"},{"key":"23_CR2","doi-asserted-by":"crossref","first-page":"6231","DOI":"10.1080\/00207540701420560","volume":"46","author":"F Ballest\u00edn","year":"2008","unstructured":"Ballest\u00edn, F., Trautmann, N.: An iterated-local-search heuristic for the resource-constrained weighted earliness-tardiness project scheduling problem. Int. J. Prod. Res. 46, 6231\u20136249 (2008)","journal-title":"Int. J. Prod. Res."},{"key":"23_CR3","doi-asserted-by":"crossref","first-page":"1565","DOI":"10.1016\/j.cor.2003.11.018","volume":"32","author":"C Blum","year":"2005","unstructured":"Blum, C.: Beam-ACO: hybridizing ant colony optimization with beam search: an application to open shop scheduling. Comput. Oper. Res. 32, 1565\u20131591 (2005)","journal-title":"Comput. Oper. Res."},{"key":"23_CR4","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1145\/937503.937505","volume":"35","author":"C Blum","year":"2003","unstructured":"Blum, C., Roli, A.: Metaheuristics in combinatorial optimization: overview and conceptual comparison. ACM Comput. Surv. 35, 268\u2013308 (2003)","journal-title":"ACM Comput. Surv."},{"key":"23_CR5","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0377-2217(98)00204-5","volume":"112","author":"P Brucker","year":"1999","unstructured":"Brucker, P., Drexl, A., Mohring, R., Neumann, K., Pesch, E.: Resource-constrained project scheduling: notation, classification, models, and methods. Eur. J. Oper. Res. 112, 3\u201341 (1999)","journal-title":"Eur. J. Oper. Res."},{"key":"23_CR6","volume-title":"Using OpenMP: Portable Shared Memory Parallel Programming (Scientific and Engineering Computation)","author":"B Chapman","year":"2007","unstructured":"Chapman, B., Jost, G., van der Pas, R.: Using OpenMP: Portable Shared Memory Parallel Programming (Scientific and Engineering Computation). The MIT Press, Cambridge (2007)"},{"key":"23_CR7","unstructured":"Delisle, P., Krajecki, M., Gravel, M., Gagn\u00e9, C.: Parallel implementation of an ant colony optimization metaheuristic with OpenMP. In: Proceedings of the 3rd European Workshop on OpenMP of International Conference on Parallel Architectures and Compilation Techniques (EWOMP 2001) (2001)"},{"issue":"5","key":"23_CR8","doi-asserted-by":"crossref","first-page":"1248","DOI":"10.1016\/j.ins.2006.09.016","volume":"177","author":"I Ellabib","year":"2007","unstructured":"Ellabib, I., Calamai, P., Basir, O.: Exchange strategies for multiple ant colony system. Inf. Sci. 177(5), 1248\u20131264 (2007)","journal-title":"Inf. Sci."},{"key":"23_CR9","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/j.ins.2012.02.055","volume":"199","author":"C Ling","year":"2012","unstructured":"Ling, C., Hai-Ying, S., Shu, W.: A parallel ant colony algorithm on massively parallel processors and its convergence analysis for the travelling salesman problem. Inf. Sci. 199, 31\u201342 (2012). WOS: 000304221600003","journal-title":"Inf. Sci."},{"key":"23_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/978-3-642-01009-5_9","volume-title":"Evolutionary Computation in Combinatorial Optimization","author":"M L\u00f3pez-Ib\u00e1\u00f1ez","year":"2009","unstructured":"L\u00f3pez-Ib\u00e1\u00f1ez, M., Blum, C., Thiruvady, D., Ernst, A.T., Meyer, B.: Beam-ACO based on stochastic sampling for makespan optimization concerning the TSP with time windows. In: Cotta, C., Cowling, P. (eds.) EvoCOP 2009. LNCS, vol. 5482, pp. 97\u2013108. Springer, Heidelberg (2009). doi: 10.1007\/978-3-642-01009-5_9"},{"key":"23_CR11","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/5625.001.0001","volume-title":"Programming with Constraints","author":"K Marriott","year":"1998","unstructured":"Marriott, K., Stuckey, P.: Programming with Constraints. MIT Press, Cambridge (1998)"},{"issue":"8","key":"23_CR12","doi-asserted-by":"crossref","first-page":"5181","DOI":"10.1016\/j.asoc.2011.05.042","volume":"11","author":"M Pedemonte","year":"2011","unstructured":"Pedemonte, M., Nesmachnow, S., Cancela, H.: A survey on parallel ant colony optimization. Appl. Soft Comput. 11(8), 5181\u20135197 (2011)","journal-title":"Appl. Soft Comput."},{"issue":"9","key":"23_CR13","doi-asserted-by":"crossref","first-page":"1421","DOI":"10.1006\/jpdc.2002.1854","volume":"62","author":"M Randall","year":"2002","unstructured":"Randall, M., Lewis, A.: A parallel implementation of ant colony optimization. J. Parallel Distrib. Comput. 62(9), 1421\u20131432 (2002)","journal-title":"J. Parallel Distrib. Comput."},{"key":"23_CR14","unstructured":"Ravishankar, M.K.: Parallel implementation of fast beam search for speaker-independent continuous speech recognition (1993)"},{"issue":"5","key":"23_CR15","first-page":"363","volume":"39","author":"G Singh","year":"2011","unstructured":"Singh, G., Ernst, A.T.: Resource constraint scheduling with a fractional shared resource. Oper. Res. Lett. 39(5), 363\u2013368 (2011)","journal-title":"Oper. Res. Lett."},{"key":"23_CR16","volume-title":"A Concise Overview of Applications of Ant Colony Optimization","author":"T St\u0171tzle","year":"2010","unstructured":"St\u0171tzle, T., L\u00f3pez-Ib\u00e1\u00f1ez, M., Dorigo, M.: A Concise Overview of Applications of Ant Colony Optimization. Wiley, New York (2010)"},{"key":"23_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/978-3-642-04918-7_3","volume-title":"Hybrid Metaheuristics","author":"D Thiruvady","year":"2009","unstructured":"Thiruvady, D., Blum, C., Meyer, B., Ernst, A.: Hybridizing beam-ACO with constraint programming for single machine job scheduling. In: Blesa, M.J., Blum, C., Gaspero, L., Roli, A., Sampels, M., Schaerf, A. (eds.) HM 2009. LNCS, vol. 5818, pp. 30\u201344. Springer, Heidelberg (2009). doi: 10.1007\/978-3-642-04918-7_3"},{"key":"23_CR18","first-page":"1","volume":"242","author":"D Thiruvady","year":"2014","unstructured":"Thiruvady, D., Ernst, A.T., Singh, G.: Parallel ant colony optimization for resource constrained job scheduling. Ann. Oper. Res. 242, 1\u201318 (2014)","journal-title":"Ann. Oper. Res."},{"key":"23_CR19","doi-asserted-by":"crossref","unstructured":"Thiruvady, D., Meyer, B., Ernst, A.T.: Car sequencing with constraint-based ACO. In: Proceedings of the 13th Annual Conference on Genetic and Evolutionary Computation, GECCO 2011, pp. 163\u2013170. ACM, New York (2011)","DOI":"10.1145\/2001576.2001599"},{"issue":"1","key":"23_CR20","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1016\/j.ijpe.2012.06.012","volume":"141","author":"D Thiruvady","year":"2013","unstructured":"Thiruvady, D., Singh, G., Ernst, A.T., Meyer, B.: Constraint-based ACO for a shared resource constrained scheduling problem. Int. J. Prod. Econ. 141(1), 230\u2013242 (2013). Meta-heuristics for manufacturing scheduling and logistics problems","journal-title":"Int. J. Prod. Econ."},{"key":"23_CR21","doi-asserted-by":"crossref","first-page":"282","DOI":"10.1016\/S0377-2217(02)00768-3","volume":"149","author":"V Valls","year":"2003","unstructured":"Valls, V., Quintanilla, S., Ballest\u00edn, F.: Resource-constrained project scheduling: a critical activity reordering heuristic. Eur. J. Oper. Res. 149, 282\u2013301 (2003)","journal-title":"Eur. J. Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Artificial Life and Computational Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-51691-2_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,16]],"date-time":"2019-09-16T23:45:55Z","timestamp":1568677555000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-51691-2_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,12,27]]},"ISBN":["9783319516905","9783319516912"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-51691-2_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016,12,27]]}}}