{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T16:37:25Z","timestamp":1649176645885},"reference-count":6,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2007,9,8]],"date-time":"2007-09-08T00:00:00Z","timestamp":1189209600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["4OR"],"published-print":{"date-parts":[[2008,6]]},"DOI":"10.1007\/s10288-007-0055-3","type":"journal-article","created":{"date-parts":[[2007,9,7]],"date-time":"2007-09-07T02:05:45Z","timestamp":1189130745000},"page":"191-194","source":"Crossref","is-referenced-by-count":1,"title":["Scheduling with earliness\u2013tardiness penalties and parallel machines"],"prefix":"10.1007","volume":"6","author":[{"given":"Yasmin A.","family":"Rios-Solis","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,9,8]]},"reference":[{"key":"55_CR1","unstructured":"Billionnet A, Elloumi S, Plateau M-C (2007) Improving standard solvers via convex reformulation for constrained quadratic 0-1 programs: the QCR method. Discrete Appl Math (to appear)"},{"key":"55_CR2","doi-asserted-by":"crossref","unstructured":"Kedad-Sidhoum S, Rios-Solis YA, Sourd F (2007) Lower bounds for the earliness\u2013tardiness scheduling problem on parallel machines with distinct due dates. Eur J Oper Res (to appear)","DOI":"10.1016\/j.ejor.2006.05.052"},{"key":"55_CR3","unstructured":"Plateau M-C, Rios-Solis YA (2007) Exact solutions for scheduling problems by convex quadratic reformulations. Working paper"},{"key":"55_CR4","doi-asserted-by":"crossref","unstructured":"Rios-Solis YA, Sourd F (2007) Exponential neighborhood search for a parallel machine scheduling problem. Comput Oper Res (to appear)","DOI":"10.1016\/j.cor.2006.10.008"},{"issue":"2","key":"55_CR5","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1145\/375827.375840","volume":"48","author":"M Skutella","year":"2001","unstructured":"Skutella M (2001). Convex quadratic and semidefinite programming relaxations in scheduling. J ACM 48(2): 206\u2013242","journal-title":"J ACM"},{"issue":"2","key":"55_CR6","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1287\/ijoc.1030.0034","volume":"16","author":"F Sourd","year":"2004","unstructured":"Sourd F (2004). The continuous assignment problem and its application to preemptive and non-preemptive scheduling with irregular cost functions. INFORMS J Comput 16(2): 198\u2013208","journal-title":"INFORMS J Comput"}],"container-title":["4OR"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-007-0055-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10288-007-0055-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-007-0055-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T12:12:55Z","timestamp":1559131975000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10288-007-0055-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,9,8]]},"references-count":6,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2008,6]]}},"alternative-id":["55"],"URL":"https:\/\/doi.org\/10.1007\/s10288-007-0055-3","relation":{},"ISSN":["1619-4500","1614-2411"],"issn-type":[{"value":"1619-4500","type":"print"},{"value":"1614-2411","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,9,8]]}}}