{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,29]],"date-time":"2025-11-29T07:49:47Z","timestamp":1764402587451},"reference-count":12,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2013,11,1]],"date-time":"2013-11-01T00:00:00Z","timestamp":1383264000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2017,11,4]],"date-time":"2017-11-04T00:00:00Z","timestamp":1509753600000},"content-version":"vor","delay-in-days":1464,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2013,11]]},"DOI":"10.1016\/j.tcs.2013.05.023","type":"journal-article","created":{"date-parts":[[2013,5,23]],"date-time":"2013-05-23T01:50:04Z","timestamp":1369273804000},"page":"13-22","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":15,"special_numbering":"C","title":["On an extension of the Sort & Search method with application to scheduling theory"],"prefix":"10.1016","volume":"511","author":[{"given":"Ch.","family":"Lent\u00e9","sequence":"first","affiliation":[]},{"given":"M.","family":"Liedloff","sequence":"additional","affiliation":[]},{"given":"A.","family":"Soukhal","sequence":"additional","affiliation":[]},{"given":"V.","family":"T\u2019Kindt","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2013.05.023_br000005","series-title":"Scheduling Algorithms","author":"Brucker","year":"2007"},{"key":"10.1016\/j.tcs.2013.05.023_br000010","series-title":"Proceedings of 19th Annual European Symposium","first-page":"299","article-title":"Scheduling partially ordered jobs faster than 2n","volume":"vol. 6942","author":"Cygan","year":"2011"},{"key":"10.1016\/j.tcs.2013.05.023_br000015","series-title":"Computational Geometry: Algorithms and Applications","author":"de~Berg","year":"2008"},{"key":"10.1016\/j.tcs.2013.05.023_br000020","series-title":"Exact Exponential Algorithms","author":"Fomin","year":"2010"},{"key":"10.1016\/j.tcs.2013.05.023_br000025","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\/j.tcs.2013.05.023_br000030","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1145\/321812.321823","article-title":"Computing partitions with applications to the knapsack problem","volume":"21","author":"Horowitz","year":"1974","journal-title":"Journal of the ACM"},{"key":"10.1016\/j.tcs.2013.05.023_br000035","series-title":"Scheduling a Production Line to Minimize Maximum Tardiness, Management Science Research Project, University of California (USA), Research Report 43","author":"Jackson","year":"1955"},{"issue":"1","key":"10.1016\/j.tcs.2013.05.023_br000040","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1287\/mnsc.16.1.77","article-title":"A functional equation and its application to resource allocation and sequencing problems","volume":"16","author":"Lawler","year":"1969","journal-title":"Management Science"},{"key":"10.1016\/j.tcs.2013.05.023_br000045","series-title":"Exponential Algorithms for Scheduling Problems, Tech. Rep. 300, Laboratory of Computer Science, University Francois Rabelais of Tours, France","author":"Lent\u00e9","year":"2011"},{"key":"10.1016\/j.tcs.2013.05.023_br000050","unstructured":"C. Lent\u00e9, M. Liedloff, A. Soukhal, V. T\u2019kindt, Exponential-time algorithms for scheduling problems, in: MAPSP\u201911. Nymburk (Czech Republic), 2011, 3 pages."},{"key":"10.1016\/j.tcs.2013.05.023_br000055","series-title":"Scheduling\u2014Theory, Algorithms, and Systems","author":"Pinedo","year":"2008"},{"key":"10.1016\/j.tcs.2013.05.023_br000060","first-page":"185","article-title":"Exact algorithms for NP-hard problems: a survey","volume":"vol. 2570","author":"Woeginger","year":"2003"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397513003848?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397513003848?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,10,15]],"date-time":"2018-10-15T21:21:40Z","timestamp":1539638500000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397513003848"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,11]]},"references-count":12,"alternative-id":["S0304397513003848"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2013.05.023","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2013,11]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"On an extension of the Sort & Search method with application to scheduling theory","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2013.05.023","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2013 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}