{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T23:53:30Z","timestamp":1773273210923,"version":"3.50.1"},"reference-count":7,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5676,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1998,1]]},"DOI":"10.1016\/s0304-3975(97)00133-3","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T15:40:02Z","timestamp":1049730002000},"page":"205-214","source":"Crossref","is-referenced-by-count":7,"title":["Shortest common superstrings and scheduling with coordinated starting times"],"prefix":"10.1016","volume":"191","author":[{"given":"Martin","family":"Middendorf","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(97)00133-3_BIB1","series-title":"Scheduling Algorithms","author":"Brucker","year":"1995"},{"key":"10.1016\/S0304-3975(97)00133-3_BIB2","series-title":"Introduction to Algorithms","author":"Cormen","year":"1989"},{"key":"10.1016\/S0304-3975(97)00133-3_BIB3","series-title":"Computers and Intractability","author":"Garey","year":"1979"},{"key":"10.1016\/S0304-3975(97)00133-3_BIB4","first-page":"50","article-title":"On finding minimal length superstrings","volume":"20","author":"Gallant","year":"1980","journal-title":"JCCS"},{"key":"10.1016\/S0304-3975(97)00133-3_BIB5","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 for the travelling salesman problem","volume":"12","author":"Gilmore","year":"1964","journal-title":"Oper. Res."},{"key":"10.1016\/S0304-3975(97)00133-3_BIB6","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1002\/nav.3800010110","article-title":"Optimal two- and three-stage production schedules with setup times included","volume":"1","author":"Johnson","year":"1954","journal-title":"Naval Res. Logistic Quart."},{"key":"10.1016\/S0304-3975(97)00133-3_BIB7","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/0304-3975(92)00074-2","article-title":"More on the complexity of common superstring and supersequence problems","volume":"124","author":"Middendorf","year":"1994","journal-title":"Theoret. Comput. Sci."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397597001333?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397597001333?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T00:57:32Z","timestamp":1555376252000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397597001333"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,1]]},"references-count":7,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1998,1]]}},"alternative-id":["S0304397597001333"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(97)00133-3","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1998,1]]}}}