{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T12:55:34Z","timestamp":1772801734233,"version":"3.50.1"},"reference-count":13,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1997,2,1]],"date-time":"1997-02-01T00:00:00Z","timestamp":854755200000},"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":["Operations Research Letters"],"published-print":{"date-parts":[[1997,2]]},"DOI":"10.1016\/s0167-6377(96)00049-1","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T11:29:21Z","timestamp":1027596561000},"page":"75-79","source":"Crossref","is-referenced-by-count":15,"title":["A polynomial approximation scheme for problem F2\/rj\/Cmax"],"prefix":"10.1016","volume":"20","author":[{"given":"Mikhail Y.","family":"Kovalyov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frank","family":"Werner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0167-6377(96)00049-1_BIB1","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0167-6377(96)00049-1_BIB2","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":"Ann. Discrete Math."},{"key":"10.1016\/S0167-6377(96)00049-1_BIB3","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1287\/moor.19.1.68","article-title":"A polynomial approximation scheme for a constrained flow-shop scheduling problem","volume":"19","author":"Hall","year":"1994","journal-title":"Math. Oper. Res."},{"key":"10.1016\/S0167-6377(96)00049-1_BIB4","series-title":"Proc. IEEE 30th Ann. Symp. Foundations of Computer Science","article-title":"Approximation algorithms for constrained scheduling problems","author":"Hall","year":"1989"},{"key":"10.1016\/S0167-6377(96)00049-1_BIB5","series-title":"Proc. Math. Prog. Soc. Conference on Integer Programming and Combinatorial Optimization","article-title":"Near-optimal sequencing with precedence constraints","author":"Hall","year":"1990"},{"key":"10.1016\/S0167-6377(96)00049-1_BIB6","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1287\/moor.17.1.22","article-title":"Jackson's rule for single-machine scheduling: making a good heuristic better","volume":"17","author":"Hall","year":"1992","journal-title":"Math. Oper. Res."},{"key":"10.1016\/S0167-6377(96)00049-1_BIB7","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1002\/nav.3800010110","article-title":"Optimal two- and three-stage production scheduling with setup times included","volume":"1","author":"Johnson","year":"1954","journal-title":"Naval Res. Logist. Quart."},{"key":"10.1016\/S0167-6377(96)00049-1_BIB8","series-title":"Scheduling two-machine flow-shops in parallel","author":"Kovalyov","year":"1993"},{"key":"10.1016\/S0167-6377(96)00049-1_BIB9","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 Sci."},{"key":"10.1016\/S0167-6377(96)00049-1_BIB10","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/S0167-5060(08)70743-X","article-title":"Complexity of machine scheduling problems","volume":"1","author":"Lenstra","year":"1977","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/S0167-6377(96)00049-1_BIB11","doi-asserted-by":"crossref","first-page":"576","DOI":"10.1287\/moor.10.4.576","article-title":"Analysis of heuristics for two-machine flow-shop sequencing subject to release dates","volume":"10","author":"Potts","year":"1985","journal-title":"Math. Oper. Res."},{"key":"10.1016\/S0167-6377(96)00049-1_BIB12","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\/S0167-6377(96)00049-1_BIB13","doi-asserted-by":"crossref","first-page":"920","DOI":"10.1287\/opre.25.6.920","article-title":"General techniques for combinatorial approximation","volume":"25","author":"Sahni","year":"1977","journal-title":"Oper. Res."}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637796000491?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637796000491?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T01:20:25Z","timestamp":1556328025000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167637796000491"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,2]]},"references-count":13,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1997,2]]}},"alternative-id":["S0167637796000491"],"URL":"https:\/\/doi.org\/10.1016\/s0167-6377(96)00049-1","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[1997,2]]}}}