{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:35:28Z","timestamp":1759847728171},"reference-count":15,"publisher":"Elsevier BV","issue":"11","license":[{"start":{"date-parts":[[1996,11,1]],"date-time":"1996-11-01T00:00:00Z","timestamp":846806400000},"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":["Computers &amp; Operations Research"],"published-print":{"date-parts":[[1996,11]]},"DOI":"10.1016\/0305-0548(96)00016-0","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T23:10:20Z","timestamp":1052781020000},"page":"1059-1067","source":"Crossref","is-referenced-by-count":14,"title":["Low-complexity algorithms for sequencing jobs with a fixed number of job-classes"],"prefix":"10.1016","volume":"23","author":[{"given":"Jack A.A.","family":"van der Veen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shuzhong","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0305-0548(96)00016-0_BIB1","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/0377-2217(93)90206-3","article-title":"A sequencing problem in the weaving industry","volume":"66","author":"Al-Haboubi","year":"1993","journal-title":"Eur. J. Opl Res."},{"key":"10.1016\/0305-0548(96)00016-0_BIB2","series-title":"The Traveling Salesman Problem","article-title":"Branch and bound methods","author":"Balas","year":"1985"},{"key":"10.1016\/0305-0548(96)00016-0_BIB3","series-title":"Flow Control of Congested Networks","first-page":"324","article-title":"A combinatorial optimization approach to aircraft sequencing problem","volume":"38","author":"Bianco","year":"1987"},{"key":"10.1016\/0305-0548(96)00016-0_BIB4","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1002\/1520-6750(198804)35:2<177::AID-NAV3220350203>3.0.CO;2-V","article-title":"Scheduling tasks with sequence-dependent processing times","volume":"35","author":"Bianco","year":"1988","journal-title":"Naval Res. Logist."},{"key":"10.1016\/0305-0548(96)00016-0_BIB5","series-title":"Theory of Scheduling","author":"Conway","year":"1967"},{"key":"10.1016\/0305-0548(96)00016-0_BIB6","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1137\/0213007","article-title":"The traveling salesman problem with many visits to a few cities","volume":"13","author":"Cosmadakis","year":"1984","journal-title":"SIAM J. Computg"},{"key":"10.1016\/0305-0548(96)00016-0_BIB7","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1287\/opre.2.4.393","article-title":"Solution of a large-scale traveling salesman problem","volume":"2","author":"Dantzig","year":"1954","journal-title":"Ops Res."},{"key":"10.1016\/0305-0548(96)00016-0_BIB8","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0305-0548(96)00016-0_BIB9","doi-asserted-by":"crossref","first-page":"655","DOI":"10.1287\/opre.12.5.655","article-title":"Sequencing a one state-variable machine: a solvable case of the traveling salesman problem","volume":"12","author":"Gilmore","year":"1964","journal-title":"Ops Res."},{"key":"10.1016\/0305-0548(96)00016-0_BIB10","article-title":"A new approach to aircraft sequencing","author":"ten Have","year":"1992"},{"key":"10.1016\/0305-0548(96)00016-0_BIB11","doi-asserted-by":"crossref","first-page":"648","DOI":"10.1287\/opre.39.4.648","article-title":"Strongly polynomial algorithms for the high multiplicity scheduling problem","volume":"39","author":"Hochbaum","year":"1991","journal-title":"Ops Res."},{"key":"10.1016\/0305-0548(96)00016-0_BIB12","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1287\/moor.8.4.538","article-title":"Integer programming with a fixed number of variables","volume":"8","author":"Lenstra","year":"1983","journal-title":"Math. Ops Res."},{"key":"10.1016\/0305-0548(96)00016-0_BIB13","doi-asserted-by":"crossref","first-page":"1347","DOI":"10.1287\/opre.28.6.1347","article-title":"A dynamic programming approach for sequencing groups of identical jobs","volume":"28","author":"Psaraftis","year":"1980","journal-title":"Ops Res."},{"key":"10.1016\/0305-0548(96)00016-0_BIB14","series-title":"Theory of Linear and Integer Programming","author":"Schrijver","year":"1986"},{"key":"10.1016\/0305-0548(96)00016-0_BIB15","doi-asserted-by":"crossref","first-page":"767","DOI":"10.1287\/opre.36.5.767","article-title":"Models arising from a flexible manufacturing machine, part I: minimization of the number of tool switches","volume":"36","author":"Tang","year":"1988","journal-title":"Ops Res."}],"container-title":["Computers &amp; Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054896000160?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054896000160?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,14]],"date-time":"2019-04-14T01:20:45Z","timestamp":1555204845000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0305054896000160"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,11]]},"references-count":15,"journal-issue":{"issue":"11","published-print":{"date-parts":[[1996,11]]}},"alternative-id":["0305054896000160"],"URL":"https:\/\/doi.org\/10.1016\/0305-0548(96)00016-0","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[1996,11]]}}}