{"id":"https://openalex.org/W2076672803","doi":"https://doi.org/10.1145/1148109.1148139","title":"Strip packing with precedence constraints and strip packing with release times","display_name":"Strip packing with precedence constraints and strip packing with release times","publication_year":2006,"publication_date":"2006-07-30","ids":{"openalex":"https://openalex.org/W2076672803","doi":"https://doi.org/10.1145/1148109.1148139","mag":"2076672803"},"language":"en","primary_location":{"id":"doi:10.1145/1148109.1148139","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1148109.1148139","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5016331110","display_name":"John Augustine","orcid":"https://orcid.org/0000-0003-0948-3961"},"institutions":[{"id":"https://openalex.org/I204250578","display_name":"University of California, Irvine","ror":"https://ror.org/04gyf1771","country_code":"US","type":"education","lineage":["https://openalex.org/I204250578"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"John Augustine","raw_affiliation_strings":["University of California, Irvine, CA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California, Irvine, CA","institution_ids":["https://openalex.org/I204250578"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5110227722","display_name":"Sudarshan Banerjee","orcid":null},"institutions":[{"id":"https://openalex.org/I204250578","display_name":"University of California, Irvine","ror":"https://ror.org/04gyf1771","country_code":"US","type":"education","lineage":["https://openalex.org/I204250578"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sudarshan Banerjee","raw_affiliation_strings":["University of California, Irvine, CA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California, Irvine, CA","institution_ids":["https://openalex.org/I204250578"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5067702658","display_name":"Sandy Irani","orcid":"https://orcid.org/0000-0002-0642-9436"},"institutions":[{"id":"https://openalex.org/I204250578","display_name":"University of California, Irvine","ror":"https://ror.org/04gyf1771","country_code":"US","type":"education","lineage":["https://openalex.org/I204250578"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sandy Irani","raw_affiliation_strings":["University of California, Irvine, CA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California, Irvine, CA","institution_ids":["https://openalex.org/I204250578"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I204250578"],"apc_list":null,"apc_paid":null,"fwci":3.3866,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.91344218,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"180","last_page":"189"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9972000122070312,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9968000054359436,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6680667996406555},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5791670680046082},{"id":"https://openalex.org/keywords/field-programmable-gate-array","display_name":"Field-programmable gate array","score":0.5616046190261841},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5121781826019287},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.4843381643295288},{"id":"https://openalex.org/keywords/strips","display_name":"STRIPS","score":0.47039732336997986},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.46688786149024963},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4542865753173828},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.4520260989665985},{"id":"https://openalex.org/keywords/processor-scheduling","display_name":"Processor scheduling","score":0.4513026475906372},{"id":"https://openalex.org/keywords/packing-problems","display_name":"Packing problems","score":0.4464506506919861},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.4246540665626526},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4058603346347809},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3959541320800781},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.37051650881767273},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.30073657631874084},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2543586194515228},{"id":"https://openalex.org/keywords/resource","display_name":"Resource (disambiguation)","score":0.24926841259002686},{"id":"https://openalex.org/keywords/computer-hardware","display_name":"Computer hardware","score":0.09284347295761108}],"concepts":[{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6680667996406555},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5791670680046082},{"id":"https://openalex.org/C42935608","wikidata":"https://www.wikidata.org/wiki/Q190411","display_name":"Field-programmable gate array","level":2,"score":0.5616046190261841},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5121781826019287},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.4843381643295288},{"id":"https://openalex.org/C200925200","wikidata":"https://www.wikidata.org/wiki/Q7624170","display_name":"STRIPS","level":2,"score":0.47039732336997986},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.46688786149024963},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4542865753173828},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4520260989665985},{"id":"https://openalex.org/C2984822820","wikidata":"https://www.wikidata.org/wiki/Q1123036","display_name":"Processor scheduling","level":3,"score":0.4513026475906372},{"id":"https://openalex.org/C130253271","wikidata":"https://www.wikidata.org/wiki/Q3851477","display_name":"Packing problems","level":2,"score":0.4464506506919861},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.4246540665626526},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4058603346347809},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3959541320800781},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.37051650881767273},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.30073657631874084},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2543586194515228},{"id":"https://openalex.org/C206345919","wikidata":"https://www.wikidata.org/wiki/Q20380951","display_name":"Resource (disambiguation)","level":2,"score":0.24926841259002686},{"id":"https://openalex.org/C9390403","wikidata":"https://www.wikidata.org/wiki/Q3966","display_name":"Computer hardware","level":1,"score":0.09284347295761108},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1148109.1148139","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1148109.1148139","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W1492611605","https://openalex.org/W1916275345","https://openalex.org/W1985211757","https://openalex.org/W1997959089","https://openalex.org/W2010224807","https://openalex.org/W2012329067","https://openalex.org/W2019318803","https://openalex.org/W2025787252","https://openalex.org/W2031210751","https://openalex.org/W2043913312","https://openalex.org/W2055717964","https://openalex.org/W2059422698","https://openalex.org/W2060963575","https://openalex.org/W2062918232","https://openalex.org/W2081840458","https://openalex.org/W2092293193","https://openalex.org/W2106970052","https://openalex.org/W2110256264","https://openalex.org/W2123068254","https://openalex.org/W2145028977","https://openalex.org/W2149935414","https://openalex.org/W2165033395","https://openalex.org/W2168190509","https://openalex.org/W2611147814"],"related_works":["https://openalex.org/W4377371889","https://openalex.org/W3000738495","https://openalex.org/W1862126075","https://openalex.org/W2113623403","https://openalex.org/W2055932080","https://openalex.org/W4299801389","https://openalex.org/W4389362338","https://openalex.org/W1968512104","https://openalex.org/W2025093995","https://openalex.org/W2565109825"],"abstract_inverted_index":{"This":[0],"paper":[1],"examines":[2],"two":[3],"variants":[4,52],"of":[5,40,68,71,83,89,114,137],"strip":[6,190],"packing:":[7],"when":[8,18],"the":[9,19,81,86,94,118,135,142,148,157,208,212,231,242],"rectangles":[10,20,149,213,232],"to":[11,29,156,173,225],"be":[12,27,226],"placed":[13],"have":[14,21,123,150,214],"precedence":[15,124],"constraints":[16],"and":[17,80,107,153,166,251],"release":[22,193],"times.":[23],"Strip":[24],"packing":[25,191],"can":[26],"used":[28],"model":[30],"scheduling":[31,58,160],"problems":[32],"in":[33,46,120,145,227,241,249,255],"which":[34,121,146],"tasks":[35,59,122],"require":[36,223],"a":[37,47,77,103,111,239],"contiguous":[38,112],"subset":[39,113],"identical":[41],"resources":[42],"that":[43,93,211],"are":[44,55,233],"arranged":[45],"linear":[48,87],"topology.":[49],"The":[50],"particular":[51],"studied":[53,161],"here":[54],"motivated":[56],"by":[57,162],"for":[60,184],"dynamically":[61],"reconfigurable":[62],"Field-Programmable":[63],"Gate":[64],"Arrays":[65],"(FPGAs)":[66],"comprised":[67],"an":[69,128,181,197],"array":[70,82],"computing":[72,78],"columns.":[73,116],"Each":[74],"column":[75,240],"is":[76,102,134,247],"resource":[79,158],"columns":[84],"forms":[85],"topology":[88],"resources.":[90],"We":[91,139,178,206],"assume":[92],"given":[95],"FPGA":[96],"has":[97],"K":[98,101],"columns,":[99],"where":[100,132],"fixed":[104],"positive":[105],"integer,":[106],"each":[108],"task":[109],"occupies":[110],"these":[115],"For":[117,189],"case":[119,144,176,187],"constraints,":[125],"we":[126,195,221],"give":[127,180],"O(log":[129],"n)":[130],"approximation,":[131],"n":[133,250],"number":[136],"tasks.":[138],"then":[140],"consider":[141],"special":[143,175,186],"all":[147],"uniform":[151],"height":[152,215],"reduce":[154],"it":[155],"constrained":[159],"Garey,":[163],"Graham,":[164],"Johnson":[165],"Yao,":[167],"thereby":[168],"extending":[169],"their":[170],"asymptotic":[171,198],"results":[172],"our":[174],"problem.":[177,188],"also":[179,222],"absolute":[182],"3-approximation":[183],"this":[185],"with":[192],"times,":[194],"provide":[196],"polynomial":[199,248],"time":[200,246],"(1":[201],"+":[202],"e)-":[203],"approximation":[204],"scheme.":[205],"make":[207],"standard":[209],"assumption":[210],"at":[216,234],"most":[217],"1.":[218],"In":[219],"addition,":[220],"widths":[224],"[1K,":[228],"1],":[229],"i.e.,":[230],"least":[235],"as":[236,238],"wide":[237],"FPGA.":[243],"Our":[244],"running":[245],"1/e,":[252],"but":[253],"exponential":[254],"K.":[256]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}