{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T08:28:14Z","timestamp":1777364894403,"version":"3.51.4"},"reference-count":14,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1987,9,1]],"date-time":"1987-09-01T00:00:00Z","timestamp":557452800000},"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":9451,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1987,9]]},"DOI":"10.1016\/0166-218x(87)90037-0","type":"journal-article","created":{"date-parts":[[2003,1,17]],"date-time":"2003-01-17T17:34:03Z","timestamp":1042824843000},"page":"1-8","source":"Crossref","is-referenced-by-count":247,"title":["Scheduling jobs with fixed start and end times"],"prefix":"10.1016","volume":"18","author":[{"given":"Esther M.","family":"Arkin","sequence":"first","affiliation":[]},{"given":"Ellen B.","family":"Silverberg","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(87)90037-0_BIB1","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","article-title":"A note on two problems in connexion with graphs","volume":"1","author":"Dijkstra","year":"1959","journal-title":"Numer. Math."},{"issue":"2","key":"10.1016\/0166-218X(87)90037-0_BIB2","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1145\/321694.321699","article-title":"Theoretical improvements in algorithmic efficiency for network flow problems","volume":"19","author":"Edmonds","year":"1972","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0166-218X(87)90037-0_BIB3","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1016\/0095-8956(80)90079-9","article-title":"On chain and antichain families of a partially ordered set","volume":"29","author":"Frank","year":"1980","journal-title":"J. Combin. Theory, (Ser. B)"},{"key":"10.1016\/0166-218X(87)90037-0_BIB4","series-title":"Proc. 25th IEEE Symp. on the Foundations of Computer Science","article-title":"Fibonacci heaps and their uses in improved network optimization algorithms","author":"Fredman","year":"1984"},{"key":"10.1016\/0166-218X(87)90037-0_BIB5","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0166-218X(87)90037-0_BIB6","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/0097-3165(76)90077-7","article-title":"The structure of Sperner k-families","volume":"20","author":"Greene","year":"1976","journal-title":"J. Combin. Theory (Ser. A)"},{"key":"10.1016\/0166-218X(87)90037-0_BIB7","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic","year":"1980"},{"issue":"5","key":"10.1016\/0166-218X(87)90037-0_BIB8_1","first-page":"1093","article-title":"A polynomial algorithm in linear programming","volume":"244","author":"Khachiyan","year":"1979","journal-title":"Dokl. Akad. Nauk USSR"},{"key":"10.1016\/0166-218X(87)90037-0_BIB8_2","first-page":"191","article-title":"A polynomial algorithm in linear programming","volume":"20","author":"Khachiyan","year":"1979","journal-title":"Soviet Math. Dokl."},{"key":"10.1016\/0166-218X(87)90037-0_BIB9","unstructured":"A. Kolen, J.K. Lenstra, C. Papadimitriou and J. Orlin, Interval scheduling problems, Manuscript, Centre of Mathematics and Computer Science, C.W.I., Kruislaan 413, 1098 SJ Amsterdam."},{"key":"10.1016\/0166-218X(87)90037-0_BIB10","series-title":"Combinatorial Optimization: Networks and Matroids","author":"Lawler","year":"1976"},{"key":"10.1016\/0166-218X(87)90037-0_BIB11","series-title":"Combinatorial Optimization: Algorithms and Complexity","author":"Papadimitriou","year":"1982"},{"key":"10.1016\/0166-218X(87)90037-0_BIB12","unstructured":"M. Yannakakis, The node deletion problem for hereditary properties, Report No. TR-240, Computer Science Laboratory, Princeton University, Princeton, NJ."},{"key":"10.1016\/0166-218X(87)90037-0_BIB13","doi-asserted-by":"crossref","unstructured":"M. Yannakakis, Node- and edge-deletion NP-complete problems, Proc. 10th Ann. ACM Symp. On Theory of Computing (Assoc. Comput. Mach., New York) 253\u2013264.","DOI":"10.1145\/800133.804355"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X87900370?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X87900370?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,11]],"date-time":"2024-12-11T18:12:25Z","timestamp":1733940745000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X87900370"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,9]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1987,9]]}},"alternative-id":["0166218X87900370"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(87)90037-0","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1987,9]]}}}