{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T20:52:41Z","timestamp":1672260761660},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1984,2,1]],"date-time":"1984-02-01T00:00:00Z","timestamp":444441600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Programming"],"published-print":{"date-parts":[[1984,2]]},"DOI":"10.1007\/bf02612362","type":"journal-article","created":{"date-parts":[[2007,4,27]],"date-time":"2007-04-27T06:54:07Z","timestamp":1177656847000},"page":"218-225","source":"Crossref","is-referenced-by-count":18,"title":["Analysis of a linearization heuristic for single-machine scheduling to maximize profit"],"prefix":"10.1007","volume":"28","author":[{"given":"Marshall L.","family":"Fisher","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abba M.","family":"Krieger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02612362_CR1","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1287\/opre.26.1.111","volume":"26","author":"K.R. Baker","year":"1978","unstructured":"K.R. Baker and L.E. Schrage, \u201cFinding an optimal sequence by dynamic programming: An extension to precedence-related tasks,\u201dOperations Research 26 (1978) 111\u2013120.","journal-title":"Operations Research"},{"key":"BF02612362_CR2","volume-title":"Heuristic sequencing of single and multi-component orders","author":"D.C. Carroll","year":"1965","unstructured":"D.C. Carroll, \u201cHeuristic sequencing of single and multi-component orders\u201d, Dissertation, Massachusetts Institute of Technology, (Cambridge, MA, 1965)."},{"key":"BF02612362_CR3","unstructured":"D.C. Carroll, private communication."},{"key":"BF02612362_CR4","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/BF01580393","volume":"11","author":"M.L. Fisher","year":"1976","unstructured":"M.L. Fisher, \u201cA dual algorithm for the one-machine scheduling problem,\u201dMathematical Programming 11 (1976) 229\u2013251.","journal-title":"Mathematical Programming"},{"key":"BF02612362_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/mnsc.26.1.1","volume":"26","author":"M.L. Fisher","year":"1980","unstructured":"M.L. Fisher, \u201cWorst-case analysis of heuristic algorithms,\u201dManagement Science 26 (1980) 1\u201317.","journal-title":"Management Science"},{"key":"BF02612362_CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/mnsc.27.1.1","volume":"27","author":"M.L. Fisher","year":"1981","unstructured":"M.L. Fisher, \u201cThe Lagrangian relaxation method for solving integer programming problems,\u201dManagement Science 27 (1981) 1\u201318.","journal-title":"Management Science"},{"key":"BF02612362_CR7","series-title":"Working Paper 81-06-01","volume-title":"Analysis of a linearization heuristic for single-machine scheduling to maximize profit","author":"M.L. Fisher","year":"1981","unstructured":"M.L. Fisher and A.M. Krieger, \u201cAnalysis of a linearization heuristic for single-machine scheduling to maximize profit\u201d, Working Paper 81-06-01, Department of Decision Sciences, The Wharton School, University of Pennsylvania (Philadelphia, PA, 1981)."},{"key":"BF02612362_CR8","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1137\/0117039","volume":"17","author":"R.L. Graham","year":"1969","unstructured":"R.L. Graham, \u201cBounds on multiprocessing timing anomalies\u201d,Siam Journal of Applied Mathematics 17 (1969) 416\u2013428.","journal-title":"Siam Journal of Applied Mathematics"},{"key":"BF02612362_CR9","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1016\/S0167-5060(08)70742-8","volume":"1","author":"E.L. Lawler","year":"1977","unstructured":"E.L. Lawler, \u201cA \u2018pseudopolynomial\u2019 algorithm for sequencing jobs to minimize total tardiness\u201d,Annals of Discrete Mathematica 1 (1977) 331\u2013342.","journal-title":"Annals of Discrete Mathematica"},{"key":"BF02612362_CR10","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/S0167-5060(08)70743-X","volume":"1","author":"J.K. Lenstra","year":"1977","unstructured":"J.K. Lenstra, A.H.G. Rinnooy Kan and P. Brucker, \u201cComplexity of machine scheduling problems,\u201dAnnals of Discrete Mathematica 1 (1977) 343\u2013362.","journal-title":"Annals of Discrete Mathematica"},{"key":"BF02612362_CR11","doi-asserted-by":"crossref","first-page":"1436","DOI":"10.1287\/opre.28.6.1436","volume":"28","author":"C.N. Potts","year":"1980","unstructured":"C.N. Potts, \u201cAnalysis of a heuristic for one machine sequencing with release dates and delivery times,\u201dOperations Research 28 (1980) 1436\u20131441.","journal-title":"Operations Research"},{"key":"BF02612362_CR12","doi-asserted-by":"crossref","first-page":"908","DOI":"10.1287\/opre.23.5.908","volume":"23","author":"A.H.G. Rinnooy Kan","year":"1975","unstructured":"A.H.G. Rinnooy Kan, B.J. Lageweg and J.K. Lenstra, \u201cMinizing total costs in one-machine scheduling,\u201dOperations Research 23 (1975) 908\u2013927.","journal-title":"Operations Research"},{"key":"BF02612362_CR13","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1002\/nav.3800030106","volume":"3","author":"W.E. Smith","year":"1956","unstructured":"W.E. Smith, \u201cVarious optimizers for single-stage production,\u201dNaval Research Logistics Quarterly 3 (1956) 59\u201366.","journal-title":"Naval Research Logistics Quarterly"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02612362.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02612362\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02612362","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T08:34:25Z","timestamp":1558341265000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02612362"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984,2]]},"references-count":13,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1984,2]]}},"alternative-id":["BF02612362"],"URL":"https:\/\/doi.org\/10.1007\/bf02612362","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1984,2]]}}}