{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,13]],"date-time":"2025-10-13T08:51:25Z","timestamp":1760345485388},"reference-count":22,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1981,4,1]],"date-time":"1981-04-01T00:00:00Z","timestamp":354931200000},"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":11795,"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":[[1981,4]]},"DOI":"10.1016\/0166-218x(81)90038-x","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:34Z","timestamp":1027655014000},"page":"137-150","source":"Crossref","is-referenced-by-count":12,"title":["Sequencing with general precedence constraints"],"prefix":"10.1016","volume":"3","author":[{"given":"C.L.","family":"Monma","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(81)90038-X_BIB1","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1287\/opre.26.1.141","article-title":"Scheduling to minimize maximum cumulative cost subject to series-parallel precedence constraints","volume":"26","author":"Abdel-Wahab","year":"1978","journal-title":"Operations Research"},{"year":"1978","series-title":"On the C-optimal scheduling problem","author":"Abdel-Waheb","key":"10.1016\/0166-218X(81)90038-X_BIB2"},{"key":"10.1016\/0166-218X(81)90038-X_BIB3","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1137\/0206002","article-title":"Single machine job sequencing with precedence constraints","volume":"6","author":"Adolphson","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(81)90038-X_BIB4","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1137\/0125042","article-title":"Optimal linear ordering","volume":"25","author":"Adolphson","year":"1973","journal-title":"SIAM J. Appl. Math."},{"year":"1967","series-title":"Theory of Scheduling","author":"Conway","key":"10.1016\/0166-218X(81)90038-X_BIB5"},{"key":"10.1016\/0166-218X(81)90038-X_BIB6","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/0012-365X(73)90113-1","article-title":"Optimal task sequencing with precedence constraints","volume":"4","author":"Garey","year":"1973","journal-title":"Discrete Math."},{"key":"10.1016\/0166-218X(81)90038-X_BIB7","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1137\/0123021","article-title":"Single-machine job sequencing with treelike precedence ordering and linear delay penalties","volume":"23","author":"Horn","year":"1972","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/0166-218X(81)90038-X_BIB8","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. Logist. Quart."},{"key":"10.1016\/0166-218X(81)90038-X_BIB9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.15807\/jorsj.19.1","article-title":"Two-machine scheduling under required precedence among jobs","volume":"19","author":"Kurisu","year":"1976","journal-title":"J. Operations Res. Soc. Japan"},{"key":"10.1016\/0166-218X(81)90038-X_BIB10","doi-asserted-by":"crossref","first-page":"544","DOI":"10.1287\/mnsc.19.5.544","article-title":"Optimal sequencing of a single machine subject to precedence constraints","volume":"19","author":"Lawler","year":"1973","journal-title":"Management Sci."},{"key":"10.1016\/0166-218X(81)90038-X_BIB11","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/S0167-5060(08)70323-6","article-title":"Sequencing jobs to minimize total weighted completion time subject to precedence constraints","volume":"2","author":"Lawler","year":"1978","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/0166-218X(81)90038-X_BIB12","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1287\/opre.26.4.563","article-title":"Minimization of time-varying costs in single-machine scheduling","volume":"26","author":"Lawler","year":"1978","journal-title":"Operations Research"},{"key":"10.1016\/0166-218X(81)90038-X_BIB13","unstructured":"E.L. Lawler, R.E. Tarjan and J. Valdes, Analysis and isomorphism of series-parallel digraphs, unpublished manuscript."},{"key":"10.1016\/0166-218X(81)90038-X_BIB14","first-page":"17","article-title":"An analytic solution to the least cost testing sequence problem","volume":"11","author":"Mitten","year":"1960","journal-title":"J. Industrial Engineering"},{"key":"10.1016\/0166-218X(81)90038-X_BIB15","series-title":"Ph.D. Thesis","article-title":"Properties and efficient algorithms for certain classes of sequencing problems","author":"Monma","year":"1978"},{"key":"10.1016\/0166-218X(81)90038-X_BIB16","doi-asserted-by":"crossref","first-page":"792","DOI":"10.1287\/opre.27.4.792","article-title":"Two-machine flow-shop problem with series-parallel precedence relations: an algorithm and extensions","volume":"27","author":"Monma","year":"1979","journal-title":"Operations Research"},{"key":"10.1016\/0166-218X(81)90038-X_BIB17","doi-asserted-by":"crossref","first-page":"942","DOI":"10.1287\/opre.28.4.942","article-title":"Sequencing to minimize the maximum job cost","volume":"28","author":"Monma","year":"1980","journal-title":"Operations Research"},{"key":"10.1016\/0166-218X(81)90038-X_BIB18","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1287\/moor.4.3.215","article-title":"Sequencing with series-parallel precedence constraints","volume":"4","author":"Monma","year":"1979","journal-title":"Mathematics of OR"},{"key":"10.1016\/0166-218X(81)90038-X_BIB19","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1287\/mnsc.12.5.437","article-title":"Scheduling independent tasks on parallel processors","volume":"12","author":"Rothkopf","year":"1966","journal-title":"Management Sci."},{"key":"10.1016\/0166-218X(81)90038-X_BIB20","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1287\/opre.23.2.283","article-title":"Decomposition algorithms for single machine sequencing with precedence relations and deferral costs","volume":"23","author":"Sidney","year":"1975","journal-title":"Operations Research"},{"key":"10.1016\/0166-218X(81)90038-X_BIB21","doi-asserted-by":"crossref","first-page":"782","DOI":"10.1287\/opre.27.4.782","article-title":"The two-machine flow-shop problem with series-parallel precedence constraints","volume":"27","author":"Sidney","year":"1979","journal-title":"Operations Research"},{"key":"10.1016\/0166-218X(81)90038-X_BIB22","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1002\/nav.3800030106","article-title":"Various optimizers for single-stage production","volume":"3","author":"Smith","year":"1956","journal-title":"Naval Res. Logist. Quart."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X8190038X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X8190038X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T06:24:52Z","timestamp":1555136692000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X8190038X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981,4]]},"references-count":22,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1981,4]]}},"alternative-id":["0166218X8190038X"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(81)90038-x","relation":{},"ISSN":["0166-218X"],"issn-type":[{"type":"print","value":"0166-218X"}],"subject":[],"published":{"date-parts":[[1981,4]]}}}