{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T10:53:47Z","timestamp":1778496827627,"version":"3.51.4"},"reference-count":57,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2012,12,29]],"date-time":"2012-12-29T00:00:00Z","timestamp":1356739200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2013,7]]},"DOI":"10.1007\/s10479-012-1296-x","type":"journal-article","created":{"date-parts":[[2012,12,28]],"date-time":"2012-12-28T14:31:58Z","timestamp":1356705118000},"page":"265-296","source":"Crossref","is-referenced-by-count":19,"title":["Depth-first heuristic search for the job shop scheduling problem"],"prefix":"10.1007","volume":"206","author":[{"given":"Carlos","family":"Menc\u00eda","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mar\u00eda R.","family":"Sierra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ramiro","family":"Varela","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,12,29]]},"reference":[{"issue":"3","key":"1296_CR1","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/s10951-010-0162-4","volume":"14","author":"A. Agnetis","year":"2011","unstructured":"Agnetis, A., Flamini, M., Nicosia, G., & Pacifici, A. (2011). A job-shop problem with one additional resource type. Journal of Scheduling, 14(3), 225\u2013237.","journal-title":"Journal of Scheduling"},{"key":"1296_CR2","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1287\/ijoc.3.2.149","volume":"3","author":"D. Applegate","year":"1991","unstructured":"Applegate, D., & Cook, W. (1991). A computational study of the job-shop scheduling problem. ORSA Journal on Computing, 3, 149\u2013156.","journal-title":"ORSA Journal on Computing"},{"issue":"1","key":"1296_CR3","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1007\/s10479-007-0283-0","volume":"159","author":"C. Artigues","year":"2008","unstructured":"Artigues, C., & Feillet, D. (2008). A branch and bound method for the job-shop problem with sequence-dependent setup times. Annals of Operations Research, 159(1), 135\u2013159.","journal-title":"Annals of Operations Research"},{"key":"1296_CR4","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1007\/s10951-008-0067-7","volume":"11","author":"E. Balas","year":"2008","unstructured":"Balas, E., Simonetti, N., & Vazacopoulos, A. (2008). Job shop scheduling with setup times, deadlines and precedence constraints. Journal of Scheduling, 11, 253\u2013262.","journal-title":"Journal of Scheduling"},{"key":"1296_CR5","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-1479-4","volume-title":"Constraint-based scheduling","author":"P. Baptiste","year":"2001","unstructured":"Baptiste, P., Le Pape, C., & Nuijten, W. (2001). Constraint-based scheduling. Norwell: Kluwer Academic."},{"issue":"11","key":"1296_CR6","doi-asserted-by":"crossref","first-page":"1069","DOI":"10.1057\/jors.1990.166","volume":"41","author":"J. E. Beasley","year":"1990","unstructured":"Beasley, J. E. (1990). Or-library: distributing test problems by electronic mail. Journal of the Operational Research Society, 41(11), 1069\u20131072. http:\/\/www.jstor.org\/stable\/2582903 .","journal-title":"Journal of the Operational Research Society"},{"key":"1296_CR7","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1613\/jair.2169","volume":"29","author":"J. C. Beck","year":"2007","unstructured":"Beck, J. C. (2007). Solution-guided multi-point constructive search for job shop scheduling. The Journal of Artificial Intelligence Research, 29, 49\u201377.","journal-title":"The Journal of Artificial Intelligence Research"},{"issue":"1","key":"1296_CR8","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/S0004-3702(99)00099-5","volume":"117","author":"J. C. Beck","year":"2000","unstructured":"Beck, J. C., & Fox, M. S. (2000). Dynamic problem structure analysis as a basis for constraint-directed scheduling heuristics. Artificial Intelligence, 117(1), 31\u201381.","journal-title":"Artificial Intelligence"},{"issue":"1","key":"1296_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0377-2217(95)00362-2","volume":"93","author":"J. Blazewicz","year":"1996","unstructured":"Blazewicz, J., Domschke, W., & Pesch, E. (1996). The job shop scheduling problem: conventional and new solution techniques. European Journal of Operational Research, 93(1), 1\u201333.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"1296_CR10","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/S0377-2217(99)00486-5","volume":"127","author":"J. Blazewicz","year":"2000","unstructured":"Blazewicz, J., Pesch, E., & Sterna, M. (2000). The disjunctive graph machine representation of the job shop scheduling problem. European Journal of Operational Research, 127(2), 317\u2013331.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"1296_CR11","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1002\/1099-1425(200101\/02)4:1<53::AID-JOS59>3.0.CO;2-Y","volume":"4","author":"W. Brinkk\u00f6tter","year":"2001","unstructured":"Brinkk\u00f6tter, W., & Brucker, P. (2001). Solving open benchmark instances for the job-shop problem by parallel heads and tails adjustments. Journal of Scheduling, 4(1), 53\u201364.","journal-title":"Journal of Scheduling"},{"key":"1296_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-24804-0","volume-title":"Scheduling algorithms","author":"P. Brucker","year":"2004","unstructured":"Brucker, P. (2004). Scheduling algorithms (4th ed.). Berlin: Springer.","edition":"4"},{"key":"1296_CR13","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/BF01539706","volume":"18","author":"P. Brucker","year":"1996","unstructured":"Brucker, P., & Thiele, O. (1996). A branch and bound method for the general-job shop problem with sequence-dependent setup times. OR Spektrum, 18, 145\u2013161.","journal-title":"OR Spektrum"},{"key":"1296_CR14","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/0166-218X(94)90204-6","volume":"49","author":"P. Brucker","year":"1994","unstructured":"Brucker, P., Jurisch, B., & Sievers, B. (1994a). A branch and bound algorithm for the job-shop scheduling problem. Discrete Applied Mathematics, 49, 107\u2013127.","journal-title":"Discrete Applied Mathematics"},{"key":"1296_CR15","unstructured":"Brucker, P., Jurisch, B., & Sievers, B. (1994b). Source code of a branch & bound algorithm for the job shop scheduling problem. ftp:\/\/www.mathematik.uni-kl.de\/pub\/Math\/ORSEP\/BRUCKER2.ZIP ."},{"key":"1296_CR16","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1016\/S0377-2217(82)80007-6","volume":"11","author":"J. Carlier","year":"1982","unstructured":"Carlier, J. (1982). The one-machine sequencing problem. European Journal of Operational Research, 11, 42\u201347.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"1296_CR17","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1287\/mnsc.35.2.164","volume":"35","author":"J. Carlier","year":"1989","unstructured":"Carlier, J., & Pinson, E. (1989). An algorithm for solving the job-shop problem. Management Science, 35(2), 164\u2013176.","journal-title":"Management Science"},{"key":"1296_CR18","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF03543071","volume":"26","author":"J. Carlier","year":"1990","unstructured":"Carlier, J., & Pinson, E. (1990). A practical use of Jackson\u2019s preemptive schedule for solving the job shop problem. Annals of Operations Research, 26, 269\u2013287.","journal-title":"Annals of Operations Research"},{"key":"1296_CR19","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1007\/BF02023076","volume":"41","author":"M. Dell\u2019Amico","year":"1993","unstructured":"Dell\u2019Amico, M., & Trubian, M. (1993). Applying tabu search to the job-shop scheduling problem. Annals of Operations Research, 41, 231\u2013252.","journal-title":"Annals of Operations Research"},{"key":"1296_CR20","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/S0004-3702(00)00040-0","volume":"122","author":"U. Dorndorf","year":"2000","unstructured":"Dorndorf, U., Pesch, E., & Phan-Huy, T. (2000). Constraint propagation techniques for the disjunctive scheduling problem. Artificial Intelligence, 122, 189\u2013240.","journal-title":"Artificial Intelligence"},{"key":"1296_CR21","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1023\/A:1021197120431","volume":"115","author":"U. Dorndorf","year":"2002","unstructured":"Dorndorf, U., Pesch, E., & Phan-Huy, T. (2002). Constraint propagation and problem decomposition: a preprocessing procedure for the job shop problem. Annals of Operations Research, 115, 125\u2013145.","journal-title":"Annals of Operations Research"},{"key":"1296_CR22","doi-asserted-by":"crossref","first-page":"2044","DOI":"10.1016\/j.ins.2009.12.010","volume":"180","author":"S. Garcia","year":"2010","unstructured":"Garcia, S., Fern\u00e1ndez, A., Luengo, J., & Herrera, F. (2010). Advanced nonparametric tests for multiple comparisons in the design of experiments in computational intelligence and data mining: experimental analysis of power. Information Sciences, 180, 2044\u20132064.","journal-title":"Information Sciences"},{"key":"1296_CR23","volume-title":"Computers and intractability","author":"M. Garey","year":"1979","unstructured":"Garey, M., & Johnson, D. (1979). Computers and intractability. New York: Freeman."},{"key":"1296_CR24","doi-asserted-by":"crossref","first-page":"1057","DOI":"10.1016\/j.endm.2010.05.134","volume":"36","author":"A. Gharbi","year":"2010","unstructured":"Gharbi, A., & Labidi, M. (2010). Extending the single machine-based relaxation scheme for the job shop scheduling problem. Electronic Notes in Discrete Mathematics, 36, 1057\u20131064.","journal-title":"Electronic Notes in Discrete Mathematics"},{"key":"1296_CR25","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1287\/opre.8.4.487","volume":"8","author":"B. Giffler","year":"1960","unstructured":"Giffler, B., & Thompson, G. L. (1960). Algorithms for solving production scheduling problems. Operations Research, 8, 487\u2013503.","journal-title":"Operations Research"},{"key":"1296_CR26","author":"M. A. Gonz\u00e1lez","year":"2012","unstructured":"Gonz\u00e1lez, M. A., Vela, C. R., Gonz\u00e1lez-Rodr\u00edguez, I., & Varela, R. (2012). Lateness minimization with tabu search for job shop scheduling problem with sequence dependent setup times. Journal of Intelligent Manufacturing. doi: 10.1007\/s10845-011-0622-5 .","journal-title":"Journal of Intelligent Manufacturing"},{"issue":"3","key":"1296_CR27","doi-asserted-by":"crossref","first-page":"655","DOI":"10.1109\/TSMCA.2008.918603","volume":"38","author":"I. Gonz\u00e1lez-Rodr\u00edguez","year":"2008","unstructured":"Gonz\u00e1lez-Rodr\u00edguez, I., Puente, J., Vela, C. R., & Varela, R. (2008). Semantics of schedules for the fuzzy job shop problem. IEEE Transactions on Systems, Man and Cybernetics. Part A. Systems and Humans, 38(3), 655\u2013666.","journal-title":"IEEE Transactions on Systems, Man and Cybernetics. Part A. Systems and Humans"},{"key":"1296_CR28","volume-title":"Proceedings of ICAPS 2009","author":"I. Gonz\u00e1lez-Rodr\u00edguez","year":"2009","unstructured":"Gonz\u00e1lez-Rodr\u00edguez, I., Vela, C. R., Puente, J., & Hern\u00e1ndez-Arauzo, A. (2009). Improved local search for job shop scheduling with uncertain durations. In Proceedings of ICAPS 2009."},{"key":"1296_CR29","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"R. Graham","year":"1979","unstructured":"Graham, R., Lawler, E., Lenstra, J., & Kan, A. (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":"1296_CR30","author":"O. Guyon","year":"2012","unstructured":"Guyon, O., Lemaire, P., Pinson, E., & Rivreau, D. (2012). Solving an integrated job-shop problem with human resource constraints. Annals of Operations Research. doi: 10.1007\/s10479-012-1132-3 . 1\u201325.","journal-title":"Annals of Operations Research"},{"issue":"2","key":"1296_CR31","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","volume":"4","author":"P. Hart","year":"1968","unstructured":"Hart, P., Nilsson, N., & Raphael, B. (1968). A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems Science and Cybernetics, 4(2), 100\u2013107.","journal-title":"IEEE Transactions on Systems Science and Cybernetics"},{"key":"1296_CR32","first-page":"607","volume-title":"Proceedings of IJCAI 1995","author":"W. D. Harvey","year":"1995","unstructured":"Harvey, W. D., & Ginsberg, M. L. (1995). Limited discrepancy search. In Proceedings of IJCAI 1995 (Vol.\u00a01, pp. 607\u2013615)."},{"key":"1296_CR33","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0004-3702(85)90084-0","volume":"27","author":"R. E. Korf","year":"1985","unstructured":"Korf, R. E. (1985). Depth-first iterative-deepening: an optimal admissible tree search. Artificial Intelligence, 27, 97\u2013109.","journal-title":"Artificial Intelligence"},{"issue":"2","key":"1296_CR34","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/S0004-3702(02)00362-4","volume":"143","author":"P. Laborie","year":"2003","unstructured":"Laborie, P. (2003). Algorithms for propagating resource constraints in AI planning and scheduling: existing approaches and new results. Artificial Intelligence, 143(2), 151\u2013188.","journal-title":"Artificial Intelligence"},{"key":"1296_CR35","first-page":"389","volume-title":"Proceedings of IPCO 1996","author":"P. Martin","year":"1996","unstructured":"Martin, P., & Shmoys, D. B. (1996). A new approach to computing optimal schedules for the job-shop scheduling problem. In Proceedings of IPCO 1996 (pp. 389\u2013403)."},{"key":"1296_CR36","author":"S. Meeran","year":"2011","unstructured":"Meeran, S., & Morshed, M. S. (2011). A hybrid genetic tabu search algorithm for solving job shop scheduling problems: a case study. Journal of Intelligent Manufacturing. doi: 10.1007\/s10845-011-0520-x .","journal-title":"Journal of Intelligent Manufacturing"},{"key":"1296_CR37","first-page":"113","volume-title":"Proceedings of ICAPS 2010","author":"C. Menc\u00eda","year":"2010","unstructured":"Menc\u00eda, C., Sierra, M. R., & Varela, R. (2010). Partially informed depth-first search for the job shop problem. In Proceedings of ICAPS 2010 (pp. 113\u2013120)."},{"key":"1296_CR38","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1007\/978-3-642-21326-7_33","volume-title":"New challenges on bioinspired applications","author":"R. Menc\u00eda","year":"2011","unstructured":"Menc\u00eda, R., Sierra, M. R., Menc\u00eda, C., & Varela, R. (2011). Genetic algorithm for job-shop scheduling with operators. In LNCS: Vol.\u00a06687. New challenges on bioinspired applications (pp. 305\u2013314)."},{"issue":"1","key":"1296_CR39","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/s13748-011-0006-2","volume":"1","author":"P. Meseguer","year":"2012","unstructured":"Meseguer, P. (2012). Towards 40 years of constraint reasoning. Progress in Artificial Intelligence, 1(1), 25\u201343. doi: 10.1007\/s13748-011-0006-2 . url: http:\/\/dx.doi.org\/10.1007\/s13748-011-0006-2 .","journal-title":"Progress in Artificial Intelligence"},{"key":"1296_CR40","volume-title":"Principles of artificial intelligence","author":"N. Nilsson","year":"1980","unstructured":"Nilsson, N. (1980). Principles of artificial intelligence. Palo Alto: Tioga."},{"issue":"2","key":"1296_CR41","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/s10951-005-6364-5","volume":"8","author":"E. Nowicki","year":"2005","unstructured":"Nowicki, E., & Smutnicki, C. (2005). An advanced tabu search algorithm for the job shop problem. Journal of Scheduling, 8(2), 145\u2013159.","journal-title":"Journal of Scheduling"},{"key":"1296_CR42","volume-title":"Heuristics: intelligent search strategies for computer problem solving","author":"J. Pearl","year":"1984","unstructured":"Pearl, J. (1984). Heuristics: intelligent search strategies for computer problem solving. Reading: Addison-Wesley."},{"key":"1296_CR43","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1007\/s10479-007-0287-9","volume":"159","author":"S. Petrovic","year":"2008","unstructured":"Petrovic, S., Fayad, C., Petrovic, D., Burke, E., & Kendall, G. (2008). Fuzzy job shop scheduling with lot-sizing. Annals of Operations Research, 159, 275\u2013292.","journal-title":"Annals of Operations Research"},{"key":"1296_CR44","volume-title":"Scheduling: theory, algorithms and systems","author":"M. Pinedo","year":"2008","unstructured":"Pinedo, M. (2008). Scheduling: theory, algorithms and systems (3rd ed.). Berlin: Springer.","edition":"3"},{"key":"1296_CR45","unstructured":"Roy, B., & Sussman, B. (1964). Les problemes d\u2019ordonnancements avec contraintes disjonctives (Tech. Rep.). Notes DS No. 9 bis, SEMA, Paris."},{"key":"1296_CR46","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/978-3-642-25274-7_20","volume-title":"Advances in artificial intelligence","author":"M. R. Sierra","year":"2011","unstructured":"Sierra, M. R., Menc\u00eda, C., & Varela, R. (2011). Optimally scheduling a job-shop with operators and total flow time minimization. In LNCS: Vol.\u00a07023. Advances in artificial intelligence (pp. 193\u2013202)."},{"key":"1296_CR47","first-page":"139","volume-title":"Proceedings of AAAI 1993","author":"S. F. Smith","year":"1993","unstructured":"Smith, S. F., & Cheng, C. C. (1993). Slack-based heuristics for constraint satisfaction scheduling. In Proceedings of AAAI 1993 (pp. 139\u2013144)."},{"key":"1296_CR48","first-page":"324","volume-title":"Proceedings of ICAPS 2006","author":"M. J. Streeter","year":"2006","unstructured":"Streeter, M. J., & Smith, S. F. (2006). Exploiting the power of local search in a branch and bound algorithm for job shop scheduling. In Proceedings of ICAPS 2006 (pp. 324\u2013333)."},{"key":"1296_CR49","first-page":"312","volume-title":"Proceedings of ICAPS 2007","author":"M. J. Streeter","year":"2007","unstructured":"Streeter, M. J., & Smith, S. F. (2007). Using decision procedures efficiently for optimization. In Proceedings of ICAPS 2007 (pp. 312\u2013319)."},{"issue":"2","key":"1296_CR50","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1016\/0377-2217(93)90182-M","volume":"64","author":"E. Taillard","year":"1993","unstructured":"Taillard, E. (1993). Benchmarks for basic scheduling problems. European Journal of Operational Research, 64(2), 278\u2013285.","journal-title":"European Journal of Operational Research"},{"key":"1296_CR51","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1287\/opre.40.1.113","volume":"40","author":"P. Laarhoven Van","year":"1992","unstructured":"Van Laarhoven, P., Aarts, E., & Lenstra, K. (1992). Job shop scheduling by simulated annealing. Operations Research, 40, 113\u2013125.","journal-title":"Operations Research"},{"issue":"2","key":"1296_CR52","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/s10732-008-9094-y","volume":"16","author":"C. R. Vela","year":"2010","unstructured":"Vela, C. R., Varela, R., & Gonz\u00e1lez, M. A. (2010). Local search and genetic algorithm for the job shop scheduling problem with sequence dependent setup times. Journal of Heuristics, 16(2), 139\u2013165.","journal-title":"Journal of Heuristics"},{"key":"1296_CR53","first-page":"263","volume-title":"Proceedings of CPAIOR 2008","author":"J. P. Watson","year":"2008","unstructured":"Watson, J. P., & Beck, J. C. (2008). A hybrid constraint programming\/local search approach to the job-shop scheduling problem. In Proceedings of CPAIOR 2008 (pp. 263\u2013277)."},{"issue":"3","key":"1296_CR54","doi-asserted-by":"crossref","first-page":"500","DOI":"10.1109\/TASE.2009.2039134","volume":"7","author":"T. Wu","year":"2010","unstructured":"Wu, T., Shi, L., & Duffie, N. (2010). An HNP-MP approach for the capacitated multi-item lot sizing problem with setup times. IEEE Transactions on Automation Science and Engineering, 7(3), 500\u2013511. doi: 10.1109\/TASE.2009.2039134 .","journal-title":"IEEE Transactions on Automation Science and Engineering"},{"issue":"2","key":"1296_CR55","doi-asserted-by":"crossref","first-page":"428","DOI":"10.1016\/j.ejor.2011.04.029","volume":"214","author":"T. Wu","year":"2011","unstructured":"Wu, T., Shi, L., Geunes, J., & AkartunalI, K. (2011). An optimization framework for solving capacitated multi-level lot-sizing problems with backlogging. European Journal of Operational Research, 214(2), 428\u2013441.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"1296_CR56","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/s10479-008-0370-x","volume":"168","author":"H. Yau","year":"2009","unstructured":"Yau, H., & Shi, L. (2009). Nested partitions for the large-scale extended job shop scheduling problem. Annals of Operations Research, 168(1), 23\u201339.","journal-title":"Annals of Operations Research"},{"key":"1296_CR57","doi-asserted-by":"crossref","first-page":"282","DOI":"10.1016\/j.cor.2006.02.024","volume":"35","author":"C. Y. Zhang","year":"2008","unstructured":"Zhang, C. Y., Li, P., Rao, Y., & Guan, Z. (2008). A very fast TS\/SA algorithm for the job shop scheduling problem. Computers & Operations Research, 35, 282\u2013294.","journal-title":"Computers & Operations Research"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-012-1296-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-012-1296-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-012-1296-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,19]],"date-time":"2020-07-19T13:42:13Z","timestamp":1595166133000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-012-1296-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,12,29]]},"references-count":57,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,7]]}},"alternative-id":["1296"],"URL":"https:\/\/doi.org\/10.1007\/s10479-012-1296-x","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,12,29]]}}}