{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:26:54Z","timestamp":1759847214995},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[1998,6,1]],"date-time":"1998-06-01T00:00:00Z","timestamp":896659200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Programming"],"published-print":{"date-parts":[[1998,6]]},"DOI":"10.1007\/bf01585874","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T08:42:50Z","timestamp":1114677770000},"page":"235-254","source":"Crossref","is-referenced-by-count":9,"title":["Sequencing jobs that require common resources on a single machine: A solvable case of the TSP"],"prefix":"10.1007","volume":"82","author":[{"given":"Jack A. A.","family":"van der Veen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gerhard J.","family":"Woeginger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shuzhong","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","first-page":"87","volume-title":"The Traveling Salesman Problem","author":"P.C. Gilmore","year":"1985","unstructured":"P.C. Gilmore, E.L. Lawler, D.B. Shmoys, Well-solved special cases, in: E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, D.B. Shmoys (Eds.), The Traveling Salesman Problem, Wiley-Interscience, NY, 1985, pp. 87\u2013143."},{"key":"CR2","volume-title":"Special Cases of the Traveling Salesman Problem","author":"R. Dal van","year":"1992","unstructured":"R. van Dal, Special Cases of the Traveling Salesman Problem, Ph.D.Thesis, University of Groningen, Wolters-Noordhoff Groningen, 1992."},{"key":"CR3","unstructured":"J.A.A. van der Veen, Solvable Cases of the Traveling Salesman Problem with Various Objective Functions, Ph.D. Thesis, University of Groningen, 1992."},{"key":"CR4","doi-asserted-by":"crossref","unstructured":"R.E. Burkard, V.G. Deineko, R. van Dal, J.A.A. van der Veen, G.J. Woeginger, Solvable Cases of the Traveling Salesman Problem: A Survey, SIAM Review (to appear).","DOI":"10.1137\/S0036144596297514"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"655","DOI":"10.1287\/opre.12.5.655","volume":"12","author":"P.C. Gilmore","year":"1964","unstructured":"P.C. Gilmore, R.E. Gomory, Sequencing a one-state-variable machine: A solvable case of the Traveling Salesman Problem, Operations Research 12 (1964) 655\u2013679.","journal-title":"Operations Research"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/0305-0548(90)90003-P","volume":"17","author":"B.H. Ahn","year":"1990","unstructured":"B.H. Ahn, J.H. Hyun, Single facility multi-class job sequencing, Computers and Operations Research 17 (1990) 265\u2013272.","journal-title":"Computers and Operations Research"},{"key":"CR7","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1016\/0377-2217(88)90252-4","volume":"8","author":"J.N.D. Gupta","year":"1988","unstructured":"J.N.D. Gupta, Single facility scheduling with multiple job classes, European Journal of Operational Research 8 (1988) 42\u201345.","journal-title":"European Journal of Operational Research"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1023\/A:1018913902852","volume":"70","author":"J.N.D. Gupta","year":"1997","unstructured":"J.N.D. Gupta, J.C. Ho, J.A.A. van der Veen, Single machine bi-criteria scheduling with customer orders and multiple job classes, Annals of Operations Research 70 (1997) 127\u2013144.","journal-title":"Annals of Operations Research"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"798","DOI":"10.1287\/opre.37.5.798","volume":"37","author":"C.L. Monma","year":"1989","unstructured":"C.L. Monma, C.N. Potts, On the complexity of scheduling with batch setup times, Operations Research 37 (1989) 798\u2013804.","journal-title":"Operations Research"},{"key":"CR10","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1016\/0305-0548(91)90018-M","volume":"18","author":"C.N. Potts","year":"1991","unstructured":"C.N. Potts, Scheduling two job classes on a single machine, Computers and Operations Research 18 (1991) 411\u2013415.","journal-title":"Computers and Operations Research"},{"key":"CR11","doi-asserted-by":"crossref","first-page":"1347","DOI":"10.1287\/opre.28.6.1347","volume":"28","author":"H.N. Psaraftis","year":"1980","unstructured":"H.N. Psaraftis, A dynamic programming approach for sequencing groups of identical jobs, Operations Research 28 (1980) 1347\u20131359.","journal-title":"Operations Research"},{"key":"CR12","doi-asserted-by":"crossref","unstructured":"L. Bianco, G. Rinaldi, A. Sassano, A combinatorial optimization approach to aircraft sequencing problem, in: A.R. Odini et al. (Eds.), Flow Control of Congested Networks, NATO-ASI Series 38, 1987, pp. 324\u2013339.","DOI":"10.1007\/978-3-642-86726-2_20"},{"key":"CR13","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1002\/1520-6750(198804)35:2<177::AID-NAV3220350203>3.0.CO;2-V","volume":"35","author":"L. Bianco","year":"1988","unstructured":"L. Bianco, S. Ricciardelli, G. Rinaldi, A. Sassano, Scheduling tasks with sequence dependent processing times, Naval Research Logistics 35 (1988) 177\u2013184.","journal-title":"Naval Research Logistics"},{"key":"CR14","doi-asserted-by":"crossref","first-page":"1059","DOI":"10.1016\/0305-0548(96)00016-0","volume":"23","author":"J.A.A. Veen van der","year":"1996","unstructured":"J.A.A. van der Veen, S. Zhang, Low-complexity algorithms for sequencing jobs with a fixed number of job-classes, Computers and Operations Research 23 (1996) 1059\u20131067.","journal-title":"Computers and Operations Research"},{"key":"CR15","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1137\/0213007","volume":"13","author":"S.S. Cosmadakis","year":"1984","unstructured":"S.S. Cosmadakis, C.H. Papadimitriou, The Traveling Salesman Problem with many visits to few cities, SIAM Journal on Computing 13 (1984) 99\u2013108.","journal-title":"SIAM Journal on Computing"},{"key":"CR16","first-page":"187","volume":"82","author":"H.W. Hamacher","year":"1992","unstructured":"H.W. Hamacher, Combinatorial optimization problems motivated by robotic assembly problems, in: M. Akgul (Ed.), Combinatorial Optimization, NATO ASI Series F 82, 1992, pp. 187\u2013198.","journal-title":"NATO ASI Series F"},{"key":"CR17","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1287\/opre.36.2.192","volume":"36","author":"M.O. Ball","year":"1988","unstructured":"M.O. Ball, M.J. Magazine, Sequencing of insertions in printed circuit board assembly, Operations Research 36 (1988) 192\u2013201.","journal-title":"Operations Research"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01585874.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01585874\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01585874","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T15:32:33Z","timestamp":1556897553000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01585874"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,6]]},"references-count":17,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1998,6]]}},"alternative-id":["BF01585874"],"URL":"https:\/\/doi.org\/10.1007\/bf01585874","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1998,6]]}}}