{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:04:43Z","timestamp":1759665883715},"reference-count":11,"publisher":"World Scientific Pub Co Pte Lt","issue":"04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2011,12]]},"abstract":"<jats:p> We consider two strongly related problems, multiple strip packing and scheduling parallel jobs in platforms. In the first one we are given a list of n rectangles with heights and widths bounded by one and N strips of unit width and infinite height. The objective is to find a nonoverlapping orthogonal packing without rotations of all rectangles into the strips minimizing the maximum height used. In the scheduling problem we consider jobs instead of rectangles, i.e., we are allowed to cut the rectangles vertically and we may have target areas of different size, called platforms. A platform P<jats:sub>\u2113<\/jats:sub> is a collection of m<jats:sub>\u2113<\/jats:sub> processors running at speed s<jats:sub>\u2113<\/jats:sub> and the objective is to minimize the makespan, i.e., the latest finishing time of a job. <\/jats:p>","DOI":"10.1142\/s1793830911001413","type":"journal-article","created":{"date-parts":[[2012,1,4]],"date-time":"2012-01-04T14:00:28Z","timestamp":1325685628000},"page":"553-586","source":"Crossref","is-referenced-by-count":20,"title":["APPROXIMATION ALGORITHMS FOR MULTIPLE STRIP PACKING AND SCHEDULING PARALLEL JOBS IN PLATFORMS"],"prefix":"10.1142","volume":"03","author":[{"given":"MARIN","family":"BOUGERET","sequence":"first","affiliation":[{"name":"LIP, Ecole Normale Sup\u00e9rieure, 46 All\u00e9e d'Italie, 69007 Lyon, France"}]},{"given":"PIERRE-FRANCOIS","family":"DUTOT","sequence":"additional","affiliation":[{"name":"Laboratoire d'Informatique de Grenoble, Grenoble University, 51 Avenue Jean Kuntzmann, 38330 Montbonnot St. Martin, France"}]},{"given":"KLAUS","family":"JANSEN","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University Kiel, Christian-Albrechts-Platz 4, 24118 Kiel, Germany"}]},{"given":"CHRISTINA","family":"ROBENEK","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University Kiel, Christian-Albrechts-Platz 4, 24118 Kiel, Germany"}]},{"given":"DENIS","family":"TRYSTRAM","sequence":"additional","affiliation":[{"name":"Laboratoire d'Informatique de Grenoble, Grenoble University, 51 rue Jean Kuntzmann, 38330 Montbonnot St. Martin, France"}]}],"member":"219","published-online":{"date-parts":[[2012,4,5]]},"reference":[{"key":"rf6","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1070.0289"},{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.1137\/0209062"},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623499358689"},{"key":"rf11","doi-asserted-by":"publisher","DOI":"10.1007\/11671541_6"},{"key":"rf12","doi-asserted-by":"publisher","DOI":"10.1016\/j.disopt.2009.04.001"},{"key":"rf14","doi-asserted-by":"publisher","DOI":"10.1287\/moor.25.4.645.12118"},{"key":"rf15","doi-asserted-by":"publisher","DOI":"10.1287\/moor.4.4.339"},{"key":"rf16","doi-asserted-by":"publisher","DOI":"10.1007\/BF01585745"},{"key":"rf20","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793255801"},{"key":"rf21","first-page":"257","volume":"20","author":"Tardos \u00c9.","journal-title":"Math. Oper. Res."},{"key":"rf24","doi-asserted-by":"publisher","DOI":"10.1515\/156939206776241264"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830911001413","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T21:40:49Z","timestamp":1565127649000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830911001413"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,12]]},"references-count":11,"journal-issue":{"issue":"04","published-online":{"date-parts":[[2012,4,5]]},"published-print":{"date-parts":[[2011,12]]}},"alternative-id":["10.1142\/S1793830911001413"],"URL":"https:\/\/doi.org\/10.1142\/s1793830911001413","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,12]]}}}