{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T18:53:01Z","timestamp":1648579981795},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2013,10,23]],"date-time":"2013-10-23T00:00:00Z","timestamp":1382486400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2015,4]]},"DOI":"10.1007\/s10951-013-0353-x","type":"journal-article","created":{"date-parts":[[2013,10,22]],"date-time":"2013-10-22T10:54:26Z","timestamp":1382439266000},"page":"165-184","source":"Crossref","is-referenced-by-count":1,"title":["Solving the selective multi-category parallel-servicing problem"],"prefix":"10.1007","volume":"18","author":[{"given":"Troels Martin","family":"Range","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Richard Martin","family":"Lusby","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jesper","family":"Larsen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,10,23]]},"reference":[{"key":"353_CR1","volume-title":"Network flows\u2014Theory, algorithms, and applications","author":"RK Ahuja","year":"1993","unstructured":"Ahuja, R. K., Magnanti, T. L., & Orlin, J. B. (1993). Network flows\u2014Theory, algorithms, and applications. Upper Saddle River, NJ: Prentice Hall."},{"key":"353_CR2","first-page":"31","volume-title":"Optimization in industry","author":"R Anbil","year":"1993","unstructured":"Anbil, R., Barnhart, C., Hatay, L., Johnson, E. L., & Ramakrishnan, V. S. (1993). Crew-pairing optimization at american airlines decision technilogies. In T. A. Ciriani & R. C. Leachman (Eds.), Optimization in industry (Vol. 1, pp. 31\u201336). New York: Wiley."},{"key":"353_CR3","unstructured":"Andersson, E., Housos, E., Kohl, N., & Wedelin, D. (1998). Crew pairing optimization. In OR in airline industry. Dordrecht: Kluwer."},{"issue":"12","key":"353_CR4","doi-asserted-by":"crossref","first-page":"3432","DOI":"10.1016\/j.cor.2005.02.013","volume":"33","author":"J Ar\u00e1oz","year":"2006","unstructured":"Ar\u00e1oz, J., Fern\u00e1ndez, E., & Zoltan, C. (2006). Privatized rural postman problems. Computers & Operations Research, 33(12), 3432\u20133449.","journal-title":"Computers & Operations Research"},{"key":"353_CR5","unstructured":"Bang-Jensen, J., & Gutin, G. (2001). Digraphs: Theory, algorithms and applications. Springer monographs in mathematics. New York: Springer."},{"key":"353_CR6","doi-asserted-by":"crossref","first-page":"526","DOI":"10.1016\/j.cor.2012.08.001","volume":"40","author":"D Black","year":"2013","unstructured":"Black, D., Eglese, R., & W\u00f8hlk, S. (2013). The time-dependent prize-collecting arc routing problem. Computers and Operations Research, 40, 526\u2013535.","journal-title":"Computers and Operations Research"},{"issue":"1","key":"353_CR7","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1287\/ijoc.11.1.78","volume":"11","author":"Z-L Chen","year":"1999","unstructured":"Chen, Z.-L., & Powell, W. B. (1999). Solving parallel machine scheduling problems by column generation. INFORMS Journal on Computing, 11(1), 78.","journal-title":"INFORMS Journal on Computing"},{"key":"353_CR8","volume-title":"Introduction to algorithms","author":"TH Cormen","year":"2001","unstructured":"Cormen, T. H., Leiserson, C. E., Rivest, R. L., & Stein, C. (2001). Introduction to algorithms. Cambridge: MIT Press."},{"key":"353_CR9","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/j.artmed.2009.09.001","volume":"48","author":"P Demeester","year":"2010","unstructured":"Demeester, P., Souffriau, W., Causmaecker, P. D., & Berghe, G. V. (2010). A hybrid tabu search algorithm for automatically assigning patients to beds. Artificial Intelligence in Medicine, 48, 61\u201370.","journal-title":"Artificial Intelligence in Medicine"},{"issue":"2","key":"353_CR10","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1287\/opre.40.2.342","volume":"40","author":"M Desrochers","year":"1992","unstructured":"Desrochers, M., Desrosiers, J., & Solomon, M. (1992). A new optimization algorithm for the vehicle routing problem with time windows. Operations Research, 40(2), 342.","journal-title":"Operations Research"},{"key":"353_CR11","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/s12159-012-0080-2","volume":"5","author":"M Drexl","year":"2012","unstructured":"Drexl, M. (2012). Rich vehicle routing in theory and practice. Logistics Research, 5, 47\u201363.","journal-title":"Logistics Research"},{"issue":"2","key":"353_CR12","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1287\/trsc.1030.0079","volume":"39","author":"D Feillet","year":"2005","unstructured":"Feillet, D., Dejax, P., & Gendreau, M. (2005). Travelling salesman problem with profits. Transportation Science, 39(2), 188\u2013205.","journal-title":"Transportation Science"},{"issue":"2","key":"353_CR13","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1287\/moor.1.2.117","volume":"1","author":"MR Garey","year":"1976","unstructured":"Garey, M. R. (1976). The complexity of flowshop and jobshop scheduling. Mathematics of Operations Research, 1(2), 117\u2013129.","journal-title":"Mathematics of Operations Research"},{"issue":"6","key":"353_CR14","doi-asserted-by":"crossref","first-page":"849","DOI":"10.1287\/opre.9.6.849","volume":"9","author":"P Gilmore","year":"1961","unstructured":"Gilmore, P., & Gomory, R. (1961). A linear programming approach to the cutting-stock problem. Operations Research, 9(6), 849\u2013859.","journal-title":"Operations Research"},{"key":"353_CR15","doi-asserted-by":"crossref","first-page":"618","DOI":"10.1016\/j.dam.2011.09.012","volume":"161","author":"M Haouri","year":"2013","unstructured":"Haouri, M., Layeb, S. B., & Sherali, H. (2013). Tight compact models and comparative analysis for the prize collecting Steiner tree problem. Discrete Applied Mathematics, 161, 618\u2013632.","journal-title":"Discrete Applied Mathematics"},{"issue":"1","key":"353_CR16","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/s00291-007-0083-6","volume":"30","author":"S Irnich","year":"2008","unstructured":"Irnich, S. (2008). Resource extension functions: Properties, inversion, and generalization to segments. OR Spectrum, 30(1), 113\u2013148.","journal-title":"OR Spectrum"},{"key":"353_CR17","unstructured":"Irnich, S., & Desaulniers, G. (2005). Shortest path problems with resource constraints (Chap. 2). New York: Springer."},{"key":"353_CR18","unstructured":"Pisinger, D. (1995). Algorithms for Knapsack problems. PhD thesis, Department of Computer Science, Copenhagen University."},{"key":"353_CR19","unstructured":"Range, T. M., Lusby, R. M., & Larsen, J. (2013). A column generation approach for solving the patient admission scheduling problem. Discussion Papers on Business and Economics 1\/2013, Department of Business and Economics, University of Southern Denmark."},{"key":"353_CR20","doi-asserted-by":"crossref","unstructured":"Smith-Miles, K., & Lopes, L. (2012). Measuring instance difficulty for combinatorial optimization problems. Computers and Operations Research, 39, 875\u2013889.","DOI":"10.1016\/j.cor.2011.07.006"},{"key":"353_CR21","doi-asserted-by":"crossref","unstructured":"Suurballe, J. W., & Tarjan, R. E. (1984). A quick method for finding shortest pairs of disjoint paths. Networks, 14, 325\u2013336.","DOI":"10.1002\/net.3230140209"},{"key":"353_CR22","unstructured":"Tholey, T. (2005). Finding disjoint paths on directed acyclic graphs. Lecture notes in computer science (Vol. 3787, pp. 319\u2013330). Berlin: Springer."}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-013-0353-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-013-0353-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-013-0353-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T05:39:49Z","timestamp":1559453989000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-013-0353-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,10,23]]},"references-count":22,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,4]]}},"alternative-id":["353"],"URL":"https:\/\/doi.org\/10.1007\/s10951-013-0353-x","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,10,23]]}}}