{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:27:32Z","timestamp":1750220852362,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":6,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,6,17]],"date-time":"2019-06-17T00:00:00Z","timestamp":1560729600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"DFG German Research Foundation","award":["JA 612\/20-1"],"award-info":[{"award-number":["JA 612\/20-1"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,6,17]]},"DOI":"10.1145\/3323165.3323200","type":"proceedings-article","created":{"date-parts":[[2019,6,18]],"date-time":"2019-06-18T12:14:30Z","timestamp":1560860070000},"page":"155-164","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Near-Linear Approximation Algorithms for Scheduling Problems with Batch Setup Times"],"prefix":"10.1145","author":[{"given":"Max A.","family":"Deppert","sequence":"first","affiliation":[{"name":"Kiel University, Kiel, Germany"}]},{"given":"Klaus","family":"Jansen","sequence":"additional","affiliation":[{"name":"Kiel University, Kiel, Germany"}]}],"member":"320","published-online":{"date-parts":[[2019,6,17]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1137\/0222078"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-07557-0_21"},{"key":"e_1_3_2_1_3_1","first-page":"798","article-title":"Near-Linear Approximation Algorithms for Scheduling Problems with Batch Setup Times. Extended version (2019). a and Chris N. Potts. 1989. On the Complexity of Scheduling with Batch Setup Times","volume":"37","author":"Deppert Max A.","year":"2019","unstructured":"Max A. Deppert and Klaus Jansen . 2019 . Near-Linear Approximation Algorithms for Scheduling Problems with Batch Setup Times. Extended version (2019). a and Chris N. Potts. 1989. On the Complexity of Scheduling with Batch Setup Times . Operations Research , Vol. 37 , 5 (1989), 798 -- 804 . Max A. Deppert and Klaus Jansen. 2019. Near-Linear Approximation Algorithms for Scheduling Problems with Batch Setup Times. Extended version (2019). a and Chris N. Potts. 1989. On the Complexity of Scheduling with Batch Setup Times. Operations Research, Vol. 37, 5 (1989), 798--804.","journal-title":"Operations Research"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.41.5.981"},{"key":"e_1_3_2_1_5_1","volume-title":"Proc. SODA","author":"Schuurman Petra","year":"1999","unstructured":"Petra Schuurman and Gerhard J. Woeginger . 1999. Preemptive Scheduling with Job-Dependent Setup Times . In Proc. SODA 1999 . 759--767. Petra Schuurman and Gerhard J. Woeginger. 1999. Preemptive Scheduling with Job-Dependent Setup Times. In Proc. SODA 1999. 759--767."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(00)00176-1"}],"event":{"name":"SPAA '19: 31st ACM Symposium on Parallelism in Algorithms and Architectures","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture","EATCS European Association for Theoretical Computer Science"],"location":"Phoenix AZ USA","acronym":"SPAA '19"},"container-title":["The 31st ACM Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3323165.3323200","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3323165.3323200","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:23:16Z","timestamp":1750202596000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3323165.3323200"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,17]]},"references-count":6,"alternative-id":["10.1145\/3323165.3323200","10.1145\/3323165"],"URL":"https:\/\/doi.org\/10.1145\/3323165.3323200","relation":{},"subject":[],"published":{"date-parts":[[2019,6,17]]},"assertion":[{"value":"2019-06-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}