{"id":"https://openalex.org/W2015110010","doi":"https://doi.org/10.1142/s0129054109006541","title":"SINGLE MACHINE SCHEDULING WITH CONTROLLABLE PROCESSING TIMES BY SUBMODULAR OPTIMIZATION","display_name":"SINGLE MACHINE SCHEDULING WITH CONTROLLABLE PROCESSING TIMES BY SUBMODULAR OPTIMIZATION","publication_year":2009,"publication_date":"2009-04-01","ids":{"openalex":"https://openalex.org/W2015110010","doi":"https://doi.org/10.1142/s0129054109006541","mag":"2015110010"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054109006541","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054109006541","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","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/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":["School of Computing, University of Leeds, Leeds LS2 9JT, U.K"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computing, University of Leeds, Leeds LS2 9JT, U.K","institution_ids":["https://openalex.org/I130828816"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5067169957","display_name":"Akiyoshi Shioura","orcid":"https://orcid.org/0000-0002-5216-7190"},"institutions":[{"id":"https://openalex.org/I201537933","display_name":"Tohoku University","ror":"https://ror.org/01dq60k83","country_code":"JP","type":"education","lineage":["https://openalex.org/I201537933"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"AKIYOSHI SHIOURA","raw_affiliation_strings":["Graduate School of Information Sciences, Tohoku University, Sendai 980-8579, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Graduate School of Information Sciences, Tohoku University, Sendai 980-8579, Japan","institution_ids":["https://openalex.org/I201537933"]}]},{"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":["School of Computing and Mathematical Sciences, University of Greenwich, Old Royal Naval College, Park Row, Greenwich, London SE10 9LS, U.K"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computing and Mathematical Sciences, University of Greenwich, Old Royal Naval College, Park Row, Greenwich, London SE10 9LS, U.K","institution_ids":["https://openalex.org/I55060895"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.14754756,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"20","issue":"02","first_page":"247","last_page":"269"},"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/T12176","display_name":"Optimization and Packing Problems","score":0.9990000128746033,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/submodular-set-function","display_name":"Submodular set function","score":0.774494469165802},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6162348985671997},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6045124530792236},{"id":"https://openalex.org/keywords/polyhedron","display_name":"Polyhedron","score":0.573737382888794},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5169996023178101},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.5163161158561707},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.49196597933769226},{"id":"https://openalex.org/keywords/single-machine-scheduling","display_name":"Single-machine scheduling","score":0.4816957414150238},{"id":"https://openalex.org/keywords/parametric-statistics","display_name":"Parametric statistics","score":0.4421309530735016},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.4329341650009155},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.42183881998062134},{"id":"https://openalex.org/keywords/intersection","display_name":"Intersection (aeronautics)","score":0.4212053716182709},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3862376809120178},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3307466506958008},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.13161304593086243}],"concepts":[{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.774494469165802},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6162348985671997},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6045124530792236},{"id":"https://openalex.org/C54829058","wikidata":"https://www.wikidata.org/wiki/Q172937","display_name":"Polyhedron","level":2,"score":0.573737382888794},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5169996023178101},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.5163161158561707},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.49196597933769226},{"id":"https://openalex.org/C2780271269","wikidata":"https://www.wikidata.org/wiki/Q19295956","display_name":"Single-machine scheduling","level":4,"score":0.4816957414150238},{"id":"https://openalex.org/C117251300","wikidata":"https://www.wikidata.org/wiki/Q1849855","display_name":"Parametric statistics","level":2,"score":0.4421309530735016},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.4329341650009155},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.42183881998062134},{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.4212053716182709},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3862376809120178},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3307466506958008},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.13161304593086243},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","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/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1142/s0129054109006541","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054109006541","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:eprints.whiterose.ac.uk:5411","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:9033","is_oa":false,"landing_page_url":"http://gala.gre.ac.uk/id/eprint/9033/","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":[{"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8","score":0.5099999904632568}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W1488090470","https://openalex.org/W1501066815","https://openalex.org/W1566552089","https://openalex.org/W1576820654","https://openalex.org/W1577174000","https://openalex.org/W1874694348","https://openalex.org/W1975784696","https://openalex.org/W1977583446","https://openalex.org/W1984997732","https://openalex.org/W1989262026","https://openalex.org/W2015790145","https://openalex.org/W2020006381","https://openalex.org/W2020909460","https://openalex.org/W2036829682","https://openalex.org/W2042275390","https://openalex.org/W2061274033","https://openalex.org/W2088994929","https://openalex.org/W2104988268","https://openalex.org/W2163313667","https://openalex.org/W2321002772","https://openalex.org/W2595377754","https://openalex.org/W2752885492","https://openalex.org/W4242336842","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2402949237","https://openalex.org/W2964314169","https://openalex.org/W2594118609","https://openalex.org/W2968699064","https://openalex.org/W3204684126","https://openalex.org/W4389478405","https://openalex.org/W2735578456","https://openalex.org/W2963059222","https://openalex.org/W1964613426","https://openalex.org/W3008838497"],"abstract_inverted_index":{"In":[0,35],"scheduling":[1],"with":[2,137],"controllable":[3],"processing":[4,8],"times":[5],"the":[6,18,21,29,36,40,49,59,69,104,110,119,131,143,154,161,177,187,199],"actual":[7],"time":[9],"of":[10,51,95,103,125,133,168,176],"each":[11,175],"job":[12,65],"is":[13,54,76,79,107,113,146],"to":[14,81,114,122,198],"be":[15,115,158,193],"chosen":[16],"from":[17,195],"interval":[19],"between":[20,86],"smallest":[22],"(compressed":[23],"or":[24,32],"fully":[25],"crashed)":[26],"value":[27],"and":[28,48,68,78,153],"largest":[30],"(decompressed":[31],"uncrashed)":[33],"value.":[34],"problems":[37],"under":[38],"consideration,":[39],"jobs":[41],"are":[42],"processed":[43],"on":[44,64],"a":[45,52,93,123,134,138,149,196],"single":[46,97,179],"machine":[47],"quality":[50],"schedule":[53],"measured":[55],"by":[56,148,160],"two":[57,88,166],"functions:":[58],"maximum":[60],"cost":[61],"(that":[62],"depends":[63],"completion":[66],"times)":[67],"total":[70],"compression":[71],"cost.":[72],"Our":[73],"main":[74],"model":[75],"bicriteria":[77,120,200],"related":[80],"determining":[82],"an":[83],"optimal":[84],"trade-off":[85],"these":[87],"objectives.":[89],"Additionally,":[90],"we":[91,182],"consider":[92],"pair":[94],"associated":[96,178],"criterion":[98,180],"problems,":[99,181],"in":[100],"which":[101],"one":[102,112],"objective":[105],"functions":[106],"bounded":[108],"while":[109],"other":[111],"minimized.":[116],"We":[117,140],"reduce":[118],"problem":[121,156],"series":[124],"parametric":[126],"linear":[127],"programs":[128],"defined":[129],"over":[130],"intersection":[132],"submodular":[135],"polyhedron":[136,152],"box.":[139],"demonstrate":[141],"that":[142,164,185],"feasible":[144],"region":[145],"represented":[147],"so-called":[150],"base":[151],"corresponding":[155],"can":[157,192],"solved":[159],"greedy":[162],"algorithm":[163],"runs":[165],"orders":[167],"magnitude":[169],"faster":[170,189],"than":[171,190],"known":[172],"previously.":[173],"For":[174],"develop":[183],"algorithms":[184],"deliver":[186],"optimum":[188],"it":[191],"deduced":[194],"solution":[197],"problem.":[201]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}