{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T21:05:33Z","timestamp":1767906333877,"version":"3.49.0"},"reference-count":12,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2001,8,1]],"date-time":"2001-08-01T00:00:00Z","timestamp":996624000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[2001,8]]},"DOI":"10.1016\/s0377-2217(00)00197-1","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T22:10:50Z","timestamp":1027635050000},"page":"183-189","source":"Crossref","is-referenced-by-count":51,"title":["A divide and merge heuristic for the multiprocessor scheduling problem with sequence dependent setup times"],"prefix":"10.1016","volume":"133","author":[{"given":"Michel","family":"Gendreau","sequence":"first","affiliation":[]},{"given":"Gilbert","family":"Laporte","sequence":"additional","affiliation":[]},{"given":"Eduardo Morais","family":"Guimar\u00e3es","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(00)00197-1_BIB1","series-title":"Network flows: Theory algorithms and applications","author":"Ahuja","year":"1993"},{"key":"10.1016\/S0377-2217(00)00197-1_BIB2","unstructured":"Beasley, J.E., 1993. Subgradient optimization. In: Reeves, C.R. (Ed.), Modern Heuristic Techniques for Combinatorial Optimization. Blackwell, Oxford"},{"key":"10.1016\/S0377-2217(00)00197-1_BIB3","unstructured":"Christofides, N., 1976. Worst-case analysis of a new heuristic for the traveling salesman problem. Report 388, Graduate School of Industrial Administration, Carnegie Mellon University, Pittsburgh, PA"},{"key":"10.1016\/S0377-2217(00)00197-1_BIB4","unstructured":"CPLEX Optimization Inc. 1995. Using the CPLEX Callable Library and CPLEX Mixed Integer Library. Incline Village, Nevada"},{"key":"10.1016\/S0377-2217(00)00197-1_BIB5","unstructured":"Dell'Amico, M., Martello, S., 1997. Linear assignment. In: Dell'Amico, M., Maffioli, F., Martello, S. (Eds.), Annotated Bibliographies in Combinatorial Optimization. Wiley, Chichester"},{"key":"10.1016\/S0377-2217(00)00197-1_BIB6","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1287\/trsc.29.3.267","article-title":"The m-traveling salesman problem with minmax objective","volume":"29","author":"Fran\u00e7a","year":"1995","journal-title":"Transportation Science"},{"key":"10.1016\/S0377-2217(00)00197-1_BIB7","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/0925-5273(96)00031-X","article-title":"A tabu search heuristic for the multiprocessor scheduling probem with sequence dependent setup times","volume":"43","author":"Fran\u00e7a","year":"1996","journal-title":"International Journal of Production Economics"},{"key":"10.1016\/S0377-2217(00)00197-1_BIB8","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1137\/0207017","article-title":"Approximation algorithms for some routing problems","volume":"7","author":"Frederickson","year":"1978","journal-title":"SIAM Journal on Computing"},{"key":"10.1016\/S0377-2217(00)00197-1_BIB9","unstructured":"Giust, \u00c9., 1992. Optimisation de tourn\u00e9es de v\u00e9hicules. Applications \u00e0 la distribution de gaz. M.Sc. Dissertation, Facult\u00e9s Universitaires Notre-Dame de la Paix, Namur, Belgium"},{"key":"10.1016\/S0377-2217(00)00197-1_BIB10","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","article-title":"Optimization and approximation in deterministic sequencing and scheduling: A survey","volume":"5","author":"Graham","year":"1979","journal-title":"Annals of Discrete Mathematics"},{"key":"10.1016\/S0377-2217(00)00197-1_BIB11","doi-asserted-by":"crossref","first-page":"561","DOI":"10.1137\/0208045","article-title":"A patching algorithm for the nonsymmetric traveling-salesman problem","volume":"8","author":"Karp","year":"1979","journal-title":"SIAM Journal on Computing"},{"key":"10.1016\/S0377-2217(00)00197-1_BIB12","doi-asserted-by":"crossref","first-page":"1017","DOI":"10.1057\/jors.1980.188","article-title":"A cutting planes algorithm for the m-salesmen problem","volume":"31","author":"Laporte","year":"1980","journal-title":"Journal of the Operational Research Society"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221700001971?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221700001971?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,19]],"date-time":"2019-04-19T12:51:18Z","timestamp":1555678278000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221700001971"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,8]]},"references-count":12,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2001,8]]}},"alternative-id":["S0377221700001971"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(00)00197-1","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2001,8]]}}}