{"id":"https://openalex.org/W2110419055","doi":"https://doi.org/10.1109/case.2011.6042459","title":"A unified approach for the scheduling problem with rejection","display_name":"A unified approach for the scheduling problem with rejection","publication_year":2011,"publication_date":"2011-08-01","ids":{"openalex":"https://openalex.org/W2110419055","doi":"https://doi.org/10.1109/case.2011.6042459","mag":"2110419055"},"language":"en","primary_location":{"id":"doi:10.1109/case.2011.6042459","is_oa":false,"landing_page_url":"https://doi.org/10.1109/case.2011.6042459","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE International Conference on Automation Science and Engineering","raw_type":"proceedings-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/A5010738368","display_name":"Shunji Tanaka","orcid":"https://orcid.org/0000-0002-0181-743X"},"institutions":[{"id":"https://openalex.org/I22299242","display_name":"Kyoto University","ror":"https://ror.org/02kpeqv85","country_code":"JP","type":"education","lineage":["https://openalex.org/I22299242"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Shunji Tanaka","raw_affiliation_strings":["Department of Electrical Engineering, Kyoto University, Kyoto, Japan","Department of Electrical Engineering, Kyoto University, Kyotodaigaku-Katsura, Nishikyo-ku, 615-8510, Japan"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, Kyoto University, Kyoto, Japan","institution_ids":["https://openalex.org/I22299242"]},{"raw_affiliation_string":"Department of Electrical Engineering, Kyoto University, Kyotodaigaku-Katsura, Nishikyo-ku, 615-8510, Japan","institution_ids":["https://openalex.org/I22299242"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5010738368"],"corresponding_institution_ids":["https://openalex.org/I22299242"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.21588187,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"369","last_page":"374"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":1.0,"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":1.0,"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/T12782","display_name":"Assembly Line Balancing Optimization","score":0.9904999732971191,"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.9889000058174133,"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/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.6780045032501221},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6452488899230957},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6444423198699951},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.6401107311248779},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.6200127005577087},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.6055072546005249},{"id":"https://openalex.org/keywords/flow-shop-scheduling","display_name":"Flow shop scheduling","score":0.5477579832077026},{"id":"https://openalex.org/keywords/two-level-scheduling","display_name":"Two-level scheduling","score":0.4916577935218811},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.4909718334674835},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.47122323513031006},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.4243113398551941},{"id":"https://openalex.org/keywords/single-machine-scheduling","display_name":"Single-machine scheduling","score":0.4199938476085663},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.22346079349517822}],"concepts":[{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.6780045032501221},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6452488899230957},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6444423198699951},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.6401107311248779},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.6200127005577087},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.6055072546005249},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.5477579832077026},{"id":"https://openalex.org/C119948110","wikidata":"https://www.wikidata.org/wiki/Q7858726","display_name":"Two-level scheduling","level":4,"score":0.4916577935218811},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.4909718334674835},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.47122323513031006},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.4243113398551941},{"id":"https://openalex.org/C2780271269","wikidata":"https://www.wikidata.org/wiki/Q19295956","display_name":"Single-machine scheduling","level":4,"score":0.4199938476085663},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22346079349517822},{"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/case.2011.6042459","is_oa":false,"landing_page_url":"https://doi.org/10.1109/case.2011.6042459","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE International Conference on Automation Science and Engineering","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth","score":0.550000011920929}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W40309320","https://openalex.org/W1543365144","https://openalex.org/W1982727680","https://openalex.org/W1985691358","https://openalex.org/W2023149476","https://openalex.org/W2042713767","https://openalex.org/W2047571228","https://openalex.org/W2047928292","https://openalex.org/W2054534588","https://openalex.org/W2076768957","https://openalex.org/W2109163399","https://openalex.org/W2113664547","https://openalex.org/W2125613510","https://openalex.org/W2743045177","https://openalex.org/W4234569973"],"related_works":["https://openalex.org/W2184166483","https://openalex.org/W2949165180","https://openalex.org/W2155809154","https://openalex.org/W2838819579","https://openalex.org/W131757205","https://openalex.org/W2807934311","https://openalex.org/W2533899164","https://openalex.org/W2057737420","https://openalex.org/W2596081411","https://openalex.org/W2384952691"],"abstract_inverted_index":{"This":[0,10,102],"paper":[1,67],"is":[2,12,39,47,54,68,81,158],"devoted":[3],"to":[4,13,24,105,113,160],"the":[5,26,56,78,82,92,114,123,155,162],"scheduling":[6,60,72,94,111,116,137,150],"problem":[7,11,53,73,95],"with":[8,74,96,118,139],"rejection.":[9,119],"determine":[14],"which":[15,77],"jobs":[16,28],"should":[17],"be":[18,89,128],"accepted":[19,27],"or":[20,41],"rejected,":[21],"and":[22,59],"then":[23],"schedule":[25,37,45,79],"on":[29],"machines":[30],"so":[31,166],"that":[32],"total":[33,42],"rejection":[34,75,140],"cost":[35,38,46,80],"plus":[36],"minimized,":[40],"revenue":[43],"minus":[44],"maximized.":[48],"The":[49,62,71,120],"latter":[50],"equivalent":[51],"maximization":[52],"called":[55],"order":[57],"acceptance":[58],"problem.":[61],"main":[63],"result":[64],"of":[65,84,122,135],"this":[66],"very":[69],"simple.":[70],"in":[76],"sum":[83],"job":[85,99],"completion":[86,100],"costs":[87],"can":[88],"converted":[90],"into":[91],"ordinary":[93,110,148],"slightly":[97],"modified":[98],"costs.":[101],"enables":[103],"us":[104],"apply":[106],"algorithms":[107,146],"developed":[108],"for":[109,147],"problems":[112,117,138],"corresponding":[115],"effectiveness":[121],"proposed":[124,156],"conversion":[125],"method":[126,157],"will":[127],"demonstrated":[129],"by":[130,143],"numerical":[131],"experiment:":[132],"Several":[133],"types":[134],"single-machine":[136,149],"are":[141],"solved":[142],"our":[144],"exact":[145],"problems.":[151],"As":[152],"a":[153],"result,":[154],"shown":[159],"outperform":[161],"best":[163],"branch-and-bound":[164],"algorithm":[165],"far.":[167]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}