{"id":"https://openalex.org/W2054583971","doi":"https://doi.org/10.1109/smc.2014.6974518","title":"Two-level decomposition algorithm for shift scheduling problems","display_name":"Two-level decomposition algorithm for shift scheduling problems","publication_year":2014,"publication_date":"2014-10-01","ids":{"openalex":"https://openalex.org/W2054583971","doi":"https://doi.org/10.1109/smc.2014.6974518","mag":"2054583971"},"language":"en","primary_location":{"id":"doi:10.1109/smc.2014.6974518","is_oa":false,"landing_page_url":"https://doi.org/10.1109/smc.2014.6974518","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE International Conference on Systems, Man, and Cybernetics (SMC)","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/A5084970737","display_name":"Tsubasa Doi","orcid":null},"institutions":[{"id":"https://openalex.org/I98285908","display_name":"Osaka University","ror":"https://ror.org/035t8zc32","country_code":"JP","type":"education","lineage":["https://openalex.org/I98285908"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Tsubasa Doi","raw_affiliation_strings":["Graduate School of Engineering Science, Osaka University 1\u20133 Machikaneyama-cho, Toyonaka, Japan","Graduate School of Engineering Science, Osaka University, 1-3 Machikaneyama-cho, Toyonaka city, 560-8531, Japan"],"affiliations":[{"raw_affiliation_string":"Graduate School of Engineering Science, Osaka University 1\u20133 Machikaneyama-cho, Toyonaka, Japan","institution_ids":["https://openalex.org/I98285908"]},{"raw_affiliation_string":"Graduate School of Engineering Science, Osaka University, 1-3 Machikaneyama-cho, Toyonaka city, 560-8531, Japan","institution_ids":["https://openalex.org/I98285908"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5033193171","display_name":"Tatsushi Nishi","orcid":"https://orcid.org/0000-0003-1354-3939"},"institutions":[{"id":"https://openalex.org/I98285908","display_name":"Osaka University","ror":"https://ror.org/035t8zc32","country_code":"JP","type":"education","lineage":["https://openalex.org/I98285908"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Tatsushi Nishi","raw_affiliation_strings":["Graduate School of Engineering Science, Osaka University 1\u20133 Machikaneyama-cho, Toyonaka, Japan","Graduate School of Engineering Science, Osaka University, 1-3 Machikaneyama-cho, Toyonaka city, 560-8531, Japan"],"affiliations":[{"raw_affiliation_string":"Graduate School of Engineering Science, Osaka University 1\u20133 Machikaneyama-cho, Toyonaka, Japan","institution_ids":["https://openalex.org/I98285908"]},{"raw_affiliation_string":"Graduate School of Engineering Science, Osaka University, 1-3 Machikaneyama-cho, Toyonaka city, 560-8531, Japan","institution_ids":["https://openalex.org/I98285908"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5084970737"],"corresponding_institution_ids":["https://openalex.org/I98285908"],"apc_list":null,"apc_paid":null,"fwci":0.8116,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.77721474,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"96","issue":null,"first_page":"3773","last_page":"3778"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.991100013256073,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9837999939918518,"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/computer-science","display_name":"Computer science","score":0.656054675579071},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6488931775093079},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.6080332398414612},{"id":"https://openalex.org/keywords/embedding","display_name":"Embedding","score":0.5617170929908752},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.5482171773910522},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5365429520606995},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.5353116989135742},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.5179175734519958},{"id":"https://openalex.org/keywords/working-set","display_name":"Working set","score":0.5104374289512634},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.48683398962020874},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.42646247148513794},{"id":"https://openalex.org/keywords/decomposition-method","display_name":"Decomposition method (queueing theory)","score":0.4249730706214905},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.42276039719581604},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.22910860180854797},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.13006997108459473},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.09418341517448425},{"id":"https://openalex.org/keywords/stochastic-programming","display_name":"Stochastic programming","score":0.08734837174415588},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.068439781665802}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.656054675579071},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6488931775093079},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.6080332398414612},{"id":"https://openalex.org/C41608201","wikidata":"https://www.wikidata.org/wiki/Q980509","display_name":"Embedding","level":2,"score":0.5617170929908752},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.5482171773910522},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5365429520606995},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.5353116989135742},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.5179175734519958},{"id":"https://openalex.org/C88196245","wikidata":"https://www.wikidata.org/wiki/Q8034984","display_name":"Working set","level":2,"score":0.5104374289512634},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.48683398962020874},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.42646247148513794},{"id":"https://openalex.org/C2778258933","wikidata":"https://www.wikidata.org/wiki/Q16918986","display_name":"Decomposition method (queueing theory)","level":2,"score":0.4249730706214905},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.42276039719581604},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22910860180854797},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.13006997108459473},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.09418341517448425},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.08734837174415588},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.068439781665802},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"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":1,"locations":[{"id":"doi:10.1109/smc.2014.6974518","is_oa":false,"landing_page_url":"https://doi.org/10.1109/smc.2014.6974518","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE International Conference on Systems, Man, and Cybernetics (SMC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6399999856948853,"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1508945008","https://openalex.org/W1970893511","https://openalex.org/W1988694131","https://openalex.org/W2003790321","https://openalex.org/W2011397103","https://openalex.org/W2020847624","https://openalex.org/W2042138197","https://openalex.org/W2080463510","https://openalex.org/W2123696861"],"related_works":["https://openalex.org/W3172150420","https://openalex.org/W2107725657","https://openalex.org/W4206466499","https://openalex.org/W4213379045","https://openalex.org/W3190401582","https://openalex.org/W2162001022","https://openalex.org/W4205832532","https://openalex.org/W2074319831","https://openalex.org/W1495529833","https://openalex.org/W1490262345"],"abstract_inverted_index":{"We":[0],"propose":[1],"a":[2,97],"new":[3],"two-level":[4],"decomposition":[5],"algorithm":[6],"for":[7],"shift":[8],"scheduling":[9],"problems.":[10],"The":[11,33,43,61],"problem":[12,67],"determines":[13],"the":[14,22,29,36,51,65,69,72,83,90,93],"assignment":[15],"of":[16,24,38,45,53,58,92],"duties":[17],"and":[18,71],"rest":[19],"days":[20],"to":[21,27,49],"set":[23,37],"staff":[25,39],"members":[26,40],"minimize":[28],"given":[30],"objective":[31,44],"function.":[32],"constraint":[34,99],"on":[35],"are":[41,76],"considered.":[42],"this":[46],"paper":[47],"is":[48],"achieve":[50],"minimization":[52],"total":[54],"costs":[55],"with":[56,79],"fairness":[57],"working":[59],"conditions.":[60],"proposed":[62,94],"method":[63,95],"decomposes":[64],"original":[66],"into":[68,82],"master":[70,84],"subproblems.":[73],"These":[74],"subproblems":[75],"iteratively":[77],"solved":[78],"embedding":[80],"cuts":[81],"problem.":[85],"Computational":[86],"results":[87],"show":[88],"that":[89],"performance":[91],"outperforms":[96],"general-purpose":[98],"logic":[100],"programming":[101],"solver.":[102]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}