{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T20:58:12Z","timestamp":1777755492993,"version":"3.51.4"},"reference-count":12,"publisher":"Elsevier BV","issue":"8","license":[{"start":{"date-parts":[[1996,8,1]],"date-time":"1996-08-01T00:00:00Z","timestamp":838857600000},"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 &amp; Operations Research"],"published-print":{"date-parts":[[1996,8]]},"DOI":"10.1016\/0305-0548(95)00078-x","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:00:05Z","timestamp":1027652405000},"page":"769-781","source":"Crossref","is-referenced-by-count":67,"title":["Single machine scheduling to minimize the number of early and tardy jobs"],"prefix":"10.1016","volume":"23","author":[{"given":"Avital","family":"Lann","sequence":"first","affiliation":[]},{"given":"Gur","family":"Mosheiov","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0305-0548(95)00078-X_BIB1","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1287\/opre.38.1.22","article-title":"Sequencing with earliness and tardiness penalties: a review","volume":"38","author":"Baker","year":"1990","journal-title":"Opns Res."},{"key":"10.1016\/0305-0548(95)00078-X_BIB2","doi-asserted-by":"crossref","first-page":"951","DOI":"10.1002\/1520-6750(199312)40:7<951::AID-NAV3220400707>3.0.CO;2-1","article-title":"Simultaneous optimization of efficiency and performance balance measures in single-machine scheduling problems","volume":"40","author":"Federgruen","year":"1993","journal-title":"Naval Res. Logist."},{"key":"10.1016\/0305-0548(95)00078-X_BIB3","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0167-6377(94)90069-8","article-title":"Greedy heuristics for single-machine scheduling problems with general earliness and tardiness costs","volume":"16","author":"Federgruen","year":"1994","journal-title":"Opns Res. Lett."},{"key":"10.1016\/0305-0548(95)00078-X_BIB4","doi-asserted-by":"crossref","first-page":"685","DOI":"10.1057\/jors.1994.106","article-title":"Parallel-machine scheduling problems with earliness and tardiness penalties","volume":"45","author":"Cheng","year":"1994","journal-title":"J. Opt Res. Soc."},{"key":"10.1016\/0305-0548(95)00078-X_BIB5","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1002\/1520-6750(199402)41:1<33::AID-NAV3220410104>3.0.CO;2-S","article-title":"The parallel-machine min-max weighted absolute lateness scheduling problem","volume":"42","author":"Li","year":"1994","journal-title":"Naval Res. Logist."},{"key":"10.1016\/0305-0548(95)00078-X_BIB6","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1287\/opre.26.1.166","article-title":"An algorithm for the space-shuttle scheduling problem","volume":"26","author":"Fisher","year":"1978","journal-title":"Ops Res."},{"key":"10.1016\/0305-0548(95)00078-X_BIB7","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1287\/mnsc.15.1.102","article-title":"An n job, one machine sequencing algorithm for minimizing the number of tardy jobs","volume":"15","author":"Moore","year":"1968","journal-title":"Mgmt Sci."},{"key":"10.1016\/0305-0548(95)00078-X_BIB8","doi-asserted-by":"crossref","DOI":"10.1016\/S0927-0507(05)80189-6","article-title":"Sequencing and Scheduling: Algorithm and Complexity","author":"Lawler","year":"1993","journal-title":"A handbook on Operation Research"},{"key":"10.1016\/0305-0548(95)00078-X_BIB9","series-title":"Simple machine scheduling to minimize the number of early and tardy jobs","author":"Lann","year":"1994"},{"key":"10.1016\/0305-0548(95)00078-X_BIB10","series-title":"Complexity of Computer Computations","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/0305-0548(95)00078-X_BIB11","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":"Mgmt Sci."},{"key":"10.1016\/0305-0548(95)00078-X_BIB12","series-title":"Combinatorial Optimization: Networks and Matroids","author":"Lawler","year":"1976"}],"container-title":["Computers &amp; Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030505489500078X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030505489500078X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,14]],"date-time":"2019-04-14T01:20:34Z","timestamp":1555204834000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030505489500078X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,8]]},"references-count":12,"journal-issue":{"issue":"8","published-print":{"date-parts":[[1996,8]]}},"alternative-id":["030505489500078X"],"URL":"https:\/\/doi.org\/10.1016\/0305-0548(95)00078-x","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[1996,8]]}}}