{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T01:52:50Z","timestamp":1648950770105},"reference-count":10,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[2001,4,1]],"date-time":"2001-04-01T00:00:00Z","timestamp":986083200000},"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":["Computers & Operations Research"],"published-print":{"date-parts":[[2001,4]]},"DOI":"10.1016\/s0305-0548(99)00103-3","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T13:16:12Z","timestamp":1027602972000},"page":"317-327","source":"Crossref","is-referenced-by-count":4,"title":["Minimizing maximum earliness on parallel identical machines"],"prefix":"10.1016","volume":"28","author":[{"given":"Micha","family":"Mandel","sequence":"first","affiliation":[]},{"given":"Gur","family":"Mosheiov","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0305-0548(99)00103-3_BIB1","unstructured":"Conway RW, Maxwell WL, Miller LW. Theory of scheduling. Reading, MA: Addison-Wesley, 1967."},{"key":"10.1016\/S0305-0548(99)00103-3_BIB2","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1287\/mnsc.15.5.239","article-title":"On a new class of combinatoric optimizers for multi-product single-machine scheduling","volume":"15","author":"Kortanek","year":"1969","journal-title":"Management Science"},{"key":"10.1016\/S0305-0548(99)00103-3_BIB3","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\/S0305-0548(99)00103-3_BIB4","unstructured":"Hoogeveen JA. Minimizing maximum earliness and maximum lateness on a single machine. Working Paper, Department of Operations Research and System Theory, Center for Mathematics and Computer Science, Amsterdam, The Netherlands, 1994."},{"key":"10.1016\/S0305-0548(99)00103-3_BIB5","doi-asserted-by":"crossref","first-page":"853","DOI":"10.1057\/jors.1984.168","article-title":"Minimizing the range of lateness on a single machine","volume":"35","author":"Gupta","year":"1984","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/S0305-0548(99)00103-3_BIB6","doi-asserted-by":"crossref","first-page":"675","DOI":"10.1057\/jors.1988.114","article-title":"Improved bounds for the range of lateness on a single machine","volume":"39","author":"Tegze","year":"1988","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/S0305-0548(99)00103-3_BIB7","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1057\/jors.1991.32","article-title":"An algorithm for minimizing the range of lateness on a single machine","volume":"42","author":"Liao","year":"1991","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/S0305-0548(99)00103-3_BIB8","unstructured":"Lawler EL, Lenstra JK, Rinnooy Kan AHG, Shmoys D. Sequencing and scheduling: algorithms and complexity. In: Graves SS, Rinnooy Kan AHG, Zipkin P, editors. Handbooks in operations research and management science, Vol. 4. New York: North-Holland, 1993. p. 445\u2013522."},{"key":"10.1016\/S0305-0548(99)00103-3_BIB9","doi-asserted-by":"crossref","unstructured":"Karp RM. Reducibility among combinatorial problems. In: Miller RE, Thatcher JW, editors. Complexity of Computer Computations. New York: Plenum Press, 1972. p. 85\u2013103.","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"10.1016\/S0305-0548(99)00103-3_BIB10","unstructured":"Garey MR, Johnson DS. Computers and intractability: A guide to the theory of NP-completeness. New York: Freeman, 1979."}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054899001033?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054899001033?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T23:27:45Z","timestamp":1556148465000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054899001033"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,4]]},"references-count":10,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2001,4]]}},"alternative-id":["S0305054899001033"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(99)00103-3","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2001,4]]}}}