{"id":"https://openalex.org/W2518479268","doi":"https://doi.org/10.1109/iscc.2016.7543888","title":"Smart grid power scheduling via bottom left decreasing height packing","display_name":"Smart grid power scheduling via bottom left decreasing height packing","publication_year":2016,"publication_date":"2016-06-01","ids":{"openalex":"https://openalex.org/W2518479268","doi":"https://doi.org/10.1109/iscc.2016.7543888","mag":"2518479268"},"language":"en","primary_location":{"id":"doi:10.1109/iscc.2016.7543888","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iscc.2016.7543888","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE Symposium on Computers and Communication (ISCC)","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/A5020291473","display_name":"Anshu Ranjan","orcid":"https://orcid.org/0000-0002-2409-0827"},"institutions":[{"id":"https://openalex.org/I33213144","display_name":"University of Florida","ror":"https://ror.org/02y3ad647","country_code":"US","type":"education","lineage":["https://openalex.org/I33213144"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Anshu Ranjan","raw_affiliation_strings":["University of Florida"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Florida","institution_ids":["https://openalex.org/I33213144"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5004650986","display_name":"Pramod P. Khargonekar","orcid":"https://orcid.org/0000-0001-6634-6950"},"institutions":[{"id":"https://openalex.org/I33213144","display_name":"University of Florida","ror":"https://ror.org/02y3ad647","country_code":"US","type":"education","lineage":["https://openalex.org/I33213144"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Pramod Khargonekar","raw_affiliation_strings":["University of Florida"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Florida","institution_ids":["https://openalex.org/I33213144"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5070824596","display_name":"Sartaj Sahni","orcid":"https://orcid.org/0000-0002-8129-1676"},"institutions":[{"id":"https://openalex.org/I33213144","display_name":"University of Florida","ror":"https://ror.org/02y3ad647","country_code":"US","type":"education","lineage":["https://openalex.org/I33213144"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sartaj Sahni","raw_affiliation_strings":["University of Florida"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Florida","institution_ids":["https://openalex.org/I33213144"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I33213144"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1128","last_page":"1133"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9987000226974487,"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.9987000226974487,"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.9983999729156494,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9983000159263611,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.6833980083465576},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6603700518608093},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4947158992290497},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.4555855393409729},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4386553466320038},{"id":"https://openalex.org/keywords/grid","display_name":"Grid","score":0.4306032657623291},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.415092408657074},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3451070189476013},{"id":"https://openalex.org/keywords/simulation","display_name":"Simulation","score":0.32837799191474915},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.17792174220085144}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.6833980083465576},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6603700518608093},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4947158992290497},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.4555855393409729},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4386553466320038},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.4306032657623291},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.415092408657074},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3451070189476013},{"id":"https://openalex.org/C44154836","wikidata":"https://www.wikidata.org/wiki/Q45045","display_name":"Simulation","level":1,"score":0.32837799191474915},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.17792174220085144},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iscc.2016.7543888","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iscc.2016.7543888","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE Symposium on Computers and Communication (ISCC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/7","display_name":"Affordable and clean energy","score":0.8399999737739563}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1616987857","https://openalex.org/W1705301328","https://openalex.org/W2007927860","https://openalex.org/W2011690685","https://openalex.org/W2019318803","https://openalex.org/W2058477004","https://openalex.org/W2104680817","https://openalex.org/W2151622799","https://openalex.org/W2163144548"],"related_works":["https://openalex.org/W2280422768","https://openalex.org/W3143197806","https://openalex.org/W3177062893","https://openalex.org/W3125143773","https://openalex.org/W2007032764","https://openalex.org/W803550684","https://openalex.org/W2483226803","https://openalex.org/W4352977312","https://openalex.org/W1536056491","https://openalex.org/W2041180560"],"abstract_inverted_index":{"We":[0,16],"consider":[1],"the":[2,13,25,28,46,52,67,75,78,86,108],"scheduling":[3,79],"of":[4,20,27,61,77],"flexible":[5],"electric":[6,115,119],"power":[7,40,70,101],"loads":[8,37],"so":[9],"as":[10],"to":[11,34,66,97],"minimize":[12],"peak":[14,69,100],"load.":[15],"settle":[17],"a":[18,58],"conjecture":[19],"Alamdari":[21],"et":[22],"al.[1]":[23],"regarding":[24],"performance":[26],"bottom":[29,87],"left":[30,88],"decreasing":[31,89,111],"height":[32,90,112],"heuristic":[33,91],"schedule":[35],"preemptable":[36],"with":[38],"known":[39],"requirement":[41],"and":[42,44,51,116],"duration":[43,76],"having":[45],"same":[47,53],"earliest":[48],"start":[49],"time":[50],"deadline.":[54],"Specifically,":[55],"we":[56],"show":[57],"tight":[59],"bound":[60],"4/3":[62],"-":[63],"1/(3D)":[64],"relative":[65],"minimum":[68],"load,":[71],"where":[72],"D":[73],"is":[74],"interval.":[80],"On":[81,114],"benchmark":[82],"strip":[83],"packing":[84],"data,":[85,121],"generated":[92,106],"schedules":[93,105],"that":[94],"required":[95,103],"up":[96],"45%":[98],"less":[99],"than":[102],"by":[104],"using":[107],"next":[109],"fit":[110],"heuristic.":[113],"plug-in":[117],"hybrid":[118],"vehicles":[120],"these":[122],"two":[123],"heuristics":[124],"are":[125],"very":[126],"competitive.":[127]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":2}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}