{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,2,19]],"date-time":"2023-02-19T17:09:56Z","timestamp":1676826596012},"reference-count":13,"publisher":"EDP Sciences","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Oper. Res."],"published-print":{"date-parts":[[2001,1]]},"DOI":"10.1051\/ro:2001105","type":"journal-article","created":{"date-parts":[[2003,11,19]],"date-time":"2003-11-19T03:42:52Z","timestamp":1069213372000},"page":"107-115","source":"Crossref","is-referenced-by-count":6,"title":["On Minimizing Total Tardiness in a Serial Batching Problem"],"prefix":"10.1051","volume":"35","author":[{"given":"Philippe","family":"Baptiste","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antoine","family":"Jouglet","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2002,8,15]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0166-218X(93)90085-3","volume":"47","author":"Albers","year":"1993","journal-title":"Discrete Appl. Math."},{"key":"R2","unstructured":"Ph. Baptiste,Batching Identical Jobs, Technical Report, University of Technology of Compi\u00e8gne (1999)."},{"key":"R3","doi-asserted-by":"crossref","unstructured":"P. Brucker,Scheduling Algorithms. Springer Lehrbuch (1995).","DOI":"10.1007\/978-3-662-03088-2"},{"key":"R4","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1002\/(SICI)1099-1425(199806)1:1<31::AID-JOS4>3.0.CO;2-R","volume":"1","author":"Brucker","year":"1998","journal-title":"J. Sched."},{"key":"R5","unstructured":"P. Brucker and S. Knust,Complexity Results of Scheduling Problems.URL: www\/\/mathematik.uni-osnabrueck.de\/research\/OR\/class"},{"key":"R6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01303431","volume":"43","author":"Brucker","year":"1996","journal-title":"Math. Methods Oper. Res."},{"key":"R7","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1007\/BF02248589","volume":"26","author":"Coffman","year":"1990","journal-title":"Ann. Oper. Res."},{"key":"R8","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1287\/moor.15.3.483","volume":"15","author":"Du","year":"1990","journal-title":"Math. Oper. Res."},{"key":"R9","unstructured":"L. Dupont, Ordonnancements sur machines \u00e0 traitement par batch (fourn\u00e9e).TSI10(to appear)."},{"key":"R10","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1016\/S0167-5060(08)70742-8","volume":"1","author":"Lawler","year":"1977","journal-title":"Ann. Discrete Math."},{"key":"R11","doi-asserted-by":"crossref","first-page":"798","DOI":"10.1287\/opre.37.5.798","volume":"37","author":"Monma","year":"1989","journal-title":"Oper. Res."},{"key":"R12","doi-asserted-by":"crossref","unstructured":"C.N. Potts and M.Y. Kovalyov. Scheduling with batching: A review.European J. Oper. Res.120(2000) 228-249.","DOI":"10.1016\/S0377-2217(99)00153-8"},{"key":"R13","doi-asserted-by":"crossref","first-page":"692","DOI":"10.1287\/opre.43.4.692","volume":"43","author":"Webster","year":"1995","journal-title":"Oper. Res."}],"container-title":["RAIRO - Operations Research"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ro.org\/10.1051\/ro:2001105\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,3,24]],"date-time":"2018-03-24T06:38:13Z","timestamp":1521873493000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ro.org\/10.1051\/ro:2001105"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,1]]},"references-count":13,"journal-issue":{"issue":"1"},"alternative-id":["ro2118"],"URL":"https:\/\/doi.org\/10.1051\/ro:2001105","relation":{},"ISSN":["0399-0559","1290-3868"],"issn-type":[{"value":"0399-0559","type":"print"},{"value":"1290-3868","type":"electronic"}],"subject":[],"published":{"date-parts":[[2001,1]]}}}