{"id":"https://openalex.org/W2032653627","doi":"https://doi.org/10.1137/110843836","title":"A Submodular Optimization Approach to Bicriteria Scheduling Problems with Controllable Processing Times on Parallel Machines","display_name":"A Submodular Optimization Approach to Bicriteria Scheduling Problems with Controllable Processing Times on Parallel Machines","publication_year":2013,"publication_date":"2013-01-01","ids":{"openalex":"https://openalex.org/W2032653627","doi":"https://doi.org/10.1137/110843836","mag":"2032653627"},"language":"en","primary_location":{"id":"doi:10.1137/110843836","is_oa":false,"landing_page_url":"https://doi.org/10.1137/110843836","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","raw_type":"journal-article"},"type":"article","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/A5067169957","display_name":"Akiyoshi Shioura","orcid":"https://orcid.org/0000-0002-5216-7190"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Akiyoshi Shioura","raw_affiliation_strings":["INF - System Information Sciences"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"INF - System Information Sciences","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5091211971","display_name":"Natalia V. Shakhlevich","orcid":"https://orcid.org/0000-0002-5225-4008"},"institutions":[{"id":"https://openalex.org/I130828816","display_name":"University of Leeds","ror":"https://ror.org/024mrxd33","country_code":"GB","type":"education","lineage":["https://openalex.org/I130828816"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Natalia V. Shakhlevich","raw_affiliation_strings":["(University of Leeds"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"(University of Leeds","institution_ids":["https://openalex.org/I130828816"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5049506022","display_name":"Vitaly A. Strusevich","orcid":"https://orcid.org/0000-0002-4602-8573"},"institutions":[{"id":"https://openalex.org/I55060895","display_name":"University of Greenwich","ror":"https://ror.org/00bmj0a71","country_code":"GB","type":"education","lineage":["https://openalex.org/I55060895"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Vitaly A. Strusevich","raw_affiliation_strings":["Univ. of Greenwich"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Univ. of Greenwich","institution_ids":["https://openalex.org/I55060895"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.2581,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.91305542,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"27","issue":"1","first_page":"186","last_page":"204"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9998999834060669,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9998999834060669,"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.9943000078201294,"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9941999912261963,"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/submodular-set-function","display_name":"Submodular set function","score":0.8272302150726318},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.736819326877594},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6232277154922485},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.583556592464447},{"id":"https://openalex.org/keywords/polyhedron","display_name":"Polyhedron","score":0.5635493993759155},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5527323484420776},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5150351524353027},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4213572144508362},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2958144545555115},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.21063196659088135}],"concepts":[{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.8272302150726318},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.736819326877594},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6232277154922485},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.583556592464447},{"id":"https://openalex.org/C54829058","wikidata":"https://www.wikidata.org/wiki/Q172937","display_name":"Polyhedron","level":2,"score":0.5635493993759155},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5527323484420776},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5150351524353027},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4213572144508362},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2958144545555115},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.21063196659088135},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1137/110843836","is_oa":false,"landing_page_url":"https://doi.org/10.1137/110843836","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","raw_type":"journal-article"},{"id":"pmh:oai:eprints.whiterose.ac.uk:75764","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4306400854","display_name":"White Rose Research Online (University of Leeds, The University of Sheffield, University of York)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2800616092","host_organization_name":"White Rose University Consortium","host_organization_lineage":["https://openalex.org/I2800616092"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"","raw_type":"Article"},{"id":"pmh:oai:gala.gre.ac.uk:10123","is_oa":false,"landing_page_url":"http://gala.gre.ac.uk/id/eprint/10123/","pdf_url":null,"source":{"id":"https://openalex.org/S4306401244","display_name":"Greenwich Academic Literature Archive (University of Greenwich)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I55060895","host_organization_name":"University of Greenwich","host_organization_lineage":["https://openalex.org/I55060895"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G159891768","display_name":"Development of Approximation Algorithms with Theoretical Guarantee for Integer Programming Problem with Nonlinear Constraint","funder_award_id":"24500002","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"},{"id":"https://openalex.org/G8868680932","display_name":null,"funder_award_id":"EP/J019755/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"},{"id":"https://openalex.org/F4320334764","display_name":"Japan Society for the Promotion of Science","ror":"https://ror.org/00hhkn466"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W1488090470","https://openalex.org/W1576820654","https://openalex.org/W1577174000","https://openalex.org/W1975784696","https://openalex.org/W1977583446","https://openalex.org/W1984997732","https://openalex.org/W1990176814","https://openalex.org/W2015110010","https://openalex.org/W2015790145","https://openalex.org/W2020909460","https://openalex.org/W2042275390","https://openalex.org/W2043913312","https://openalex.org/W2057412510","https://openalex.org/W2073821436","https://openalex.org/W2104988268","https://openalex.org/W2126734353","https://openalex.org/W2163313667","https://openalex.org/W2341350247","https://openalex.org/W2576116471","https://openalex.org/W2752853835","https://openalex.org/W2808376720"],"related_works":["https://openalex.org/W1595919516","https://openalex.org/W2945022594","https://openalex.org/W2966531942","https://openalex.org/W2194604332","https://openalex.org/W4379619607","https://openalex.org/W4386185001","https://openalex.org/W4236048596","https://openalex.org/W2922450688","https://openalex.org/W3204654320","https://openalex.org/W4287599015"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3,85,96],"present":[4],"a":[5,77],"general":[6],"methodology":[7],"for":[8,12,70,79,92],"designing":[9],"polynomial-time":[10,89],"algorithms":[11],"bicriteria":[13],"scheduling":[14,57],"problems":[15,58,84],"on":[16],"parallel":[17],"machines":[18],"with":[19],"controllable":[20],"processing":[21],"times.":[22],"For":[23],"each":[24],"considered":[25,83],"problem,":[26],"the":[27,31,34,39,44,47,51,56,72,82,87,93,99],"two":[28,80],"criteria":[29],"are":[30],"makespan":[32],"and":[33,38,66],"total":[35],"compression":[36],"cost,":[37],"solution":[40],"is":[41],"delivered":[42],"in":[43,59],"form":[45],"of":[46,50,61,81],"break":[48],"points":[49],"efficient":[52,68],"frontier.":[53],"We":[54],"reformulate":[55],"terms":[60],"optimization":[62],"over":[63],"submodular":[64],"polyhedra":[65],"give":[67],"procedures":[69],"computing":[71],"corresponding":[73],"rank":[74],"functions.":[75],"As":[76],"result,":[78],"obtain":[86],"first":[88],"algorithms,":[90],"while":[91],"third":[94],"problem":[95],"considerably":[97],"improve":[98],"known":[100],"running":[101],"time.":[102]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-07-31T08:31:51.225901","created_date":"2025-10-10T00:00:00"}