{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T13:08:58Z","timestamp":1760706538783},"reference-count":19,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2001,5,1]],"date-time":"2001-05-01T00:00:00Z","timestamp":988675200000},"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":["European Journal of Operational Research"],"published-print":{"date-parts":[[2001,5]]},"DOI":"10.1016\/s0377-2217(99)00432-4","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T19:55:17Z","timestamp":1027626917000},"page":"638-652","source":"Crossref","is-referenced-by-count":24,"title":["Minmax earliness\u2013tardiness costs with unit processing time jobs"],"prefix":"10.1016","volume":"130","author":[{"given":"Gur","family":"Mosheiov","sequence":"first","affiliation":[]},{"given":"Michal","family":"Shadmon","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(99)00432-4_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":"Operations Research"},{"key":"10.1016\/S0377-2217(99)00432-4_BIB2","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":"Journal of Operational Research Society"},{"key":"10.1016\/S0377-2217(99)00432-4_BIB3","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1002\/1520-6750(199402)41:1<17::AID-NAV3220410103>3.0.CO;2-X","article-title":"Due-date assignment and early\/tardy scheduling on identical parallel machines","volume":"41","author":"De","year":"1994","journal-title":"Naval Research Logistics"},{"key":"10.1016\/S0377-2217(99)00432-4_BIB4","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1137\/0213003","article-title":"Linear time algorithms for two- and three-variable linear programs","volume":"13","author":"Dyer","year":"1984","journal-title":"SIAM Journal of Computing"},{"key":"10.1016\/S0377-2217(99)00432-4_BIB5","doi-asserted-by":"crossref","first-page":"803","DOI":"10.1002\/1520-6750(198712)34:6<803::AID-NAV3220340605>3.0.CO;2-2","article-title":"Scheduling to a common due-date on parallel uniform processors","volume":"34","author":"Emmons","year":"1987","journal-title":"Naval Research Logistics"},{"key":"10.1016\/S0377-2217(99)00432-4_BIB6","doi-asserted-by":"crossref","first-page":"1544","DOI":"10.1287\/mnsc.42.11.1544","article-title":"Heuristics for multi-machine scheduling problems with earliness and tardiness costs","volume":"42","author":"Federgruen","year":"1996","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(99)00432-4_BIB7","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1002\/(SICI)1520-6750(199704)44:3<287::AID-NAV4>3.0.CO;2-4","article-title":"Heuristics for multi-machine minmax scheduling problems with general earliness and tardiness costs","volume":"44","author":"Federgruen","year":"1997","journal-title":"Naval Research Logistics"},{"key":"10.1016\/S0377-2217(99)00432-4_BIB8","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1287\/moor.13.2.330","article-title":"One processor scheduling with symmetric earliness and tardiness penalties","volume":"13","author":"Garey","year":"1988","journal-title":"Mathematics of Operations Research"},{"key":"10.1016\/S0377-2217(99)00432-4_BIB9","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1002\/nav.3800330105","article-title":"Single- and multi-processor models for minimizing completion time variance","volume":"33","author":"Hall","year":"1986","journal-title":"Naval Research Logistics"},{"key":"10.1016\/S0377-2217(99)00432-4_BIB10","doi-asserted-by":"crossref","first-page":"847","DOI":"10.1287\/opre.39.5.847","article-title":"Earliness\u2013tardiness scheduling problems, II: Deviation of completion times about a restrictive common due date","volume":"39","author":"Hall","year":"1991","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(99)00432-4_BIB11","doi-asserted-by":"crossref","first-page":"836","DOI":"10.1287\/opre.39.5.836","article-title":"Earliness\u2013tardiness scheduling problems, I: Weighted deviation of completion times about a common due date","volume":"39","author":"Hall","year":"1991","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(99)00432-4_BIB12","series-title":"Inequalities","author":"Hardy","year":"1967"},{"key":"10.1016\/S0377-2217(99)00432-4_BIB13","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1287\/moor.9.3.376","article-title":"Approximation algorithms for the assembly line crew scheduling problem","volume":"9","author":"Hsu","year":"1984","journal-title":"Mathematics of Operations Research"},{"key":"10.1016\/S0377-2217(99)00432-4_BIB14","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1016\/0167-6377(90)90056-B","article-title":"Equivalence of mean flow time problems and mean absolute deviation problems","volume":"9","author":"Kubiak","year":"1990","journal-title":"Operations Research Letters"},{"key":"10.1016\/S0377-2217(99)00432-4_BIB15","doi-asserted-by":"crossref","unstructured":"Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., Shmoys, D., 1993. Sequencing and scheduling: Algorithms and complexity. In: Graves, S.S., Rinnooy Kan, A.H.G., Zipkin, P. (Eds.), Handbooks in Operations Research and Management Science, vol. 4. North-Holland, New York, pp. 445\u2013522","DOI":"10.1016\/S0927-0507(05)80189-6"},{"key":"10.1016\/S0377-2217(99)00432-4_BIB16","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/0167-6377(93)90084-T","article-title":"A note on one processor scheduling with asymmetry earliness and tardiness penalties","volume":"13","author":"Li","year":"1993","journal-title":"Operations Research Letters"},{"key":"10.1016\/S0377-2217(99)00432-4_BIB17","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\u2013max weighted absolute lateness scheduling problem","volume":"41","author":"Li","year":"1994","journal-title":"Naval Research Logistics"},{"key":"10.1016\/S0377-2217(99)00432-4_BIB18","unstructured":"Mosheiov, G., 1991. Scheduling problems with general earliness and tardiness cost structure: A just in time approach. Ph.D. Dissertation, Columbia University, New York"},{"key":"10.1016\/S0377-2217(99)00432-4_BIB19","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1002\/nav.3800310214","article-title":"Minimizing the sum of absolute lateness in single-machine and multi-machine scheduling","volume":"31","author":"Sundararaghavan","year":"1984","journal-title":"Naval Research Logistics Quarterly"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221799004324?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221799004324?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,15]],"date-time":"2020-01-15T19:48:30Z","timestamp":1579117710000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221799004324"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,5]]},"references-count":19,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2001,5]]}},"alternative-id":["S0377221799004324"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(99)00432-4","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2001,5]]}}}